TSTP Solution File: NUM757^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM757^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.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:37 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 58 ( 14 unt; 9 typ; 0 def)
% Number of atoms : 293 ( 87 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 449 ( 77 ~; 32 |; 4 &; 302 @)
% ( 0 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 77 ( 0 ^ 77 !; 0 ?; 77 :)
% 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,
lessf: frac > frac > $o ).
thf(func_def_5,type,
pf: frac > frac > frac ).
thf(func_def_7,type,
moref: frac > frac > $o ).
thf(func_def_8,type,
eq: frac > frac > $o ).
thf(f62,plain,
$false,
inference(subsumption_resolution,[],[f61,f56]) ).
thf(f56,plain,
( $true
!= ( moref @ x @ y ) ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f55,plain,
( ( $true != $true )
| ( $true
!= ( moref @ x @ y ) ) ),
inference(superposition,[],[f50,f41]) ).
thf(f41,plain,
( ( lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( ( lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
= $true ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(f50,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( lessf @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
!= $true )
| ( ( moref @ X0 @ X2 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f49,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( lessf @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
!= $true )
| ( $true != $true )
| ( ( moref @ X0 @ X2 )
!= $true ) ),
inference(superposition,[],[f43,f37]) ).
thf(f37,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f35,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(rectify,[],[f34]) ).
thf(f34,plain,
! [X1: frac,X2: frac,X0: frac] :
( ( ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) )
= $true )
| ( ( moref @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f23]) ).
thf(f23,plain,
! [X0: frac,X2: frac,X1: frac] :
( ( ( moref @ X1 @ X2 )
= $true )
=> ( ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( moref @ X1 @ X2 )
=> ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X3: frac,X1: frac,X2: frac] :
( ( moref @ X1 @ X2 )
=> ( moref @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62a) ).
thf(f43,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( lessf @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f31,plain,
! [X0: frac,X1: frac] :
( ( ( ( eq @ X0 @ X1 )
!= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) )
& ( ( ( lessf @ X0 @ X1 )
!= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) )
& ( ( ( eq @ X0 @ X1 )
!= $true )
| ( ( lessf @ X0 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f30]) ).
thf(f30,plain,
! [X1: frac,X0: frac] :
( ( ( ( eq @ X0 @ X1 )
!= $true )
| ( ( lessf @ X0 @ X1 )
!= $true ) )
& ( ( ( lessf @ X0 @ X1 )
!= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) )
& ( ( ( eq @ X0 @ X1 )
!= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f25]) ).
thf(f25,plain,
! [X1: frac,X0: frac] :
~ ( ( ( ( eq @ X0 @ X1 )
= $true )
=> ( ( moref @ X0 @ X1 )
!= $true ) )
=> ( ( ( ( moref @ X0 @ X1 )
= $true )
=> ( ( lessf @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( lessf @ X0 @ X1 )
= $true )
=> ( ( eq @ X0 @ X1 )
!= $true ) ) ) ),
inference(flattening,[],[f13]) ).
thf(f13,plain,
! [X0: frac,X1: frac] :
~ ( ( ( ( eq @ X0 @ X1 )
= $true )
=> ( ( moref @ X0 @ X1 )
!= $true ) )
=> ~ ~ ( ( ( ( moref @ X0 @ X1 )
= $true )
=> ( ( lessf @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( lessf @ X0 @ X1 )
= $true )
=> ( ( eq @ X0 @ X1 )
!= $true ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
! [X0: frac,X1: frac] :
~ ( ( ( eq @ X0 @ X1 )
=> ~ ( moref @ X0 @ X1 ) )
=> ~ ~ ( ( ( moref @ X0 @ X1 )
=> ~ ( lessf @ X0 @ X1 ) )
=> ~ ( ( lessf @ X0 @ X1 )
=> ~ ( eq @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X1: frac,X2: frac] :
~ ( ( ( eq @ X1 @ X2 )
=> ~ ( moref @ X1 @ X2 ) )
=> ~ ~ ( ( ( moref @ X1 @ X2 )
=> ~ ( lessf @ X1 @ X2 ) )
=> ~ ( ( lessf @ X1 @ X2 )
=> ~ ( eq @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41b) ).
thf(f61,plain,
( $true
= ( moref @ x @ y ) ),
inference(subsumption_resolution,[],[f60,f45]) ).
thf(f45,plain,
( ( lessf @ x @ y )
!= $true ),
inference(cnf_transformation,[],[f24]) ).
thf(f24,plain,
( ( lessf @ x @ y )
!= $true ),
inference(flattening,[],[f11]) ).
thf(f11,plain,
( ( lessf @ x @ y )
!= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
~ ( lessf @ x @ y ),
inference(rectify,[],[f8]) ).
thf(f8,negated_conjecture,
~ ( lessf @ x @ y ),
inference(negated_conjecture,[],[f7]) ).
thf(f7,conjecture,
lessf @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz63c) ).
thf(f60,plain,
( ( ( lessf @ x @ y )
= $true )
| ( $true
= ( moref @ x @ y ) ) ),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f59,plain,
( ( ( lessf @ x @ y )
= $true )
| ( $true
= ( moref @ x @ y ) )
| ( $true != $true ) ),
inference(superposition,[],[f58,f39]) ).
thf(f39,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X1 @ X0 )
= $true )
| ( ( lessf @ X1 @ X0 )
= $true )
| ( ( moref @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f36,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X1 @ X0 )
= $true )
| ( ( lessf @ X1 @ X0 )
= $true )
| ( ( moref @ X1 @ X0 )
= $true ) ),
inference(rectify,[],[f33]) ).
thf(f33,plain,
! [X1: frac,X0: frac] :
( ( ( eq @ X0 @ X1 )
= $true )
| ( ( lessf @ X0 @ X1 )
= $true )
| ( ( moref @ X0 @ X1 )
= $true ) ),
inference(flattening,[],[f32]) ).
thf(f32,plain,
! [X0: frac,X1: frac] :
( ( ( lessf @ X0 @ X1 )
= $true )
| ( ( moref @ X0 @ X1 )
= $true )
| ( ( eq @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f27]) ).
thf(f27,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X0 @ X1 )
!= $true )
=> ( ( ( moref @ X0 @ X1 )
!= $true )
=> ( ( lessf @ X0 @ X1 )
= $true ) ) ),
inference(flattening,[],[f19]) ).
thf(f19,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X0 @ X1 )
!= $true )
=> ( ( ( moref @ X0 @ X1 )
!= $true )
=> ( ( lessf @ X0 @ X1 )
= $true ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f18,plain,
! [X0: frac,X1: frac] :
( ~ ( eq @ X0 @ X1 )
=> ( ~ ( moref @ X0 @ X1 )
=> ( lessf @ X0 @ X1 ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
! [X1: frac,X2: frac] :
( ~ ( eq @ X1 @ X2 )
=> ( ~ ( moref @ X1 @ X2 )
=> ( lessf @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41a) ).
thf(f58,plain,
( $true
!= ( eq @ x @ y ) ),
inference(trivial_inequality_removal,[],[f57]) ).
thf(f57,plain,
( ( $true
!= ( eq @ x @ y ) )
| ( $true != $true ) ),
inference(superposition,[],[f53,f41]) ).
thf(f53,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( lessf @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
!= $true )
| ( ( eq @ X0 @ X2 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f52,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( lessf @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
!= $true )
| ( ( eq @ X0 @ X2 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f42,f38]) ).
thf(f38,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) )
= $true )
| ( ( eq @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f29,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( ( eq @ X1 @ X2 )
!= $true )
| ( ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) )
= $true ) ),
inference(ennf_transformation,[],[f21]) ).
thf(f21,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( eq @ X1 @ X2 )
= $true )
=> ( ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f20]) ).
thf(f20,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( eq @ X1 @ X2 )
=> ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X3: frac,X1: frac,X2: frac] :
( ( eq @ X1 @ X2 )
=> ( eq @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62b) ).
thf(f42,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X0 @ X1 )
!= $true )
| ( ( lessf @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM757^1 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 07:04:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.13/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/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 % (31104)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.13/0.37 % (31097)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.13/0.37 % (31099)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.13/0.37 % (31098)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.13/0.37 % (31100)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (31101)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.13/0.37 % (31102)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.13/0.37 % (31103)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (31100)Instruction limit reached!
% 0.13/0.37 % (31100)------------------------------
% 0.13/0.37 % (31100)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (31100)Termination reason: Unknown
% 0.13/0.37 % (31100)Termination phase: Property scanning
% 0.13/0.37 % (31101)Instruction limit reached!
% 0.13/0.37 % (31101)------------------------------
% 0.13/0.37 % (31101)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (31101)Termination reason: Unknown
% 0.13/0.37 % (31101)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (31101)Memory used [KB]: 895
% 0.13/0.37 % (31101)Time elapsed: 0.003 s
% 0.13/0.37 % (31101)Instructions burned: 2 (million)
% 0.13/0.37 % (31101)------------------------------
% 0.13/0.37 % (31101)------------------------------
% 0.13/0.37
% 0.13/0.37 % (31100)Memory used [KB]: 895
% 0.13/0.37 % (31100)Time elapsed: 0.003 s
% 0.13/0.37 % (31100)Instructions burned: 2 (million)
% 0.13/0.37 % (31100)------------------------------
% 0.13/0.37 % (31100)------------------------------
% 0.13/0.37 % (31104)Instruction limit reached!
% 0.13/0.37 % (31104)------------------------------
% 0.13/0.37 % (31104)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (31104)Termination reason: Unknown
% 0.13/0.37 % (31104)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (31104)Memory used [KB]: 5500
% 0.13/0.37 % (31104)Time elapsed: 0.004 s
% 0.13/0.37 % (31104)Instructions burned: 4 (million)
% 0.13/0.37 % (31104)------------------------------
% 0.13/0.37 % (31104)------------------------------
% 0.13/0.37 % (31102)Refutation not found, incomplete strategy
% 0.13/0.37 % (31102)------------------------------
% 0.13/0.37 % (31102)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (31102)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (31102)Memory used [KB]: 5373
% 0.13/0.37 % (31102)Time elapsed: 0.003 s
% 0.13/0.37 % (31102)Instructions burned: 2 (million)
% 0.13/0.37 % (31102)------------------------------
% 0.13/0.37 % (31102)------------------------------
% 0.13/0.37 % (31098)Instruction limit reached!
% 0.13/0.37 % (31098)------------------------------
% 0.13/0.37 % (31098)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (31098)Termination reason: Unknown
% 0.13/0.37 % (31098)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (31098)Memory used [KB]: 5500
% 0.13/0.37 % (31098)Time elapsed: 0.004 s
% 0.13/0.37 % (31098)Instructions burned: 4 (million)
% 0.13/0.37 % (31098)------------------------------
% 0.13/0.37 % (31098)------------------------------
% 0.13/0.37 % (31097)First to succeed.
% 0.13/0.38 % (31097)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38 % (31097)------------------------------
% 0.13/0.38 % (31097)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (31097)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (31097)Memory used [KB]: 5500
% 0.13/0.38 % (31097)Time elapsed: 0.008 s
% 0.13/0.38 % (31097)Instructions burned: 6 (million)
% 0.13/0.38 % (31097)------------------------------
% 0.13/0.38 % (31097)------------------------------
% 0.13/0.38 % (31096)Success in time 0.01 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------