TSTP Solution File: SEV131^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV131^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 : n019.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:05 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 23 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 143 ( 58 equ; 0 cnn)
% Maximal formula atoms : 12 ( 8 avg)
% Number of connectives : 187 ( 30 ~; 19 |; 23 &; 97 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 0 ^ 40 !; 14 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a ).
thf(func_def_5,type,
sK1: a > a > $o ).
thf(func_def_6,type,
sK2: a ).
thf(func_def_7,type,
sK3: a > $o ).
thf(f18,plain,
$false,
inference(subsumption_resolution,[],[f17,f11]) ).
thf(f11,plain,
( ( sK3 @ sK0 )
!= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( sK1 @ sK2 @ sK0 )
= $true )
& ! [X4: a,X5: a] :
( ( ( sK3 @ X5 )
!= $true )
| ( $true
!= ( sK1 @ X5 @ X4 ) )
| ( ( sK3 @ X4 )
= $true ) )
& ( ( sK3 @ sK2 )
= $true )
& ( ( sK3 @ sK0 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f9,f8]) ).
thf(f8,plain,
( ? [X0: a,X1: a > a > $o,X2: a] :
( ( ( X1 @ X2 @ X0 )
= $true )
& ? [X3: a > $o] :
( ! [X4: a,X5: a] :
( ( ( X3 @ X5 )
!= $true )
| ( ( X1 @ X5 @ X4 )
!= $true )
| ( ( X3 @ X4 )
= $true ) )
& ( ( X3 @ X2 )
= $true )
& ( ( X3 @ X0 )
!= $true ) ) )
=> ( ( ( sK1 @ sK2 @ sK0 )
= $true )
& ? [X3: a > $o] :
( ! [X5: a,X4: a] :
( ( ( X3 @ X5 )
!= $true )
| ( $true
!= ( sK1 @ X5 @ X4 ) )
| ( ( X3 @ X4 )
= $true ) )
& ( ( X3 @ sK2 )
= $true )
& ( ( X3 @ sK0 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X3: a > $o] :
( ! [X5: a,X4: a] :
( ( ( X3 @ X5 )
!= $true )
| ( $true
!= ( sK1 @ X5 @ X4 ) )
| ( ( X3 @ X4 )
= $true ) )
& ( ( X3 @ sK2 )
= $true )
& ( ( X3 @ sK0 )
!= $true ) )
=> ( ! [X5: a,X4: a] :
( ( ( sK3 @ X5 )
!= $true )
| ( $true
!= ( sK1 @ X5 @ X4 ) )
| ( ( sK3 @ X4 )
= $true ) )
& ( ( sK3 @ sK2 )
= $true )
& ( ( sK3 @ sK0 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: a,X1: a > a > $o,X2: a] :
( ( ( X1 @ X2 @ X0 )
= $true )
& ? [X3: a > $o] :
( ! [X4: a,X5: a] :
( ( ( X3 @ X5 )
!= $true )
| ( ( X1 @ X5 @ X4 )
!= $true )
| ( ( X3 @ X4 )
= $true ) )
& ( ( X3 @ X2 )
= $true )
& ( ( X3 @ X0 )
!= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X2: a,X1: a > a > $o,X0: a] :
( ? [X3: a > $o] :
( ( ( X3 @ X0 )
!= $true )
& ( ( X3 @ X2 )
= $true )
& ! [X4: a,X5: a] :
( ( ( X3 @ X4 )
= $true )
| ( ( X3 @ X5 )
!= $true )
| ( ( X1 @ X5 @ X4 )
!= $true ) ) )
& ( ( X1 @ X2 @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X2: a,X1: a > a > $o,X0: a] :
( ( ( X1 @ X2 @ X0 )
= $true )
=> ! [X3: a > $o] :
( ! [X4: a,X5: a] :
( ( ( ( X3 @ X5 )
= $true )
& ( ( X1 @ X5 @ X4 )
= $true ) )
=> ( ( X3 @ X4 )
= $true ) )
=> ( ( ( X3 @ X2 )
= $true )
=> ( ( X3 @ X0 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a,X1: a > a > $o,X2: a] :
( ( X1 @ X2 @ X0 )
=> ! [X3: a > $o] :
( ! [X4: a,X5: a] :
( ( ( X3 @ X5 )
& ( X1 @ X5 @ X4 ) )
=> ( X3 @ X4 ) )
=> ( ( X3 @ X2 )
=> ( X3 @ X0 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X2: a,X0: a > a > $o,X1: a] :
( ( X0 @ X1 @ X2 )
=> ! [X3: a > $o] :
( ! [X5: a,X4: a] :
( ( ( X3 @ X4 )
& ( X0 @ X4 @ X5 ) )
=> ( X3 @ X5 ) )
=> ( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X2: a,X0: a > a > $o,X1: a] :
( ( X0 @ X1 @ X2 )
=> ! [X3: a > $o] :
( ! [X5: a,X4: a] :
( ( ( X3 @ X4 )
& ( X0 @ X4 @ X5 ) )
=> ( X3 @ X5 ) )
=> ( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM202_pme) ).
thf(f17,plain,
( ( sK3 @ sK0 )
= $true ),
inference(subsumption_resolution,[],[f16,f12]) ).
thf(f12,plain,
( ( sK3 @ sK2 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f16,plain,
( ( ( sK3 @ sK2 )
!= $true )
| ( ( sK3 @ sK0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f15]) ).
thf(f15,plain,
( ( ( sK3 @ sK0 )
= $true )
| ( ( sK3 @ sK2 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f13,f14]) ).
thf(f14,plain,
( ( sK1 @ sK2 @ sK0 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f13,plain,
! [X4: a,X5: a] :
( ( $true
!= ( sK1 @ X5 @ X4 ) )
| ( ( sK3 @ X4 )
= $true )
| ( ( sK3 @ X5 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEV131^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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 : n019.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 : Sun May 19 18:27:22 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.20/0.37 % (455)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.20/0.37 % (453)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.37 % (454)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.20/0.37 % (452)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.20/0.37 % (451)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.20/0.37 % (456)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.37 % (450)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.20/0.37 % (457)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.20/0.37 % (454)Instruction limit reached!
% 0.20/0.37 % (454)------------------------------
% 0.20/0.37 % (454)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (454)Termination reason: Unknown
% 0.20/0.37 % (454)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (454)Memory used [KB]: 895
% 0.20/0.37 % (454)Time elapsed: 0.002 s
% 0.20/0.37 % (454)Instructions burned: 2 (million)
% 0.20/0.37 % (454)------------------------------
% 0.20/0.37 % (454)------------------------------
% 0.20/0.37 % (455)First to succeed.
% 0.20/0.37 % (450)Also succeeded, but the first one will report.
% 0.20/0.37 % (457)Also succeeded, but the first one will report.
% 0.20/0.37 % (455)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37 % (455)------------------------------
% 0.20/0.37 % (455)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (455)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (455)Memory used [KB]: 5500
% 0.20/0.37 % (455)Time elapsed: 0.004 s
% 0.20/0.37 % (455)Instructions burned: 2 (million)
% 0.20/0.37 % (455)------------------------------
% 0.20/0.37 % (455)------------------------------
% 0.20/0.37 % (449)Success in time 0.013 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------