TSTP Solution File: SET631+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET631+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_uns --cores 0 -t %d %s
% Computer : n024.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:21:41 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 87 ( 35 ~; 24 |; 21 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 45 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,plain,
$false,
inference(subsumption_resolution,[],[f48,f40]) ).
fof(f40,plain,
~ member(sK3(difference(sK0,sK1),sK2),sK0),
inference(resolution,[],[f35,f30]) ).
fof(f30,plain,
! [X0] :
( ~ member(X0,sK2)
| ~ member(X0,sK0) ),
inference(resolution,[],[f21,f22]) ).
fof(f22,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| intersect(X1,X0)
| ~ member(X3,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( ( member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) )
| ~ intersect(X1,X0) )
& ( intersect(X1,X0)
| ! [X3] :
( ~ member(X3,X1)
| ~ member(X3,X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f13,f14]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
=> ( member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1] :
( ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X1,X0) )
& ( intersect(X1,X0)
| ! [X3] :
( ~ member(X3,X1)
| ~ member(X3,X0) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( ( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
| ~ intersect(X0,X1) )
& ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
<=> intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f21,plain,
~ intersect(sK2,sK0),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ~ intersect(sK2,sK0)
& intersect(sK2,difference(sK0,sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f10]) ).
fof(f10,plain,
( ? [X0,X1,X2] :
( ~ intersect(X2,X0)
& intersect(X2,difference(X0,X1)) )
=> ( ~ intersect(sK2,sK0)
& intersect(sK2,difference(sK0,sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0,X1,X2] :
( ~ intersect(X2,X0)
& intersect(X2,difference(X0,X1)) ),
inference(rectify,[],[f8]) ).
fof(f8,plain,
? [X2,X1,X0] :
( ~ intersect(X0,X2)
& intersect(X0,difference(X2,X1)) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
~ ! [X2,X1,X0] :
( intersect(X0,difference(X2,X1))
=> intersect(X0,X2) ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X0,X2,X1] :
( intersect(X0,difference(X1,X2))
=> intersect(X0,X1) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X0,X2,X1] :
( intersect(X0,difference(X1,X2))
=> intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th113) ).
fof(f35,plain,
member(sK3(difference(sK0,sK1),sK2),sK2),
inference(resolution,[],[f20,f24]) ).
fof(f24,plain,
! [X0,X1] :
( member(sK3(X0,X1),X1)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f20,plain,
intersect(sK2,difference(sK0,sK1)),
inference(cnf_transformation,[],[f11]) ).
fof(f48,plain,
member(sK3(difference(sK0,sK1),sK2),sK0),
inference(resolution,[],[f33,f28]) ).
fof(f28,plain,
! [X2,X0,X1] :
( member(X1,X2)
| ~ member(X1,difference(X2,X0)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( ( member(X1,X2)
& ~ member(X1,X0) )
| ~ member(X1,difference(X2,X0)) )
& ( member(X1,difference(X2,X0))
| ~ member(X1,X2)
| member(X1,X0) ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1,X2,X0] :
( ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) )
& ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X1,X2,X0] :
( ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) )
& ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X2,X0] :
( ( member(X2,X0)
& ~ member(X2,X1) )
<=> member(X2,difference(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f33,plain,
member(sK3(difference(sK0,sK1),sK2),difference(sK0,sK1)),
inference(resolution,[],[f20,f23]) ).
fof(f23,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n024.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:09:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % (18569)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.49 % (18573)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.49 % (18573)First to succeed.
% 0.19/0.49 % (18564)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.49 % (18574)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.49 % (18574)Also succeeded, but the first one will report.
% 0.19/0.49 % (18564)Refutation not found, incomplete strategy% (18564)------------------------------
% 0.19/0.49 % (18564)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (18564)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (18564)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.49
% 0.19/0.49 % (18564)Memory used [KB]: 5884
% 0.19/0.49 % (18564)Time elapsed: 0.099 s
% 0.19/0.49 % (18564)Instructions burned: 2 (million)
% 0.19/0.49 % (18564)------------------------------
% 0.19/0.49 % (18564)------------------------------
% 0.19/0.49 % (18573)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (18573)------------------------------
% 0.19/0.49 % (18573)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (18573)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (18573)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (18573)Memory used [KB]: 5884
% 0.19/0.49 % (18573)Time elapsed: 0.086 s
% 0.19/0.49 % (18573)Instructions burned: 2 (million)
% 0.19/0.49 % (18573)------------------------------
% 0.19/0.49 % (18573)------------------------------
% 0.19/0.49 % (18559)Success in time 0.149 s
%------------------------------------------------------------------------------