TSTP Solution File: NUM739^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM739^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 : n027.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:20 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 69 ( 14 unt; 8 typ; 0 def)
% Number of atoms : 348 ( 105 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 414 ( 81 ~; 49 |; 1 &; 256 @)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 0 ^ 73 !; 0 ?; 73 :)
% 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,
moref: frac > frac > $o ).
thf(func_def_6,type,
eq: frac > frac > $o ).
thf(f164,plain,
$false,
inference(subsumption_resolution,[],[f163,f42]) ).
thf(f42,plain,
( ( eq @ x @ z )
= $true ),
inference(cnf_transformation,[],[f24]) ).
thf(f24,plain,
( ( eq @ x @ z )
= $true ),
inference(fool_elimination,[],[f23]) ).
thf(f23,plain,
eq @ x @ z,
inference(rectify,[],[f2]) ).
thf(f2,axiom,
eq @ x @ z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e) ).
thf(f163,plain,
( ( eq @ x @ z )
!= $true ),
inference(subsumption_resolution,[],[f162,f84]) ).
thf(f84,plain,
( ( moref @ x @ y )
!= $true ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f80,plain,
( ( ( moref @ x @ y )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f73,f42]) ).
thf(f73,plain,
! [X0: frac] :
( ( ( eq @ X0 @ z )
!= $true )
| ( ( moref @ X0 @ y )
!= $true ) ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
! [X0: frac] :
( ( ( eq @ X0 @ z )
!= $true )
| ( ( moref @ X0 @ y )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f55,f44]) ).
thf(f44,plain,
( ( eq @ y @ u )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
( ( eq @ y @ u )
= $true ),
inference(fool_elimination,[],[f15]) ).
thf(f15,plain,
eq @ y @ u,
inference(rectify,[],[f3]) ).
thf(f3,axiom,
eq @ y @ u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f) ).
thf(f55,plain,
! [X0: frac,X1: frac] :
( ( $true
!= ( eq @ X1 @ u ) )
| ( $true
!= ( moref @ X0 @ X1 ) )
| ( ( eq @ X0 @ z )
!= $true ) ),
inference(trivial_inequality_removal,[],[f54]) ).
thf(f54,plain,
! [X0: frac,X1: frac] :
( ( $true != $true )
| ( ( eq @ X0 @ z )
!= $true )
| ( $true
!= ( moref @ X0 @ X1 ) )
| ( $true
!= ( eq @ X1 @ u ) ) ),
inference(superposition,[],[f46,f40]) ).
thf(f40,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( moref @ X3 @ X1 ) )
| ( ( eq @ X0 @ X3 )
!= $true )
| ( $true
!= ( moref @ X0 @ X2 ) )
| ( ( eq @ X2 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f38]) ).
thf(f38,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( $true
!= ( moref @ X0 @ X2 ) )
| ( $true
= ( moref @ X3 @ X1 ) )
| ( ( eq @ X0 @ X3 )
!= $true )
| ( ( eq @ X2 @ X1 )
!= $true ) ),
inference(rectify,[],[f33]) ).
thf(f33,plain,
! [X3: frac,X2: frac,X0: frac,X1: frac] :
( ( $true
!= ( moref @ X3 @ X0 ) )
| ( ( moref @ X1 @ X2 )
= $true )
| ( $true
!= ( eq @ X3 @ X1 ) )
| ( $true
!= ( eq @ X0 @ X2 ) ) ),
inference(flattening,[],[f32]) ).
thf(f32,plain,
! [X3: frac,X0: frac,X2: frac,X1: frac] :
( ( ( moref @ X1 @ X2 )
= $true )
| ( $true
!= ( eq @ X0 @ X2 ) )
| ( $true
!= ( eq @ X3 @ X1 ) )
| ( $true
!= ( moref @ X3 @ X0 ) ) ),
inference(ennf_transformation,[],[f22]) ).
thf(f22,plain,
! [X3: frac,X0: frac,X2: frac,X1: frac] :
( ( $true
= ( moref @ X3 @ X0 ) )
=> ( ( $true
= ( eq @ X3 @ X1 ) )
=> ( ( $true
= ( eq @ X0 @ X2 ) )
=> ( ( moref @ X1 @ X2 )
= $true ) ) ) ),
inference(fool_elimination,[],[f21]) ).
thf(f21,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X3 @ X0 )
=> ( ( eq @ X3 @ X1 )
=> ( ( eq @ X0 @ X2 )
=> ( moref @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,axiom,
! [X2: frac,X3: frac,X4: frac,X1: frac] :
( ( moref @ X1 @ X2 )
=> ( ( eq @ X1 @ X3 )
=> ( ( eq @ X2 @ X4 )
=> ( moref @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz44) ).
thf(f46,plain,
( ( moref @ z @ u )
!= $true ),
inference(cnf_transformation,[],[f30]) ).
thf(f30,plain,
( ( ( moref @ z @ u )
!= $true )
& ( ( eq @ z @ u )
!= $true ) ),
inference(ennf_transformation,[],[f27]) ).
thf(f27,plain,
~ ( ( ( moref @ z @ u )
!= $true )
=> ( ( eq @ z @ u )
= $true ) ),
inference(flattening,[],[f20]) ).
thf(f20,plain,
~ ( ( ( moref @ z @ u )
!= $true )
=> ( ( eq @ z @ u )
= $true ) ),
inference(fool_elimination,[],[f19]) ).
thf(f19,plain,
~ ( ~ ( moref @ z @ u )
=> ( eq @ z @ u ) ),
inference(rectify,[],[f9]) ).
thf(f9,negated_conjecture,
~ ( ~ ( moref @ z @ u )
=> ( eq @ z @ u ) ),
inference(negated_conjecture,[],[f8]) ).
thf(f8,conjecture,
( ~ ( moref @ z @ u )
=> ( eq @ z @ u ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz46) ).
thf(f162,plain,
( ( ( moref @ x @ y )
= $true )
| ( ( eq @ x @ z )
!= $true ) ),
inference(trivial_inequality_removal,[],[f157]) ).
thf(f157,plain,
( ( ( moref @ x @ y )
= $true )
| ( $true != $true )
| ( ( eq @ x @ z )
!= $true ) ),
inference(superposition,[],[f123,f47]) ).
thf(f47,plain,
( ( ( eq @ x @ y )
= $true )
| ( ( moref @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f37,plain,
( ( ( moref @ x @ y )
= $true )
| ( ( eq @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f29]) ).
thf(f29,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(flattening,[],[f26]) ).
thf(f26,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(fool_elimination,[],[f25]) ).
thf(f25,plain,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(f123,plain,
! [X0: frac] :
( ( $true
!= ( eq @ X0 @ y ) )
| ( ( eq @ X0 @ z )
!= $true ) ),
inference(trivial_inequality_removal,[],[f119]) ).
thf(f119,plain,
! [X0: frac] :
( ( ( eq @ X0 @ z )
!= $true )
| ( $true
!= ( eq @ X0 @ y ) )
| ( $true != $true ) ),
inference(superposition,[],[f88,f43]) ).
thf(f43,plain,
! [X0: frac,X1: frac] :
( ( $true
= ( eq @ X1 @ X0 ) )
| ( $true
!= ( eq @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f31,plain,
! [X0: frac,X1: frac] :
( ( $true
= ( eq @ X1 @ X0 ) )
| ( $true
!= ( eq @ X0 @ X1 ) ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f14,plain,
! [X0: frac,X1: frac] :
( ( $true
= ( eq @ X0 @ X1 ) )
=> ( $true
= ( eq @ X1 @ X0 ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
! [X0: frac,X1: frac] :
( ( eq @ X0 @ X1 )
=> ( eq @ X1 @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
! [X1: frac,X2: frac] :
( ( eq @ X1 @ X2 )
=> ( eq @ X2 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz38) ).
thf(f88,plain,
! [X0: frac] :
( ( $true
!= ( eq @ y @ X0 ) )
| ( ( eq @ X0 @ z )
!= $true ) ),
inference(trivial_inequality_removal,[],[f87]) ).
thf(f87,plain,
! [X0: frac] :
( ( $true != $true )
| ( ( eq @ X0 @ z )
!= $true )
| ( $true
!= ( eq @ y @ X0 ) ) ),
inference(superposition,[],[f78,f48]) ).
thf(f48,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( eq @ X1 @ X2 )
= $true )
| ( $true
!= ( eq @ X0 @ X2 ) )
| ( $true
!= ( eq @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f39,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( ( eq @ X1 @ X2 )
= $true )
| ( $true
!= ( eq @ X1 @ X0 ) )
| ( $true
!= ( eq @ X0 @ X2 ) ) ),
inference(rectify,[],[f35]) ).
thf(f35,plain,
! [X1: frac,X2: frac,X0: frac] :
( ( $true
= ( eq @ X2 @ X0 ) )
| ( ( eq @ X2 @ X1 )
!= $true )
| ( $true
!= ( eq @ X1 @ X0 ) ) ),
inference(flattening,[],[f34]) ).
thf(f34,plain,
! [X0: frac,X2: frac,X1: frac] :
( ( $true
= ( eq @ X2 @ X0 ) )
| ( $true
!= ( eq @ X1 @ X0 ) )
| ( ( eq @ X2 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f18]) ).
thf(f18,plain,
! [X0: frac,X2: frac,X1: frac] :
( ( ( eq @ X2 @ X1 )
= $true )
=> ( ( $true
= ( eq @ X1 @ X0 ) )
=> ( $true
= ( eq @ X2 @ X0 ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f17,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( eq @ X2 @ X1 )
=> ( ( eq @ X1 @ X0 )
=> ( eq @ X2 @ X0 ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X3: frac,X2: frac,X1: frac] :
( ( eq @ X1 @ X2 )
=> ( ( eq @ X2 @ X3 )
=> ( eq @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz39) ).
thf(f78,plain,
( $true
!= ( eq @ y @ z ) ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ( $true != $true )
| ( $true
!= ( eq @ y @ z ) ) ),
inference(superposition,[],[f62,f44]) ).
thf(f62,plain,
! [X0: frac] :
( ( $true
!= ( eq @ X0 @ u ) )
| ( ( eq @ X0 @ z )
!= $true ) ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
! [X0: frac] :
( ( $true != $true )
| ( ( eq @ X0 @ z )
!= $true )
| ( $true
!= ( eq @ X0 @ u ) ) ),
inference(superposition,[],[f53,f43]) ).
thf(f53,plain,
! [X0: frac] :
( ( $true
!= ( eq @ z @ X0 ) )
| ( $true
!= ( eq @ X0 @ u ) ) ),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f51,plain,
! [X0: frac] :
( ( $true != $true )
| ( $true
!= ( eq @ X0 @ u ) )
| ( $true
!= ( eq @ z @ X0 ) ) ),
inference(superposition,[],[f45,f48]) ).
thf(f45,plain,
( ( eq @ z @ u )
!= $true ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM739^1 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.14 % 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.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 06:14:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35 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.14/0.37 % (24310)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.14/0.37 % (24311)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.14/0.37 % (24313)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.14/0.37 % (24314)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.14/0.37 % (24313)Instruction limit reached!
% 0.14/0.37 % (24313)------------------------------
% 0.14/0.37 % (24313)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (24313)Termination reason: Unknown
% 0.14/0.37 % (24313)Termination phase: Property scanning
% 0.14/0.37
% 0.14/0.37 % (24313)Memory used [KB]: 895
% 0.14/0.37 % (24313)Time elapsed: 0.003 s
% 0.14/0.37 % (24313)Instructions burned: 2 (million)
% 0.14/0.37 % (24313)------------------------------
% 0.14/0.37 % (24313)------------------------------
% 0.14/0.37 % (24310)Instruction limit reached!
% 0.14/0.37 % (24310)------------------------------
% 0.14/0.37 % (24310)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (24310)Termination reason: Unknown
% 0.14/0.37 % (24310)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (24310)Memory used [KB]: 5500
% 0.14/0.37 % (24310)Time elapsed: 0.004 s
% 0.14/0.37 % (24310)Instructions burned: 4 (million)
% 0.14/0.37 % (24310)------------------------------
% 0.14/0.37 % (24310)------------------------------
% 0.14/0.38 % (24312)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (24312)Instruction limit reached!
% 0.14/0.38 % (24312)------------------------------
% 0.14/0.38 % (24312)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (24312)Termination reason: Unknown
% 0.14/0.38 % (24312)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (24312)Memory used [KB]: 5373
% 0.14/0.38 % (24312)Time elapsed: 0.003 s
% 0.14/0.38 % (24312)Instructions burned: 2 (million)
% 0.14/0.38 % (24312)------------------------------
% 0.14/0.38 % (24312)------------------------------
% 0.14/0.38 % (24315)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39 % (24309)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.14/0.39 % (24316)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.14/0.39 % (24314)First to succeed.
% 0.14/0.39 % (24316)Instruction limit reached!
% 0.14/0.39 % (24316)------------------------------
% 0.14/0.39 % (24316)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (24316)Termination reason: Unknown
% 0.14/0.39 % (24316)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (24316)Memory used [KB]: 5500
% 0.14/0.39 % (24316)Time elapsed: 0.005 s
% 0.14/0.39 % (24316)Instructions burned: 3 (million)
% 0.14/0.39 % (24316)------------------------------
% 0.14/0.39 % (24316)------------------------------
% 0.14/0.39 % (24317)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.39 % (24311)Also succeeded, but the first one will report.
% 0.14/0.39 % (24318)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.14/0.39 % (24314)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (24314)------------------------------
% 0.14/0.39 % (24314)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (24314)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (24314)Memory used [KB]: 5500
% 0.14/0.39 % (24314)Time elapsed: 0.018 s
% 0.14/0.39 % (24314)Instructions burned: 22 (million)
% 0.14/0.39 % (24314)------------------------------
% 0.14/0.39 % (24314)------------------------------
% 0.14/0.39 % (24308)Success in time 0.02 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------