TSTP Solution File: NUM759^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM759^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 : n009.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:39 EDT 2024
% Result : Theorem 0.22s 0.38s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 18 unt; 7 typ; 0 def)
% Number of atoms : 165 ( 49 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 264 ( 25 ~; 20 |; 0 &; 210 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 55 ( 0 ^ 55 !; 0 ?; 55 :)
% 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_5,type,
pf: frac > frac > frac ).
thf(f62,plain,
$false,
inference(subsumption_resolution,[],[f59,f28]) ).
thf(f28,plain,
( ( eq @ x @ y )
!= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( ( eq @ x @ y )
!= $true ),
inference(flattening,[],[f11]) ).
thf(f11,plain,
( ( eq @ x @ y )
!= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
~ ( eq @ x @ y ),
inference(rectify,[],[f6]) ).
thf(f6,negated_conjecture,
~ ( eq @ x @ y ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
eq @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz63e) ).
thf(f59,plain,
( ( eq @ x @ y )
= $true ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
( ( ( eq @ x @ y )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f26,f51]) ).
thf(f51,plain,
( $true
= ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) ) ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f46,plain,
( ( $true
= ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) ) )
| ( $true != $true ) ),
inference(superposition,[],[f32,f40]) ).
thf(f40,plain,
( ( eq @ ( pf @ x @ z ) @ ( pf @ z @ y ) )
= $true ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
( ( $true != $true )
| ( ( eq @ ( pf @ x @ z ) @ ( pf @ z @ y ) )
= $true ) ),
inference(superposition,[],[f31,f24]) ).
thf(f24,plain,
! [X0: frac,X1: frac] :
( ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X0 @ X1 ) )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
! [X0: frac,X1: frac] :
( ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X0 @ X1 ) )
= $true ),
inference(fool_elimination,[],[f14]) ).
thf(f14,plain,
! [X0: frac,X1: frac] : ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X0 @ X1 ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X1: frac,X0: frac] : ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz58) ).
thf(f31,plain,
! [X0: frac] :
( ( ( eq @ X0 @ ( pf @ z @ x ) )
!= $true )
| ( ( eq @ X0 @ ( pf @ z @ y ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
! [X0: frac] :
( ( ( eq @ X0 @ ( pf @ z @ y ) )
= $true )
| ( ( eq @ X0 @ ( pf @ z @ x ) )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f27,f25]) ).
thf(f25,plain,
( ( eq @ ( pf @ z @ x ) @ ( pf @ z @ y ) )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( ( eq @ ( pf @ z @ x ) @ ( pf @ z @ y ) )
= $true ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
eq @ ( pf @ z @ x ) @ ( pf @ z @ y ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
eq @ ( pf @ z @ x ) @ ( pf @ z @ y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e) ).
thf(f27,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( eq @ X2 @ X0 )
!= $true )
| ( ( eq @ X1 @ X0 )
= $true )
| ( ( eq @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( ( eq @ X1 @ X2 )
!= $true )
| ( ( eq @ X2 @ X0 )
!= $true )
| ( ( eq @ X1 @ X0 )
= $true ) ),
inference(rectify,[],[f20]) ).
thf(f20,plain,
! [X0: frac,X2: frac,X1: frac] :
( ( ( eq @ X2 @ X1 )
!= $true )
| ( ( eq @ X1 @ X0 )
!= $true )
| ( ( eq @ X2 @ X0 )
= $true ) ),
inference(flattening,[],[f19]) ).
thf(f19,plain,
! [X0: frac,X2: frac,X1: frac] :
( ( ( eq @ X2 @ X0 )
= $true )
| ( ( eq @ X1 @ X0 )
!= $true )
| ( ( eq @ X2 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f13,plain,
! [X0: frac,X2: frac,X1: frac] :
( ( ( eq @ X2 @ X1 )
= $true )
=> ( ( ( eq @ X1 @ X0 )
= $true )
=> ( ( eq @ X2 @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( eq @ X2 @ X1 )
=> ( ( eq @ X1 @ X0 )
=> ( eq @ X2 @ X0 ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X2: frac,X1: frac,X0: frac] :
( ( eq @ X0 @ X1 )
=> ( ( eq @ X1 @ X2 )
=> ( eq @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz39) ).
thf(f32,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( eq @ X2 @ ( pf @ X0 @ X1 ) )
!= $true )
| ( ( eq @ X2 @ ( pf @ X1 @ X0 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f29,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( eq @ X2 @ ( pf @ X1 @ X0 ) )
= $true )
| ( $true != $true )
| ( ( eq @ X2 @ ( pf @ X0 @ X1 ) )
!= $true ) ),
inference(superposition,[],[f27,f24]) ).
thf(f26,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
!= $true )
| ( ( eq @ X0 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f22,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
!= $true )
| ( ( eq @ X0 @ X2 )
= $true ) ),
inference(rectify,[],[f21]) ).
thf(f21,plain,
! [X2: frac,X1: frac,X0: frac] :
( ( ( eq @ ( pf @ X2 @ X1 ) @ ( pf @ X0 @ X1 ) )
!= $true )
| ( ( eq @ X2 @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
! [X0: frac,X2: frac,X1: frac] :
( ( ( eq @ ( pf @ X2 @ X1 ) @ ( pf @ X0 @ X1 ) )
= $true )
=> ( ( eq @ X2 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( eq @ ( pf @ X2 @ X1 ) @ ( pf @ X0 @ X1 ) )
=> ( eq @ X2 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X1: frac,X2: frac,X0: frac] :
( ( eq @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
=> ( eq @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz63b) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM759^1 : TPTP v8.2.0. Released v3.7.0.
% 0.08/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.15/0.35 % Computer : n009.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 07:22:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.15/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.37 % (20168)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.15/0.37 % (20169)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.15/0.37 % (20174)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.38 % (20169)Instruction limit reached!
% 0.22/0.38 % (20169)------------------------------
% 0.22/0.38 % (20169)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (20169)Termination reason: Unknown
% 0.22/0.38 % (20169)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (20169)Memory used [KB]: 5500
% 0.22/0.38 % (20169)Time elapsed: 0.005 s
% 0.22/0.38 % (20169)Instructions burned: 4 (million)
% 0.22/0.38 % (20169)------------------------------
% 0.22/0.38 % (20169)------------------------------
% 0.22/0.38 % (20175)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.22/0.38 % (20171)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.38 % (20171)Instruction limit reached!
% 0.22/0.38 % (20171)------------------------------
% 0.22/0.38 % (20171)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (20171)Termination reason: Unknown
% 0.22/0.38 % (20171)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (20171)Memory used [KB]: 5500
% 0.22/0.38 % (20171)Time elapsed: 0.003 s
% 0.22/0.38 % (20171)Instructions burned: 2 (million)
% 0.22/0.38 % (20171)------------------------------
% 0.22/0.38 % (20171)------------------------------
% 0.22/0.38 % (20175)Instruction limit reached!
% 0.22/0.38 % (20175)------------------------------
% 0.22/0.38 % (20175)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (20175)Termination reason: Unknown
% 0.22/0.38 % (20175)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (20175)Memory used [KB]: 5500
% 0.22/0.38 % (20175)Time elapsed: 0.004 s
% 0.22/0.38 % (20175)Instructions burned: 4 (million)
% 0.22/0.38 % (20175)------------------------------
% 0.22/0.38 % (20175)------------------------------
% 0.22/0.38 % (20174)First to succeed.
% 0.22/0.38 % (20172)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.22/0.38 % (20172)Instruction limit reached!
% 0.22/0.38 % (20172)------------------------------
% 0.22/0.38 % (20172)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (20172)Termination reason: Unknown
% 0.22/0.38 % (20172)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (20172)Memory used [KB]: 895
% 0.22/0.38 % (20172)Time elapsed: 0.003 s
% 0.22/0.38 % (20172)Instructions burned: 2 (million)
% 0.22/0.38 % (20172)------------------------------
% 0.22/0.38 % (20172)------------------------------
% 0.22/0.38 % (20174)Refutation found. Thanks to Tanya!
% 0.22/0.38 % SZS status Theorem for theBenchmark
% 0.22/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.38 % (20174)------------------------------
% 0.22/0.38 % (20174)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (20174)Termination reason: Refutation
% 0.22/0.38
% 0.22/0.38 % (20174)Memory used [KB]: 5500
% 0.22/0.38 % (20174)Time elapsed: 0.009 s
% 0.22/0.38 % (20174)Instructions burned: 8 (million)
% 0.22/0.38 % (20174)------------------------------
% 0.22/0.38 % (20174)------------------------------
% 0.22/0.38 % (20167)Success in time 0.022 s
% 0.22/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------