TSTP Solution File: SEU833^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU833^5 : TPTP v8.2.0. Released v4.0.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 : n015.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 03:51:52 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 9 unt; 3 typ; 0 def)
% Number of atoms : 34 ( 10 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 28 ( 9 ~; 0 |; 9 &; 9 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 1 usr; 1 con; 0-2 aty)
% Number of variables : 26 ( 20 ^ 4 !; 2 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_7,type,
sK0: a > $o ).
thf(f11,plain,
$false,
inference(trivial_inequality_removal,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] : $false ) ),
inference(boolean_simplification,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( $false
& ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( $false
& ( sK0 @ Y0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o] :
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( $false
& ( X0 @ Y0 ) ) ) )
=> ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( $false
& ( sK0 @ Y0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o] :
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( $false
& ( X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o] :
( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( $false
& ( X0 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o] :
( ( ^ [X1: a] :
( ( X0 @ X1 )
& $false ) )
= ( ^ [X2: a] : $false ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o] :
( ( ^ [X1: a] :
( ( X0 @ X1 )
& $false ) )
= ( ^ [X1: a] : $false ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o] :
( ( ^ [X1: a] :
( ( X0 @ X1 )
& $false ) )
= ( ^ [X1: a] : $false ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM24_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU833^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12 % 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.11/0.33 % Computer : n015.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 16:09:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TH0_THM_EQU_NAR problem
% 0.11/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.11/0.34 % (29653)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 (3000ds/2Mi)
% 0.11/0.34 % (29654)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 (3000ds/275Mi)
% 0.11/0.34 % (29649)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.11/0.34 % (29656)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.11/0.34 % (29650)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.11/0.34 % (29655)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.11/0.34 % (29652)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.11/0.34 % (29651)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 (3000ds/27Mi)
% 0.11/0.35 % (29655)First to succeed.
% 0.11/0.35 % (29650)Also succeeded, but the first one will report.
% 0.11/0.35 % (29656)Also succeeded, but the first one will report.
% 0.11/0.35 % (29655)Refutation found. Thanks to Tanya!
% 0.11/0.35 % SZS status Theorem for theBenchmark
% 0.11/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.35 % (29655)------------------------------
% 0.11/0.35 % (29655)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (29655)Termination reason: Refutation
% 0.11/0.35
% 0.11/0.35 % (29655)Memory used [KB]: 5373
% 0.11/0.35 % (29655)Time elapsed: 0.003 s
% 0.11/0.35 % (29655)Instructions burned: 1 (million)
% 0.11/0.35 % (29655)------------------------------
% 0.11/0.35 % (29655)------------------------------
% 0.11/0.35 % (29648)Success in time 0.005 s
% 0.11/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------