TSTP Solution File: SET626+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET626+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 : n020.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:40 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 87 ( 32 ~; 23 |; 23 &)
% ( 4 <=>; 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 : 63 ( 49 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f86,plain,
$false,
inference(unit_resulting_resolution,[],[f59,f50,f42]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) )
& ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
! [X2,X1,X0] :
( ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X2,X1)) )
& ( member(X0,intersection(X2,X1))
| ~ member(X0,X2)
| ~ member(X0,X1) ) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
! [X2,X1,X0] :
( ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X2,X1)) )
& ( member(X0,intersection(X2,X1))
| ~ member(X0,X2)
| ~ member(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X2,X1,X0] :
( ( member(X0,X2)
& member(X0,X1) )
<=> member(X0,intersection(X2,X1)) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X2,X1,X0] :
( ( member(X2,X1)
& member(X2,X0) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f50,plain,
member(sK4(sK1,intersection(sK2,sK3)),intersection(sK2,sK3)),
inference(unit_resulting_resolution,[],[f34,f38]) ).
fof(f38,plain,
! [X0,X1] :
( member(sK4(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( ( member(sK4(X0,X1),X0)
& member(sK4(X0,X1),X1) )
| ~ intersect(X0,X1) )
& ( intersect(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| ~ member(X3,X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f23,f24]) ).
fof(f24,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
=> ( member(sK4(X0,X1),X0)
& member(sK4(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X1] :
( ( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
| ~ intersect(X0,X1) )
& ( intersect(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| ~ member(X3,X1) ) ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1,X0] :
( ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X1,X0) )
& ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1,X0] :
( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
<=> intersect(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
<=> intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f34,plain,
intersect(sK1,intersection(sK2,sK3)),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( ~ intersect(sK1,sK2)
& intersect(sK1,intersection(sK2,sK3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f19,f20]) ).
fof(f20,plain,
( ? [X0,X1,X2] :
( ~ intersect(X0,X1)
& intersect(X0,intersection(X1,X2)) )
=> ( ~ intersect(sK1,sK2)
& intersect(sK1,intersection(sK2,sK3)) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0,X1,X2] :
( ~ intersect(X0,X1)
& intersect(X0,intersection(X1,X2)) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
? [X0,X2,X1] :
( ~ intersect(X0,X2)
& intersect(X0,intersection(X2,X1)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X2,X1] :
( intersect(X0,intersection(X2,X1))
=> intersect(X0,X2) ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X2,X1] :
( intersect(X0,intersection(X1,X2))
=> intersect(X0,X1) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0,X2,X1] :
( intersect(X0,intersection(X1,X2))
=> intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th102) ).
fof(f59,plain,
~ member(sK4(sK1,intersection(sK2,sK3)),sK2),
inference(unit_resulting_resolution,[],[f52,f35,f37]) ).
fof(f37,plain,
! [X3,X0,X1] :
( ~ member(X3,X1)
| intersect(X0,X1)
| ~ member(X3,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
~ intersect(sK1,sK2),
inference(cnf_transformation,[],[f21]) ).
fof(f52,plain,
member(sK4(sK1,intersection(sK2,sK3)),sK1),
inference(unit_resulting_resolution,[],[f34,f39]) ).
fof(f39,plain,
! [X0,X1] :
( member(sK4(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET626+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/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 : n020.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:08:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (5059)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.51 % (5058)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.51 % (5067)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (5067)First to succeed.
% 0.20/0.51 % (5055)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.51 % (5055)Refutation not found, incomplete strategy% (5055)------------------------------
% 0.20/0.51 % (5055)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (5055)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (5055)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (5055)Memory used [KB]: 5884
% 0.20/0.51 % (5055)Time elapsed: 0.108 s
% 0.20/0.51 % (5055)Instructions burned: 2 (million)
% 0.20/0.51 % (5055)------------------------------
% 0.20/0.51 % (5055)------------------------------
% 0.20/0.51 % (5066)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.52 % (5067)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (5067)------------------------------
% 0.20/0.52 % (5067)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (5067)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (5067)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (5067)Memory used [KB]: 6012
% 0.20/0.52 % (5067)Time elapsed: 0.106 s
% 0.20/0.52 % (5067)Instructions burned: 4 (million)
% 0.20/0.52 % (5067)------------------------------
% 0.20/0.52 % (5067)------------------------------
% 0.20/0.52 % (5052)Success in time 0.162 s
%------------------------------------------------------------------------------