TSTP Solution File: SEV240^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV240^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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 04:12:29 EDT 2024
% Result : Theorem 0.12s 0.34s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 19 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 98 ( 33 equ; 0 cnn)
% Maximal formula atoms : 8 ( 7 avg)
% Number of connectives : 96 ( 20 ~; 8 |; 14 &; 44 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 ^ 15 !; 10 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cA: ( a > $o ) > $o ).
thf(func_def_5,type,
sK0: a > $o ).
thf(func_def_6,type,
sK1: a ).
thf(f19,plain,
$false,
inference(subsumption_resolution,[],[f18,f11]) ).
thf(f11,plain,
( $true
= ( sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( $true
= ( cA @ sK0 ) )
& ( $true
= ( sK0 @ sK1 ) )
& ! [X2: a > $o] :
( ( ( X2 @ sK1 )
!= $true )
| ( ( cA @ X2 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
thf(f7,plain,
( ? [X0: a > $o] :
( ( ( cA @ X0 )
= $true )
& ? [X1: a] :
( ( ( X0 @ X1 )
= $true )
& ! [X2: a > $o] :
( ( ( X2 @ X1 )
!= $true )
| ( ( cA @ X2 )
!= $true ) ) ) )
=> ( ( $true
= ( cA @ sK0 ) )
& ? [X1: a] :
( ( ( sK0 @ X1 )
= $true )
& ! [X2: a > $o] :
( ( ( X2 @ X1 )
!= $true )
| ( ( cA @ X2 )
!= $true ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ? [X1: a] :
( ( ( sK0 @ X1 )
= $true )
& ! [X2: a > $o] :
( ( ( X2 @ X1 )
!= $true )
| ( ( cA @ X2 )
!= $true ) ) )
=> ( ( $true
= ( sK0 @ sK1 ) )
& ! [X2: a > $o] :
( ( ( X2 @ sK1 )
!= $true )
| ( ( cA @ X2 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o] :
( ( ( cA @ X0 )
= $true )
& ? [X1: a] :
( ( ( X0 @ X1 )
= $true )
& ! [X2: a > $o] :
( ( ( X2 @ X1 )
!= $true )
| ( ( cA @ X2 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o] :
( ( ( cA @ X0 )
= $true )
=> ! [X1: a] :
( ( ( X0 @ X1 )
= $true )
=> ? [X2: a > $o] :
( ( ( cA @ X2 )
= $true )
& ( ( X2 @ X1 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o] :
( ( cA @ X0 )
=> ! [X1: a] :
( ( X0 @ X1 )
=> ? [X2: a > $o] :
( ( X2 @ X1 )
& ( cA @ X2 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o] :
( ( cA @ X0 )
=> ! [X1: a] :
( ( X0 @ X1 )
=> ? [X2: a > $o] :
( ( X2 @ X1 )
& ( cA @ X2 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o] :
( ( cA @ X0 )
=> ! [X1: a] :
( ( X0 @ X1 )
=> ? [X2: a > $o] :
( ( X2 @ X1 )
& ( cA @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDOMTHM1_pme) ).
thf(f18,plain,
( $true
!= ( sK0 @ sK1 ) ),
inference(trivial_inequality_removal,[],[f16]) ).
thf(f16,plain,
( ( $true != $true )
| ( $true
!= ( sK0 @ sK1 ) ) ),
inference(superposition,[],[f10,f12]) ).
thf(f12,plain,
( $true
= ( cA @ sK0 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f10,plain,
! [X2: a > $o] :
( ( ( cA @ X2 )
!= $true )
| ( ( X2 @ sK1 )
!= $true ) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEV240^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.11 % 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.12/0.31 % Computer : n007.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Sun May 19 18:46:23 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 This is a TH0_THM_NEQ_NAR problem
% 0.12/0.32 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.12/0.33 % (29464)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.12/0.33 % (29462)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.12/0.33 % (29461)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.12/0.33 % (29466)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.33 % (29465)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.12/0.33 % (29461)First to succeed.
% 0.12/0.33 % (29464)Instruction limit reached!
% 0.12/0.33 % (29464)------------------------------
% 0.12/0.33 % (29464)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.33 % (29464)Termination reason: Unknown
% 0.12/0.33 % (29464)Termination phase: Saturation
% 0.12/0.33
% 0.12/0.33 % (29464)Memory used [KB]: 5500
% 0.12/0.33 % (29464)Time elapsed: 0.003 s
% 0.12/0.33 % (29464)Instructions burned: 2 (million)
% 0.12/0.33 % (29464)------------------------------
% 0.12/0.33 % (29464)------------------------------
% 0.12/0.33 % (29462)Also succeeded, but the first one will report.
% 0.12/0.34 % (29461)Refutation found. Thanks to Tanya!
% 0.12/0.34 % SZS status Theorem for theBenchmark
% 0.12/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.34 % (29461)------------------------------
% 0.12/0.34 % (29461)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.34 % (29461)Termination reason: Refutation
% 0.12/0.34
% 0.12/0.34 % (29461)Memory used [KB]: 5500
% 0.12/0.34 % (29461)Time elapsed: 0.003 s
% 0.12/0.34 % (29461)Instructions burned: 1 (million)
% 0.12/0.34 % (29461)------------------------------
% 0.12/0.34 % (29461)------------------------------
% 0.12/0.34 % (29459)Success in time 0.014 s
% 0.12/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------