TSTP Solution File: NUM742^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM742^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 : n032.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:23 EDT 2024
% Result : Theorem 0.12s 0.35s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 71 ( 17 unt; 8 typ; 0 def)
% Number of atoms : 320 ( 88 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 366 ( 67 ~; 57 |; 0 &; 218 @)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 72 ( 0 ^ 71 !; 0 ?; 72 :)
% ( 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,
lessf: frac > frac > $o ).
thf(func_def_5,type,
eq: frac > frac > $o ).
thf(func_def_7,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(f121,plain,
$false,
inference(avatar_sat_refutation,[],[f56,f69,f117]) ).
thf(f117,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f116]) ).
thf(f116,plain,
( $false
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f112]) ).
thf(f112,plain,
( ( $true != $true )
| ~ spl0_1 ),
inference(superposition,[],[f42,f111]) ).
thf(f111,plain,
( ( ( lessf @ x @ z )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f110]) ).
thf(f110,plain,
( ( ( lessf @ x @ z )
= $true )
| ( $true != $true )
| ~ spl0_1 ),
inference(superposition,[],[f101,f40]) ).
thf(f40,plain,
( ( lessf @ y @ z )
= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( ( lessf @ y @ z )
= $true ),
inference(fool_elimination,[],[f17]) ).
thf(f17,plain,
lessf @ y @ z,
inference(rectify,[],[f2]) ).
thf(f2,axiom,
lessf @ y @ z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(f101,plain,
( ! [X0: frac] :
( ( ( lessf @ y @ X0 )
!= $true )
| ( $true
= ( lessf @ x @ X0 ) ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f98]) ).
thf(f98,plain,
( ! [X0: frac] :
( ( $true != $true )
| ( $true
= ( lessf @ x @ X0 ) )
| ( ( lessf @ y @ X0 )
!= $true ) )
| ~ spl0_1 ),
inference(superposition,[],[f77,f45]) ).
thf(f45,plain,
! [X0: frac] :
( ( eq @ X0 @ X0 )
= $true ),
inference(cnf_transformation,[],[f20]) ).
thf(f20,plain,
! [X0: frac] :
( ( eq @ X0 @ X0 )
= $true ),
inference(fool_elimination,[],[f19]) ).
thf(f19,plain,
! [X0: frac] : ( eq @ X0 @ X0 ),
inference(rectify,[],[f7]) ).
thf(f7,axiom,
! [X1: frac] : ( eq @ X1 @ X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).
thf(f77,plain,
( ! [X0: frac,X1: frac] :
( ( $true
!= ( eq @ X0 @ X1 ) )
| ( $true
= ( lessf @ x @ X1 ) )
| ( ( lessf @ y @ X0 )
!= $true ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f75]) ).
thf(f75,plain,
( ! [X0: frac,X1: frac] :
( ( $true
= ( lessf @ x @ X1 ) )
| ( $true
!= ( eq @ X0 @ X1 ) )
| ( $true != $true )
| ( ( lessf @ y @ X0 )
!= $true ) )
| ~ spl0_1 ),
inference(superposition,[],[f39,f73]) ).
thf(f73,plain,
( ( ( eq @ y @ x )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f72]) ).
thf(f72,plain,
( ( $true != $true )
| ( ( eq @ y @ x )
= $true )
| ~ spl0_1 ),
inference(superposition,[],[f41,f51]) ).
thf(f51,plain,
( ( ( eq @ x @ y )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f49,plain,
( spl0_1
<=> ( ( eq @ x @ y )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f41,plain,
! [X0: frac,X1: frac] :
( ( $true
!= ( eq @ X0 @ X1 ) )
| ( $true
= ( eq @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f34]) ).
thf(f34,plain,
! [X0: frac,X1: frac] :
( ( $true
!= ( eq @ X0 @ X1 ) )
| ( $true
= ( eq @ X1 @ X0 ) ) ),
inference(ennf_transformation,[],[f24]) ).
thf(f24,plain,
! [X0: frac,X1: frac] :
( ( $true
= ( eq @ X0 @ X1 ) )
=> ( $true
= ( eq @ X1 @ X0 ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f23,plain,
! [X0: frac,X1: frac] :
( ( eq @ X0 @ X1 )
=> ( eq @ X1 @ X0 ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X1: frac,X2: frac] :
( ( eq @ X1 @ X2 )
=> ( eq @ X2 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz38) ).
thf(f39,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
!= ( eq @ X3 @ X2 ) )
| ( $true
!= ( eq @ X0 @ X1 ) )
| ( $true
= ( lessf @ X2 @ X1 ) )
| ( $true
!= ( lessf @ X3 @ X0 ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f37,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( $true
!= ( eq @ X0 @ X1 ) )
| ( $true
= ( lessf @ X2 @ X1 ) )
| ( $true
!= ( eq @ X3 @ X2 ) )
| ( $true
!= ( lessf @ X3 @ X0 ) ) ),
inference(rectify,[],[f36]) ).
thf(f36,plain,
! [X0: frac,X2: frac,X1: frac,X3: frac] :
( ( $true
!= ( eq @ X0 @ X2 ) )
| ( ( lessf @ X1 @ X2 )
= $true )
| ( $true
!= ( eq @ X3 @ X1 ) )
| ( $true
!= ( lessf @ X3 @ X0 ) ) ),
inference(flattening,[],[f35]) ).
thf(f35,plain,
! [X2: frac,X0: frac,X1: frac,X3: frac] :
( ( ( lessf @ X1 @ X2 )
= $true )
| ( $true
!= ( eq @ X0 @ X2 ) )
| ( $true
!= ( eq @ X3 @ X1 ) )
| ( $true
!= ( lessf @ X3 @ X0 ) ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f12,plain,
! [X2: frac,X0: frac,X1: frac,X3: frac] :
( ( $true
= ( lessf @ X3 @ X0 ) )
=> ( ( $true
= ( eq @ X3 @ X1 ) )
=> ( ( $true
= ( eq @ X0 @ X2 ) )
=> ( ( lessf @ X1 @ X2 )
= $true ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( lessf @ X3 @ X0 )
=> ( ( eq @ X3 @ X1 )
=> ( ( eq @ X0 @ X2 )
=> ( lessf @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X2: frac,X3: frac,X4: frac,X1: frac] :
( ( lessf @ X1 @ X2 )
=> ( ( eq @ X1 @ X3 )
=> ( ( eq @ X2 @ X4 )
=> ( lessf @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz45) ).
thf(f42,plain,
( ( lessf @ x @ z )
!= $true ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
( ( lessf @ x @ z )
!= $true ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
( ( lessf @ x @ z )
!= $true ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
~ ( lessf @ x @ z ),
inference(rectify,[],[f9]) ).
thf(f9,negated_conjecture,
~ ( lessf @ x @ z ),
inference(negated_conjecture,[],[f8]) ).
thf(f8,conjecture,
lessf @ x @ z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz51a) ).
thf(f69,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f68]) ).
thf(f68,plain,
( $false
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f66]) ).
thf(f66,plain,
( ( $true != $true )
| ~ spl0_2 ),
inference(superposition,[],[f42,f65]) ).
thf(f65,plain,
( ( ( lessf @ x @ z )
= $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f64,plain,
( ( $true != $true )
| ( ( lessf @ x @ z )
= $true )
| ~ spl0_2 ),
inference(superposition,[],[f60,f40]) ).
thf(f60,plain,
( ! [X0: frac] :
( ( ( lessf @ y @ X0 )
!= $true )
| ( $true
= ( lessf @ x @ X0 ) ) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f59,plain,
( ! [X0: frac] :
( ( ( lessf @ y @ X0 )
!= $true )
| ( $true != $true )
| ( $true
= ( lessf @ x @ X0 ) ) )
| ~ spl0_2 ),
inference(superposition,[],[f46,f55]) ).
thf(f55,plain,
( ( ( lessf @ x @ y )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f53]) ).
thf(f53,plain,
( spl0_2
<=> ( ( lessf @ x @ y )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f46,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( $true
!= ( lessf @ X2 @ X0 ) )
| ( $true
!= ( lessf @ X0 @ X1 ) )
| ( $true
= ( lessf @ X2 @ X1 ) ) ),
inference(cnf_transformation,[],[f38]) ).
thf(f38,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( $true
= ( lessf @ X2 @ X1 ) )
| ( $true
!= ( lessf @ X2 @ X0 ) )
| ( $true
!= ( lessf @ X0 @ X1 ) ) ),
inference(rectify,[],[f32]) ).
thf(f32,plain,
! [X1: frac,X0: frac,X2: frac] :
( ( $true
= ( lessf @ X2 @ X0 ) )
| ( $true
!= ( lessf @ X2 @ X1 ) )
| ( $true
!= ( lessf @ X1 @ X0 ) ) ),
inference(flattening,[],[f31]) ).
thf(f31,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( $true
= ( lessf @ X2 @ X0 ) )
| ( $true
!= ( lessf @ X1 @ X0 ) )
| ( $true
!= ( lessf @ X2 @ X1 ) ) ),
inference(ennf_transformation,[],[f26]) ).
thf(f26,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( $true
= ( lessf @ X2 @ X1 ) )
=> ( ( $true
= ( lessf @ X1 @ X0 ) )
=> ( $true
= ( lessf @ X2 @ X0 ) ) ) ),
inference(fool_elimination,[],[f25]) ).
thf(f25,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( lessf @ X2 @ X1 )
=> ( ( lessf @ X1 @ X0 )
=> ( lessf @ X2 @ X0 ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
! [X3: frac,X2: frac,X1: frac] :
( ( lessf @ X1 @ X2 )
=> ( ( lessf @ X2 @ X3 )
=> ( lessf @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz50) ).
thf(f56,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f44,f53,f49]) ).
thf(f44,plain,
( ( ( lessf @ x @ y )
= $true )
| ( ( eq @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f30,plain,
( ( ( eq @ x @ y )
= $true )
| ( ( lessf @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f29]) ).
thf(f29,plain,
( ( ( lessf @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(flattening,[],[f22]) ).
thf(f22,plain,
( ( ( lessf @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(fool_elimination,[],[f21]) ).
thf(f21,plain,
( ~ ( lessf @ x @ y )
=> ( eq @ x @ y ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ~ ( lessf @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM742^1 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13 % 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.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 05:25:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TH0_THM_NEQ_NAR problem
% 0.12/0.33 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.12/0.34 % (2913)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.12/0.35 % (2916)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.12/0.35 % (2915)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.12/0.35 % (2911)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.12/0.35 % (2914)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.35 % (2914)Instruction limit reached!
% 0.12/0.35 % (2914)------------------------------
% 0.12/0.35 % (2914)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (2914)Termination reason: Unknown
% 0.12/0.35 % (2914)Termination phase: Preprocessing 2
% 0.12/0.35
% 0.12/0.35 % (2914)Memory used [KB]: 895
% 0.12/0.35 % (2915)Instruction limit reached!
% 0.12/0.35 % (2915)------------------------------
% 0.12/0.35 % (2915)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (2915)Termination reason: Unknown
% 0.12/0.35 % (2915)Termination phase: Property scanning
% 0.12/0.35
% 0.12/0.35 % (2915)Memory used [KB]: 895
% 0.12/0.35 % (2915)Time elapsed: 0.003 s
% 0.12/0.35 % (2915)Instructions burned: 2 (million)
% 0.12/0.35 % (2915)------------------------------
% 0.12/0.35 % (2915)------------------------------
% 0.12/0.35 % (2918)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.12/0.35 % (2914)Time elapsed: 0.002 s
% 0.12/0.35 % (2914)Instructions burned: 2 (million)
% 0.12/0.35 % (2914)------------------------------
% 0.12/0.35 % (2914)------------------------------
% 0.12/0.35 % (2912)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.12/0.35 % (2917)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.35 % (2913)First to succeed.
% 0.12/0.35 % (2918)Instruction limit reached!
% 0.12/0.35 % (2918)------------------------------
% 0.12/0.35 % (2918)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (2918)Termination reason: Unknown
% 0.12/0.35 % (2918)Termination phase: Saturation
% 0.12/0.35
% 0.12/0.35 % (2918)Memory used [KB]: 5500
% 0.12/0.35 % (2918)Time elapsed: 0.004 s
% 0.12/0.35 % (2918)Instructions burned: 4 (million)
% 0.12/0.35 % (2918)------------------------------
% 0.12/0.35 % (2918)------------------------------
% 0.12/0.35 % (2912)Instruction limit reached!
% 0.12/0.35 % (2912)------------------------------
% 0.12/0.35 % (2912)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (2912)Termination reason: Unknown
% 0.12/0.35 % (2912)Termination phase: Saturation
% 0.12/0.35
% 0.12/0.35 % (2912)Memory used [KB]: 5500
% 0.12/0.35 % (2912)Time elapsed: 0.004 s
% 0.12/0.35 % (2912)Instructions burned: 4 (million)
% 0.12/0.35 % (2912)------------------------------
% 0.12/0.35 % (2912)------------------------------
% 0.12/0.35 % (2913)Refutation found. Thanks to Tanya!
% 0.12/0.35 % SZS status Theorem for theBenchmark
% 0.12/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.35 % (2913)------------------------------
% 0.12/0.35 % (2913)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (2913)Termination reason: Refutation
% 0.12/0.35
% 0.12/0.35 % (2913)Memory used [KB]: 5500
% 0.12/0.35 % (2913)Time elapsed: 0.007 s
% 0.12/0.35 % (2913)Instructions burned: 8 (million)
% 0.12/0.35 % (2913)------------------------------
% 0.12/0.35 % (2913)------------------------------
% 0.12/0.35 % (2910)Success in time 0.016 s
% 0.12/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------