TSTP Solution File: SET631+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n016.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:10 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 9 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 101 ( 40 ~; 29 |; 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 : 74 ( 60 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f63,plain,
$false,
inference(subsumption_resolution,[],[f62,f35]) ).
fof(f35,plain,
~ intersect(sK0,sK1),
inference(literal_reordering,[],[f22]) ).
fof(f22,plain,
~ intersect(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( intersect(sK0,difference(sK1,sK2))
& ~ intersect(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f12,f13]) ).
fof(f13,plain,
( ? [X0,X1,X2] :
( intersect(X0,difference(X1,X2))
& ~ intersect(X0,X1) )
=> ( intersect(sK0,difference(sK1,sK2))
& ~ intersect(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1,X2] :
( intersect(X0,difference(X1,X2))
& ~ intersect(X0,X1) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
? [X0,X2,X1] :
( intersect(X0,difference(X2,X1))
& ~ intersect(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ! [X2,X0,X1] :
( 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/sandbox/benchmark/theBenchmark.p',prove_th113) ).
fof(f62,plain,
intersect(sK0,sK1),
inference(resolution,[],[f47,f49]) ).
fof(f49,plain,
member(sK3(difference(sK1,sK2),sK0),sK1),
inference(resolution,[],[f42,f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X1,difference(X0,X2))
| member(X1,X0) ),
inference(literal_reordering,[],[f28]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ member(X1,difference(X0,X2))
| member(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( member(X1,difference(X0,X2))
| member(X1,X2)
| ~ member(X1,X0) )
& ( ( ~ member(X1,X2)
& member(X1,X0) )
| ~ member(X1,difference(X0,X2)) ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X1,X2,X0] :
( ( member(X2,difference(X1,X0))
| member(X2,X0)
| ~ member(X2,X1) )
& ( ( ~ member(X2,X0)
& member(X2,X1) )
| ~ member(X2,difference(X1,X0)) ) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X1,X2,X0] :
( ( member(X2,difference(X1,X0))
| member(X2,X0)
| ~ member(X2,X1) )
& ( ( ~ member(X2,X0)
& member(X2,X1) )
| ~ member(X2,difference(X1,X0)) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
! [X1,X2,X0] :
( member(X2,difference(X1,X0))
<=> ( ~ member(X2,X0)
& member(X2,X1) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0,X2] :
( ( ~ member(X2,X1)
& member(X2,X0) )
<=> member(X2,difference(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f42,plain,
member(sK3(difference(sK1,sK2),sK0),difference(sK1,sK2)),
inference(resolution,[],[f38,f39]) ).
fof(f39,plain,
intersect(sK0,difference(sK1,sK2)),
inference(literal_reordering,[],[f23]) ).
fof(f23,plain,
intersect(sK0,difference(sK1,sK2)),
inference(cnf_transformation,[],[f14]) ).
fof(f38,plain,
! [X0,X1] :
( ~ intersect(X1,X0)
| member(sK3(X0,X1),X0) ),
inference(literal_reordering,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ~ intersect(X1,X0)
| member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ( member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) )
| ~ intersect(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f17]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
| ~ intersect(X1,X0) ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X1,X0) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( intersect(X1,X0)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f47,plain,
! [X1] :
( ~ member(sK3(difference(sK1,sK2),sK0),X1)
| intersect(sK0,X1) ),
inference(resolution,[],[f41,f34]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X1,X0) ),
inference(literal_reordering,[],[f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| intersect(X1,X0)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f41,plain,
member(sK3(difference(sK1,sK2),sK0),sK0),
inference(resolution,[],[f32,f39]) ).
fof(f32,plain,
! [X0,X1] :
( ~ intersect(X1,X0)
| member(sK3(X0,X1),X1) ),
inference(literal_reordering,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( member(sK3(X0,X1),X1)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET631+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_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 14:29:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49 % (8838)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.19/0.50 % (8828)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.19/0.50 % (8840)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.19/0.50 % (8840)First to succeed.
% 0.19/0.50 % (8840)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (8840)------------------------------
% 0.19/0.50 % (8840)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (8840)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (8840)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (8840)Memory used [KB]: 5756
% 0.19/0.50 % (8840)Time elapsed: 0.003 s
% 0.19/0.50 % (8840)Instructions burned: 4 (million)
% 0.19/0.50 % (8840)------------------------------
% 0.19/0.50 % (8840)------------------------------
% 0.19/0.50 % (8822)Success in time 0.157 s
%------------------------------------------------------------------------------