TSTP Solution File: SEU139+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n014.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 : Wed Aug 31 18:32:05 EDT 2022
% Result : Theorem 1.53s 0.56s
% Output : Refutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 94 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 41 ~; 32 |; 21 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 34 ( 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f61,plain,
$false,
inference(avatar_sat_refutation,[],[f51,f54,f60]) ).
fof(f60,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f59]) ).
fof(f59,plain,
( $false
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f58,f31]) ).
fof(f31,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] : ~ proper_subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_r2_xboole_0) ).
fof(f58,plain,
( proper_subset(sK0,sK0)
| ~ spl2_2 ),
inference(superposition,[],[f32,f47]) ).
fof(f47,plain,
( sK1 = sK0
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f45,plain,
( spl2_2
<=> sK1 = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f32,plain,
proper_subset(sK0,sK1),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( subset(sK1,sK0)
& proper_subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f21]) ).
fof(f21,plain,
( ? [X0,X1] :
( subset(X1,X0)
& proper_subset(X0,X1) )
=> ( subset(sK1,sK0)
& proper_subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1] :
( subset(X1,X0)
& proper_subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
~ ! [X1,X0] :
~ ( subset(X1,X0)
& proper_subset(X0,X1) ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X1,X0] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X1,X0] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f54,plain,
( spl2_2
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f53,f41,f45]) ).
fof(f41,plain,
( spl2_1
<=> subset(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f53,plain,
( sK1 = sK0
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f52,f33]) ).
fof(f33,plain,
subset(sK1,sK0),
inference(cnf_transformation,[],[f22]) ).
fof(f52,plain,
( sK1 = sK0
| ~ subset(sK1,sK0)
| ~ spl2_1 ),
inference(resolution,[],[f42,f26]) ).
fof(f26,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f42,plain,
( subset(sK0,sK1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f51,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f50]) ).
fof(f50,plain,
( $false
| spl2_1 ),
inference(subsumption_resolution,[],[f49,f32]) ).
fof(f49,plain,
( ~ proper_subset(sK0,sK1)
| spl2_1 ),
inference(resolution,[],[f43,f28]) ).
fof(f28,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ proper_subset(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( proper_subset(X1,X0)
| X0 = X1
| ~ subset(X1,X0) )
& ( ( X0 != X1
& subset(X1,X0) )
| ~ proper_subset(X1,X0) ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) )
& ( ( X0 != X1
& subset(X0,X1) )
| ~ proper_subset(X0,X1) ) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) )
& ( ( X0 != X1
& subset(X0,X1) )
| ~ proper_subset(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( proper_subset(X0,X1)
<=> ( X0 != X1
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f43,plain,
( ~ subset(sK0,sK1)
| spl2_1 ),
inference(avatar_component_clause,[],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 14:44:33 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.53 % (20500)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.53/0.55 % (20500)First to succeed.
% 1.53/0.55 % (20499)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.53/0.56 % (20500)Refutation found. Thanks to Tanya!
% 1.53/0.56 % SZS status Theorem for theBenchmark
% 1.53/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.53/0.56 % (20500)------------------------------
% 1.53/0.56 % (20500)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.56 % (20500)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.56 % (20500)Termination reason: Refutation
% 1.53/0.56
% 1.53/0.56 % (20500)Memory used [KB]: 5373
% 1.53/0.56 % (20500)Time elapsed: 0.131 s
% 1.53/0.56 % (20500)Instructions burned: 1 (million)
% 1.53/0.56 % (20500)------------------------------
% 1.53/0.56 % (20500)------------------------------
% 1.53/0.56 % (20491)Success in time 0.195 s
%------------------------------------------------------------------------------