TSTP Solution File: SET574+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET574+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 : n027.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:24:57 EDT 2022
% Result : Theorem 0.16s 0.51s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 65 ( 21 ~; 12 |; 25 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 28 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f31,plain,
$false,
inference(subsumption_resolution,[],[f30,f21]) ).
fof(f21,plain,
~ intersect(sK2,sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
( member(sK3,sK2)
& member(sK3,sK1)
& ~ intersect(sK2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f15,f16]) ).
fof(f16,plain,
( ? [X0,X1,X2] :
( member(X2,X1)
& member(X2,X0)
& ~ intersect(X1,X0) )
=> ( member(sK3,sK2)
& member(sK3,sK1)
& ~ intersect(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0,X1,X2] :
( member(X2,X1)
& member(X2,X0)
& ~ intersect(X1,X0) ),
inference(rectify,[],[f9]) ).
fof(f9,plain,
? [X1,X2,X0] :
( member(X0,X2)
& member(X0,X1)
& ~ intersect(X2,X1) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
? [X0,X1,X2] :
( ~ intersect(X2,X1)
& member(X0,X1)
& member(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ! [X0,X1,X2] :
( ( member(X0,X1)
& member(X0,X2) )
=> intersect(X2,X1) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ! [X0,X2,X1] :
( ( member(X0,X1)
& member(X0,X2) )
=> intersect(X1,X2) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
! [X0,X2,X1] :
( ( member(X0,X1)
& member(X0,X2) )
=> intersect(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th13) ).
fof(f30,plain,
intersect(sK2,sK1),
inference(resolution,[],[f25,f23]) ).
fof(f23,plain,
member(sK3,sK2),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
! [X0] :
( ~ member(sK3,X0)
| intersect(X0,sK1) ),
inference(resolution,[],[f18,f22]) ).
fof(f22,plain,
member(sK3,sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f18,plain,
! [X3,X0,X1] :
( ~ member(X3,X1)
| intersect(X0,X1)
| ~ member(X3,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ( ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) )
| ~ intersect(X0,X1) )
& ( intersect(X0,X1)
| ! [X3] :
( ~ member(X3,X1)
| ~ member(X3,X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f13]) ).
fof(f13,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
=> ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X0,X1] :
( ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X0,X1) )
& ( intersect(X0,X1)
| ! [X3] :
( ~ member(X3,X1)
| ~ member(X3,X0) ) ) ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
! [X1,X0] :
( ( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
| ~ intersect(X1,X0) )
& ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X1,X0] :
( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
<=> intersect(X1,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
<=> intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET574+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.31 % Computer : n027.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Aug 30 14:15:16 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.16/0.49 % (4964)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.16/0.50 % (4980)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.16/0.50 % (4972)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/176Mi)
% 0.16/0.50 % (4964)First to succeed.
% 0.16/0.51 % (4964)Refutation found. Thanks to Tanya!
% 0.16/0.51 % SZS status Theorem for theBenchmark
% 0.16/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.51 % (4964)------------------------------
% 0.16/0.51 % (4964)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.51 % (4964)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.51 % (4964)Termination reason: Refutation
% 0.16/0.51
% 0.16/0.51 % (4964)Memory used [KB]: 5373
% 0.16/0.51 % (4964)Time elapsed: 0.116 s
% 0.16/0.51 % (4964)Instructions burned: 1 (million)
% 0.16/0.51 % (4964)------------------------------
% 0.16/0.51 % (4964)------------------------------
% 0.16/0.51 % (4949)Success in time 0.183 s
%------------------------------------------------------------------------------