TSTP Solution File: SYO527^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO527^1 : TPTP v8.2.0. Released v5.2.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 : n026.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:06:05 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 17 unt; 8 typ; 0 def)
% Number of atoms : 53 ( 13 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 82 ( 9 ~; 0 |; 0 &; 64 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 4 usr; 4 con; 0-2 aty)
% ( 3 !!; 5 ??; 0 @@+; 0 @@-)
% Number of variables : 28 ( 6 ^ 13 !; 8 ?; 28 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
b: $tType ).
thf(func_def_2,type,
r: a > b > $o ).
thf(func_def_11,type,
sK0: ( a > b ) > a ).
thf(func_def_13,type,
sK2: a > b ).
thf(func_def_14,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f22,plain,
$false,
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
$true != $true,
inference(superposition,[],[f12,f17]) ).
thf(f17,plain,
! [X1: a] :
( ( r @ X1 @ ( sK2 @ X1 ) )
= $true ),
inference(sigma_clausification,[],[f16]) ).
thf(f16,plain,
! [X1: a] :
( ( ?? @ b @ ( r @ X1 ) )
= $true ),
inference(beta_eta_normalization,[],[f15]) ).
thf(f15,plain,
! [X1: a] :
( $true
= ( ^ [Y0: a] : ( ?? @ b @ ( r @ Y0 ) )
@ X1 ) ),
inference(pi_clausification,[],[f14]) ).
thf(f14,plain,
( ( !! @ a
@ ^ [Y0: a] : ( ?? @ b @ ( r @ Y0 ) ) )
= $true ),
inference(beta_eta_normalization,[],[f13]) ).
thf(f13,plain,
( ( !! @ a
@ ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] : ( r @ Y0 @ Y1 ) ) )
= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( ( !! @ a
@ ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] : ( r @ Y0 @ Y1 ) ) )
= $true ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
! [X0: a] :
? [X1: b] : ( r @ X0 @ X1 ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: a] :
? [X1: b] : ( r @ X0 @ X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rtotal) ).
thf(f12,plain,
! [X0: a > b] :
( ( r @ ( sK0 @ X0 ) @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: a > b] :
( ( r @ ( sK0 @ X0 ) @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
! [X0: a > b] :
( ? [X1: a] :
( ( r @ X1 @ ( X0 @ X1 ) )
!= $true )
=> ( ( r @ ( sK0 @ X0 ) @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
! [X0: a > b] :
? [X1: a] :
( ( r @ X1 @ ( X0 @ X1 ) )
!= $true ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
~ ? [X0: a > b] :
! [X1: a] :
( ( r @ X1 @ ( X0 @ X1 ) )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ? [X0: a > b] :
! [X1: a] : ( r @ X1 @ ( X0 @ X1 ) ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ? [X2: a > b] :
! [X0: a] : ( r @ X0 @ ( X2 @ X0 ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
? [X2: a > b] :
! [X0: a] : ( r @ X0 @ ( X2 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',skolem) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO527^1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/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 : n026.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 10:22:52 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 % (8564)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 (3000ds/4Mi)
% 0.13/0.37 % (8564)First to succeed.
% 0.13/0.37 % (8566)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.38 % (8564)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 % (8564)------------------------------
% 0.13/0.38 % (8564)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (8564)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (8564)Memory used [KB]: 5500
% 0.13/0.38 % (8564)Time elapsed: 0.005 s
% 0.13/0.38 % (8564)Instructions burned: 2 (million)
% 0.13/0.38 % (8564)------------------------------
% 0.13/0.38 % (8564)------------------------------
% 0.13/0.38 % (8562)Success in time 0.018 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------