TSTP Solution File: NUM738^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM738^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 : n005.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:19 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 17
% Syntax : Number of formulae : 59 ( 23 unt; 10 typ; 0 def)
% Number of atoms : 227 ( 67 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 251 ( 35 ~; 29 |; 0 &; 172 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 0 ^ 58 !; 0 ?; 59 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% 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,
u: frac ).
thf(func_def_5,type,
lessf: frac > frac > $o ).
thf(func_def_7,type,
eq: frac > frac > $o ).
thf(func_def_8,type,
moref: frac > frac > $o ).
thf(func_def_9,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(f56,plain,
$false,
inference(trivial_inequality_removal,[],[f53]) ).
thf(f53,plain,
$true != $true,
inference(superposition,[],[f34,f51]) ).
thf(f51,plain,
( ( lessf @ z @ u )
= $true ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f50,plain,
( ( ( lessf @ z @ u )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f32,f48]) ).
thf(f48,plain,
( ( moref @ u @ z )
= $true ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f47,plain,
( ( $true != $true )
| ( ( moref @ u @ z )
= $true ) ),
inference(superposition,[],[f46,f37]) ).
thf(f37,plain,
( ( eq @ x @ z )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( eq @ x @ z )
= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
eq @ x @ z,
inference(rectify,[],[f2]) ).
thf(f2,axiom,
eq @ x @ z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e) ).
thf(f46,plain,
! [X0: frac] :
( ( ( eq @ x @ X0 )
!= $true )
| ( $true
= ( moref @ u @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
! [X0: frac] :
( ( $true
= ( moref @ u @ X0 ) )
| ( $true != $true )
| ( ( eq @ x @ X0 )
!= $true ) ),
inference(superposition,[],[f44,f35]) ).
thf(f35,plain,
( ( eq @ y @ u )
= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ( eq @ y @ u )
= $true ),
inference(fool_elimination,[],[f20]) ).
thf(f20,plain,
eq @ y @ u,
inference(rectify,[],[f3]) ).
thf(f3,axiom,
eq @ y @ u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f) ).
thf(f44,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ y @ X0 )
!= $true )
| ( ( eq @ x @ X1 )
!= $true )
| ( ( moref @ X0 @ X1 )
= $true ) ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f41,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
= $true )
| ( $true != $true )
| ( ( eq @ y @ X0 )
!= $true )
| ( ( eq @ x @ X1 )
!= $true ) ),
inference(superposition,[],[f36,f40]) ).
thf(f40,plain,
( ( moref @ y @ x )
= $true ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( ( moref @ y @ x )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f38,f33]) ).
thf(f33,plain,
( ( lessf @ x @ y )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( ( lessf @ x @ y )
= $true ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
lessf @ x @ y,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
lessf @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(f38,plain,
! [X0: frac,X1: frac] :
( ( ( lessf @ X1 @ X0 )
!= $true )
| ( ( moref @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f31,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
= $true )
| ( ( lessf @ X1 @ X0 )
!= $true ) ),
inference(rectify,[],[f27]) ).
thf(f27,plain,
! [X1: frac,X0: frac] :
( ( ( moref @ X1 @ X0 )
= $true )
| ( ( lessf @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f13,plain,
! [X1: frac,X0: frac] :
( ( ( lessf @ X0 @ X1 )
= $true )
=> ( ( moref @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
! [X0: frac,X1: frac] :
( ( lessf @ X0 @ X1 )
=> ( moref @ X1 @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
! [X0: frac,X1: frac] :
( ( lessf @ X0 @ X1 )
=> ( moref @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz43) ).
thf(f36,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( eq @ X0 @ X3 )
!= $true )
| ( ( moref @ X3 @ X2 )
= $true )
| ( ( eq @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f30,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( eq @ X1 @ X2 )
!= $true )
| ( ( moref @ X3 @ X2 )
= $true )
| ( ( moref @ X0 @ X1 )
!= $true )
| ( ( eq @ X0 @ X3 )
!= $true ) ),
inference(rectify,[],[f26]) ).
thf(f26,plain,
! [X2: frac,X0: frac,X1: frac,X3: frac] :
( ( ( eq @ X0 @ X1 )
!= $true )
| ( $true
= ( moref @ X3 @ X1 ) )
| ( ( moref @ X2 @ X0 )
!= $true )
| ( ( eq @ X2 @ X3 )
!= $true ) ),
inference(flattening,[],[f25]) ).
thf(f25,plain,
! [X0: frac,X2: frac,X3: frac,X1: frac] :
( ( $true
= ( moref @ X3 @ X1 ) )
| ( ( eq @ X0 @ X1 )
!= $true )
| ( ( eq @ X2 @ X3 )
!= $true )
| ( ( moref @ X2 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f19,plain,
! [X0: frac,X2: frac,X3: frac,X1: frac] :
( ( ( moref @ X2 @ X0 )
= $true )
=> ( ( ( eq @ X2 @ X3 )
= $true )
=> ( ( ( eq @ X0 @ X1 )
= $true )
=> ( $true
= ( moref @ X3 @ X1 ) ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f18,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X2 @ X0 )
=> ( ( eq @ X2 @ X3 )
=> ( ( eq @ X0 @ X1 )
=> ( moref @ X3 @ X1 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X1: frac,X3: frac,X0: frac,X2: frac] :
( ( moref @ X0 @ X1 )
=> ( ( eq @ X0 @ X2 )
=> ( ( eq @ X1 @ X3 )
=> ( moref @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz44) ).
thf(f32,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( lessf @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f29,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( lessf @ X1 @ X0 )
= $true ) ),
inference(rectify,[],[f28]) ).
thf(f28,plain,
! [X1: frac,X0: frac] :
( ( ( moref @ X1 @ X0 )
!= $true )
| ( ( lessf @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f15,plain,
! [X1: frac,X0: frac] :
( ( ( moref @ X1 @ X0 )
= $true )
=> ( ( lessf @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f14]) ).
thf(f14,plain,
! [X0: frac,X1: frac] :
( ( moref @ X1 @ X0 )
=> ( lessf @ X0 @ X1 ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X1: frac,X0: frac] :
( ( moref @ X0 @ X1 )
=> ( lessf @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz42) ).
thf(f34,plain,
( ( lessf @ z @ u )
!= $true ),
inference(cnf_transformation,[],[f24]) ).
thf(f24,plain,
( ( lessf @ z @ u )
!= $true ),
inference(flattening,[],[f23]) ).
thf(f23,plain,
( ( lessf @ z @ u )
!= $true ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
~ ( lessf @ z @ u ),
inference(rectify,[],[f8]) ).
thf(f8,negated_conjecture,
~ ( lessf @ z @ u ),
inference(negated_conjecture,[],[f7]) ).
thf(f7,conjecture,
lessf @ z @ u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz45) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM738^1 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.15 % 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.16/0.36 % Computer : n005.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 20 06:11:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.36 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.38 % (16197)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 (2999ds/4Mi)
% 0.16/0.38 % (16198)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 (2999ds/27Mi)
% 0.16/0.38 % (16199)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.38 % (16200)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 (2999ds/2Mi)
% 0.16/0.38 % (16196)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.16/0.38 % (16201)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 (2999ds/275Mi)
% 0.16/0.38 % (16199)Instruction limit reached!
% 0.16/0.38 % (16199)------------------------------
% 0.16/0.38 % (16199)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (16199)Termination reason: Unknown
% 0.16/0.38 % (16199)Termination phase: Saturation
% 0.16/0.38 % (16200)Instruction limit reached!
% 0.16/0.38 % (16200)------------------------------
% 0.16/0.38 % (16200)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (16200)Termination reason: Unknown
% 0.16/0.38 % (16200)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (16200)Memory used [KB]: 1023
% 0.16/0.38 % (16200)Time elapsed: 0.003 s
% 0.16/0.38 % (16200)Instructions burned: 3 (million)
% 0.16/0.38 % (16200)------------------------------
% 0.16/0.38 % (16200)------------------------------
% 0.16/0.38
% 0.16/0.38 % (16199)Memory used [KB]: 5500
% 0.16/0.38 % (16199)Time elapsed: 0.004 s
% 0.16/0.38 % (16199)Instructions burned: 2 (million)
% 0.16/0.38 % (16199)------------------------------
% 0.16/0.38 % (16199)------------------------------
% 0.16/0.38 % (16202)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.38 % (16201)Refutation not found, incomplete strategy
% 0.16/0.38 % (16201)------------------------------
% 0.16/0.38 % (16201)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (16201)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.38
% 0.16/0.38
% 0.16/0.38 % (16201)Memory used [KB]: 5500
% 0.16/0.38 % (16201)Time elapsed: 0.003 s
% 0.16/0.38 % (16201)Instructions burned: 2 (million)
% 0.16/0.38 % (16201)------------------------------
% 0.16/0.38 % (16201)------------------------------
% 0.16/0.38 % (16197)Instruction limit reached!
% 0.16/0.38 % (16197)------------------------------
% 0.16/0.38 % (16197)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (16197)Termination reason: Unknown
% 0.16/0.38 % (16197)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (16197)Memory used [KB]: 5500
% 0.16/0.38 % (16197)Time elapsed: 0.005 s
% 0.16/0.38 % (16197)Instructions burned: 4 (million)
% 0.16/0.38 % (16197)------------------------------
% 0.16/0.38 % (16197)------------------------------
% 0.16/0.39 % (16198)First to succeed.
% 0.16/0.39 % (16203)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.16/0.39 % (16198)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for theBenchmark
% 0.16/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.39 % (16198)------------------------------
% 0.16/0.39 % (16198)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (16198)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (16198)Memory used [KB]: 5500
% 0.16/0.39 % (16198)Time elapsed: 0.007 s
% 0.16/0.39 % (16198)Instructions burned: 5 (million)
% 0.16/0.39 % (16198)------------------------------
% 0.16/0.39 % (16198)------------------------------
% 0.16/0.39 % (16195)Success in time 0.007 s
% 0.16/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------