TSTP Solution File: SET591+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET591+3 : TPTP v8.1.0. Released v2.2.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 : n013.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:25:00 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 113 ( 18 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 126 ( 50 ~; 36 |; 28 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 73 ( 64 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,plain,
$false,
inference(subsumption_resolution,[],[f94,f36]) ).
fof(f36,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( empty_set != sK2
& subset(sK2,difference(sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f23,f24]) ).
fof(f24,plain,
( ? [X0,X1] :
( empty_set != X1
& subset(X1,difference(X0,X1)) )
=> ( empty_set != sK2
& subset(sK2,difference(sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1] :
( empty_set != X1
& subset(X1,difference(X0,X1)) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
? [X1,X0] :
( empty_set != X0
& subset(X0,difference(X1,X0)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,difference(X1,X0))
=> empty_set = X0 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1] :
( subset(X0,difference(X1,X0))
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th50) ).
fof(f94,plain,
empty_set = sK2,
inference(resolution,[],[f89,f48]) ).
fof(f48,plain,
! [X1] :
( ~ subset(X1,empty_set)
| empty_set = X1 ),
inference(resolution,[],[f28,f42]) ).
fof(f42,plain,
! [X1] : subset(empty_set,X1),
inference(resolution,[],[f33,f37]) ).
fof(f37,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f33,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( member(sK0(X0,X1),X1)
& ~ member(sK0(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f20,f21]) ).
fof(f21,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& ~ member(X3,X0) )
=> ( member(sK0(X0,X1),X1)
& ~ member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( member(X3,X1)
& ~ member(X3,X0) ) ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( member(X2,X1)
& ~ member(X2,X0) ) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( member(X2,X1)
=> member(X2,X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f28,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f89,plain,
! [X0] : subset(sK2,X0),
inference(resolution,[],[f88,f33]) ).
fof(f88,plain,
! [X4] : ~ member(X4,sK2),
inference(subsumption_resolution,[],[f80,f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X1,difference(X2,X0))
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( ( ~ member(X1,X0)
& member(X1,X2) )
| ~ member(X1,difference(X2,X0)) )
& ( member(X1,difference(X2,X0))
| member(X1,X0)
| ~ member(X1,X2) ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ( ( ~ member(X0,X2)
& member(X0,X1) )
| ~ member(X0,difference(X1,X2)) )
& ( member(X0,difference(X1,X2))
| member(X0,X2)
| ~ member(X0,X1) ) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
! [X2,X0,X1] :
( ( ( ~ member(X0,X2)
& member(X0,X1) )
| ~ member(X0,difference(X1,X2)) )
& ( member(X0,difference(X1,X2))
| member(X0,X2)
| ~ member(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X2,X0,X1] :
( ( ~ member(X0,X2)
& member(X0,X1) )
<=> member(X0,difference(X1,X2)) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ( ~ member(X2,X1)
& member(X2,X0) )
<=> member(X2,difference(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f80,plain,
! [X4] :
( ~ member(X4,sK2)
| member(X4,difference(sK1,sK2)) ),
inference(resolution,[],[f34,f35]) ).
fof(f35,plain,
subset(sK2,difference(sK1,sK2)),
inference(cnf_transformation,[],[f25]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ subset(X1,X0)
| ~ member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/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.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 13:59:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (28325)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.20/0.50 % (28333)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.20/0.50 % (28325)First to succeed.
% 0.20/0.51 % (28325)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (28325)------------------------------
% 0.20/0.51 % (28325)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (28325)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (28325)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (28325)Memory used [KB]: 5373
% 0.20/0.51 % (28325)Time elapsed: 0.099 s
% 0.20/0.51 % (28325)Instructions burned: 3 (million)
% 0.20/0.51 % (28325)------------------------------
% 0.20/0.51 % (28325)------------------------------
% 0.20/0.51 % (28308)Success in time 0.154 s
%------------------------------------------------------------------------------