TSTP Solution File: SYO007^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO007^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 : n020.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 09:02:11 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 15 unt; 2 typ; 0 def)
% Number of atoms : 71 ( 21 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 77 ( 11 ~; 0 |; 4 &; 43 @)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 4 usr; 5 con; 0-2 aty)
% ( 5 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 30 ( 16 ^ 10 !; 4 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
leibeq: $o > $o > $o ).
thf(func_def_13,type,
sK3: $o > $o ).
thf(f20,plain,
$false,
inference(trivial_inequality_removal,[],[f19]) ).
thf(f19,plain,
$false = $true,
inference(beta_eta_normalization,[],[f18]) ).
thf(f18,plain,
( $false
= ( ^ [Y0: $o > $o] : $true
@ sK3 ) ),
inference(sigma_clausification,[],[f17]) ).
thf(f17,plain,
( ( !! @ ( $o > $o )
@ ^ [Y0: $o > $o] : $true )
!= $true ),
inference(boolean_simplification,[],[f16]) ).
thf(f16,plain,
( ( !! @ ( $o > $o )
@ ^ [Y0: $o > $o] :
( ( Y0 @ sK0 )
=> ( Y0 @ sK0 ) ) )
!= $true ),
inference(beta_eta_normalization,[],[f15]) ).
thf(f15,plain,
( ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ sK0
@ sK0 )
!= $true ),
inference(definition_unfolding,[],[f13,f12,f14]) ).
thf(f14,plain,
sK1 = sK0,
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( sK1 = sK0 )
& ( ( leibeq @ sK0 @ sK1 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: $o,X1: $o] :
( ( X0 = X1 )
& ( ( leibeq @ X0 @ X1 )
!= $true ) )
=> ( ( sK1 = sK0 )
& ( ( leibeq @ sK0 @ sK1 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: $o,X1: $o] :
( ( X0 = X1 )
& ( ( leibeq @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
~ ! [X0: $o,X1: $o] :
( ( X0 = X1 )
=> ( ( leibeq @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ! [X0: $o,X1: $o] :
( ( X0
<=> X1 )
=> ( leibeq @ X0 @ X1 ) ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ! [X3: $o,X4: $o] :
( ( X3
<=> X4 )
=> ( leibeq @ X3 @ X4 ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
! [X3: $o,X4: $o] :
( ( X3
<=> X4 )
=> ( leibeq @ X3 @ X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f12,plain,
( leibeq
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( leibeq
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
( ( ^ [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq1) ).
thf(f13,plain,
( ( leibeq @ sK0 @ sK1 )
!= $true ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO007^1 : TPTP v8.2.0. Released v3.7.0.
% 0.03/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.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 09:53:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_EQU_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.36 % (6105)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.36 % (6105)Instruction limit reached!
% 0.14/0.36 % (6105)------------------------------
% 0.14/0.36 % (6105)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (6105)Termination reason: Unknown
% 0.14/0.36 % (6105)Termination phase: Saturation
% 0.14/0.36 % (6101)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.36
% 0.14/0.36 % (6105)Memory used [KB]: 5500
% 0.14/0.36 % (6105)Time elapsed: 0.003 s
% 0.14/0.36 % (6105)Instructions burned: 2 (million)
% 0.14/0.36 % (6105)------------------------------
% 0.14/0.36 % (6105)------------------------------
% 0.14/0.36 % (6103)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.36 % (6102)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.36 % (6104)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.36 % (6106)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 % (6107)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.37 % (6101)First to succeed.
% 0.14/0.37 % (6106)Refutation not found, incomplete strategy
% 0.14/0.37 % (6106)------------------------------
% 0.14/0.37 % (6106)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (6106)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (6106)Memory used [KB]: 5373
% 0.14/0.37 % (6106)Time elapsed: 0.003 s
% 0.14/0.37 % (6106)Instructions burned: 1 (million)
% 0.14/0.37 % (6106)------------------------------
% 0.14/0.37 % (6106)------------------------------
% 0.14/0.37 % (6102)Also succeeded, but the first one will report.
% 0.14/0.37 % (6104)Also succeeded, but the first one will report.
% 0.14/0.37 % (6101)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (6101)------------------------------
% 0.14/0.37 % (6101)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (6101)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (6101)Memory used [KB]: 5373
% 0.14/0.37 % (6101)Time elapsed: 0.004 s
% 0.14/0.37 % (6101)Instructions burned: 1 (million)
% 0.14/0.37 % (6101)------------------------------
% 0.14/0.37 % (6101)------------------------------
% 0.14/0.37 % (6098)Success in time 0.004 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------