TSTP Solution File: NUM750^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM750^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:45:30 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 32 ( 16 unt; 7 typ; 0 def)
% Number of atoms : 98 ( 28 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 168 ( 19 ~; 11 |; 0 &; 132 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 32 ( 0 ^ 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
frac: $tType ).
thf(func_def_0,type,
frac: $tType ).
thf(func_def_1,type,
x: frac ).
thf(func_def_2,type,
y: frac ).
thf(func_def_3,type,
z: frac ).
thf(func_def_4,type,
eq: frac > frac > $o ).
thf(func_def_6,type,
pf: frac > frac > frac ).
thf(f26,plain,
$false,
inference(subsumption_resolution,[],[f25,f22]) ).
thf(f22,plain,
! [X0: frac] :
( ( eq @ X0 @ X0 )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
! [X0: frac] :
( ( eq @ X0 @ X0 )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
! [X0: frac] : ( eq @ X0 @ X0 ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X0: frac] : ( eq @ X0 @ X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz37) ).
thf(f25,plain,
( ( eq @ z @ z )
!= $true ),
inference(subsumption_resolution,[],[f24,f19]) ).
thf(f19,plain,
( ( eq @ x @ y )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( eq @ x @ y )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
eq @ x @ y,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
eq @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e) ).
thf(f24,plain,
( ( ( eq @ x @ y )
!= $true )
| ( ( eq @ z @ z )
!= $true ) ),
inference(trivial_inequality_removal,[],[f23]) ).
thf(f23,plain,
( ( ( eq @ z @ z )
!= $true )
| ( ( eq @ x @ y )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f20,f21]) ).
thf(f21,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( eq @ ( pf @ X3 @ X2 ) @ ( pf @ X0 @ X1 ) ) )
| ( $true
!= ( eq @ X3 @ X0 ) )
| ( ( eq @ X2 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( eq @ X2 @ X1 )
!= $true )
| ( $true
= ( eq @ ( pf @ X3 @ X2 ) @ ( pf @ X0 @ X1 ) ) )
| ( $true
!= ( eq @ X3 @ X0 ) ) ),
inference(rectify,[],[f17]) ).
thf(f17,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
!= ( eq @ X0 @ X3 ) )
| ( $true
= ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) ) )
| ( $true
!= ( eq @ X1 @ X2 ) ) ),
inference(flattening,[],[f16]) ).
thf(f16,plain,
! [X1: frac,X2: frac,X3: frac,X0: frac] :
( ( $true
= ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) ) )
| ( $true
!= ( eq @ X0 @ X3 ) )
| ( $true
!= ( eq @ X1 @ X2 ) ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f14,plain,
! [X1: frac,X2: frac,X3: frac,X0: frac] :
( ( $true
= ( eq @ X1 @ X2 ) )
=> ( ( $true
= ( eq @ X0 @ X3 ) )
=> ( $true
= ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( eq @ X1 @ X2 )
=> ( ( eq @ X0 @ X3 )
=> ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X2: frac,X0: frac,X1: frac,X3: frac] :
( ( eq @ X0 @ X1 )
=> ( ( eq @ X2 @ X3 )
=> ( eq @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz56) ).
thf(f20,plain,
( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
!= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
!= $true ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
!= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
~ ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
eq @ ( pf @ x @ z ) @ ( pf @ y @ z ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz62b) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM750^1 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.31 % Computer : n012.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 05:30:38 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.32 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.33 % (6728)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.16/0.33 % (6730)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.33 % (6731)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.33 % (6727)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.16/0.33 % (6730)Instruction limit reached!
% 0.16/0.33 % (6730)------------------------------
% 0.16/0.33 % (6730)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (6730)Termination reason: Unknown
% 0.16/0.33 % (6730)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (6731)Instruction limit reached!
% 0.16/0.33 % (6731)------------------------------
% 0.16/0.33 % (6731)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (6730)Memory used [KB]: 895
% 0.16/0.33 % (6730)Time elapsed: 0.002 s
% 0.16/0.33 % (6730)Instructions burned: 2 (million)
% 0.16/0.33 % (6730)------------------------------
% 0.16/0.33 % (6730)------------------------------
% 0.16/0.33 % (6731)Termination reason: Unknown
% 0.16/0.33 % (6731)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (6731)Memory used [KB]: 895
% 0.16/0.33 % (6731)Time elapsed: 0.002 s
% 0.16/0.33 % (6733)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.33 % (6731)Instructions burned: 2 (million)
% 0.16/0.33 % (6731)------------------------------
% 0.16/0.33 % (6731)------------------------------
% 0.16/0.33 % (6732)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.16/0.33 % (6729)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.16/0.33 % (6734)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.16/0.33 % (6727)First to succeed.
% 0.16/0.33 % (6728)Instruction limit reached!
% 0.16/0.33 % (6728)------------------------------
% 0.16/0.33 % (6728)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (6728)Termination reason: Unknown
% 0.16/0.33 % (6728)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (6728)Memory used [KB]: 5500
% 0.16/0.33 % (6728)Time elapsed: 0.004 s
% 0.16/0.33 % (6728)Instructions burned: 5 (million)
% 0.16/0.33 % (6728)------------------------------
% 0.16/0.33 % (6728)------------------------------
% 0.16/0.33 % (6732)Also succeeded, but the first one will report.
% 0.16/0.33 % (6734)Instruction limit reached!
% 0.16/0.33 % (6734)------------------------------
% 0.16/0.33 % (6734)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (6734)Termination reason: Unknown
% 0.16/0.33 % (6734)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (6734)Memory used [KB]: 5500
% 0.16/0.33 % (6734)Time elapsed: 0.004 s
% 0.16/0.33 % (6734)Instructions burned: 3 (million)
% 0.16/0.33 % (6734)------------------------------
% 0.16/0.33 % (6734)------------------------------
% 0.16/0.33 % (6729)Also succeeded, but the first one will report.
% 0.16/0.33 % (6727)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for theBenchmark
% 0.16/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.33 % (6727)------------------------------
% 0.16/0.33 % (6727)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (6727)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (6727)Memory used [KB]: 5500
% 0.16/0.33 % (6727)Time elapsed: 0.004 s
% 0.16/0.33 % (6727)Instructions burned: 2 (million)
% 0.16/0.33 % (6727)------------------------------
% 0.16/0.33 % (6727)------------------------------
% 0.16/0.33 % (6726)Success in time 0.002 s
% 0.16/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------