TSTP Solution File: SET576+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET576+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 : n008.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.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 4 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 85 ( 39 ~; 21 |; 15 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 40 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,plain,
$false,
inference(subsumption_resolution,[],[f31,f26]) ).
fof(f26,plain,
intersect(sK2,sK1),
inference(resolution,[],[f25,f23]) ).
fof(f23,plain,
~ disjoint(sK2,sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ~ disjoint(sK2,sK1)
& ! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f16,f17]) ).
fof(f17,plain,
( ? [X0,X1] :
( ~ disjoint(X1,X0)
& ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
=> ( ~ disjoint(sK2,sK1)
& ! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0,X1] :
( ~ disjoint(X1,X0)
& ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
? [X1,X0] :
( ~ disjoint(X0,X1)
& ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th17) ).
fof(f25,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
! [X1,X0] :
( ~ intersect(X0,X1)
=> disjoint(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f31,plain,
~ intersect(sK2,sK1),
inference(duplicate_literal_removal,[],[f29]) ).
fof(f29,plain,
( ~ intersect(sK2,sK1)
| ~ intersect(sK2,sK1) ),
inference(resolution,[],[f20,f27]) ).
fof(f27,plain,
! [X0] :
( ~ member(sK0(X0,sK2),sK1)
| ~ intersect(sK2,X0) ),
inference(resolution,[],[f19,f22]) ).
fof(f22,plain,
! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f19,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ( member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) )
| ~ intersect(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f14]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X0)
& member(X3,X1) )
=> ( member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ? [X3] :
( member(X3,X0)
& member(X3,X1) )
| ~ intersect(X1,X0) ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
| ~ intersect(X1,X0) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0,X1] :
( intersect(X1,X0)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f20,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET576+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/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 : n008.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 14:04:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51 % (19858)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.19/0.51 % (19858)First to succeed.
% 0.19/0.51 % (19858)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (19858)------------------------------
% 0.19/0.51 % (19858)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (19858)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (19858)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (19858)Memory used [KB]: 5373
% 0.19/0.51 % (19858)Time elapsed: 0.104 s
% 0.19/0.51 % (19858)Instructions burned: 1 (million)
% 0.19/0.51 % (19858)------------------------------
% 0.19/0.51 % (19858)------------------------------
% 0.19/0.51 % (19837)Success in time 0.167 s
%------------------------------------------------------------------------------