TSTP Solution File: SET630+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET630+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 : n004.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.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 27 unt; 0 def)
% Number of atoms : 74 ( 10 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 62 ( 29 ~; 20 |; 8 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 66 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f133,plain,
$false,
inference(subsumption_resolution,[],[f132,f89]) ).
fof(f89,plain,
! [X0,X1] : ~ intersect(intersection(X1,X0),difference(X0,X1)),
inference(superposition,[],[f73,f64]) ).
fof(f64,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f73,plain,
! [X0,X1] : ~ intersect(intersection(X0,X1),difference(X0,X1)),
inference(resolution,[],[f43,f63]) ).
fof(f63,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1] :
( ( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) )
& ( disjoint(X0,X1)
| intersect(X0,X1) ) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X1,X0] :
( ( ~ intersect(X1,X0)
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| intersect(X1,X0) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( ~ intersect(X1,X0)
<=> disjoint(X1,X0) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( ~ intersect(X0,X1)
<=> disjoint(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f43,plain,
! [X0,X1] : disjoint(intersection(X1,X0),difference(X1,X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] : disjoint(intersection(X1,X0),difference(X1,X0)),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : disjoint(intersection(X0,X1),difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_and_union_disjoint) ).
fof(f132,plain,
intersect(intersection(sK1,sK2),difference(sK2,sK1)),
inference(subsumption_resolution,[],[f123,f73]) ).
fof(f123,plain,
( intersect(intersection(sK1,sK2),difference(sK1,sK2))
| intersect(intersection(sK1,sK2),difference(sK2,sK1)) ),
inference(resolution,[],[f52,f71]) ).
fof(f71,plain,
intersect(intersection(sK1,sK2),union(difference(sK1,sK2),difference(sK2,sK1))),
inference(forward_demodulation,[],[f70,f64]) ).
fof(f70,plain,
intersect(intersection(sK2,sK1),union(difference(sK1,sK2),difference(sK2,sK1))),
inference(resolution,[],[f62,f69]) ).
fof(f69,plain,
~ disjoint(intersection(sK2,sK1),union(difference(sK1,sK2),difference(sK2,sK1))),
inference(forward_demodulation,[],[f65,f66]) ).
fof(f66,plain,
! [X0,X1] : union(difference(X0,X1),difference(X1,X0)) = union(difference(X1,X0),difference(X0,X1)),
inference(definition_unfolding,[],[f49,f50,f50]) ).
fof(f50,plain,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X1,X0] : symmetric_difference(X1,X0) = union(difference(X1,X0),difference(X0,X1)),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_difference_defn) ).
fof(f49,plain,
! [X0,X1] : symmetric_difference(X0,X1) = symmetric_difference(X1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] : symmetric_difference(X0,X1) = symmetric_difference(X1,X0),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] : symmetric_difference(X0,X1) = symmetric_difference(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_symmetric_difference) ).
fof(f65,plain,
~ disjoint(intersection(sK2,sK1),union(difference(sK2,sK1),difference(sK1,sK2))),
inference(definition_unfolding,[],[f48,f50]) ).
fof(f48,plain,
~ disjoint(intersection(sK2,sK1),symmetric_difference(sK2,sK1)),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
~ disjoint(intersection(sK2,sK1),symmetric_difference(sK2,sK1)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f22,f28]) ).
fof(f28,plain,
( ? [X0,X1] : ~ disjoint(intersection(X1,X0),symmetric_difference(X1,X0))
=> ~ disjoint(intersection(sK2,sK1),symmetric_difference(sK2,sK1)) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
? [X0,X1] : ~ disjoint(intersection(X1,X0),symmetric_difference(X1,X0)),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X1,X0] : disjoint(intersection(X1,X0),symmetric_difference(X1,X0)),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X1,X0] : disjoint(intersection(X0,X1),symmetric_difference(X0,X1)),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X1,X0] : disjoint(intersection(X0,X1),symmetric_difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_and_symmetric_difference_disjoint) ).
fof(f62,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f52,plain,
! [X2,X0,X1] :
( ~ intersect(X0,union(X1,X2))
| intersect(X0,X1)
| intersect(X0,X2) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( intersect(X0,union(X1,X2))
| ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) ) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| ~ intersect(X0,union(X1,X2)) ) ),
inference(rectify,[],[f33]) ).
fof(f33,plain,
! [X2,X1,X0] :
( ( intersect(X2,union(X1,X0))
| ( ~ intersect(X2,X0)
& ~ intersect(X2,X1) ) )
& ( intersect(X2,X0)
| intersect(X2,X1)
| ~ intersect(X2,union(X1,X0)) ) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X2,X1,X0] :
( ( intersect(X2,union(X1,X0))
| ( ~ intersect(X2,X0)
& ~ intersect(X2,X1) ) )
& ( intersect(X2,X0)
| intersect(X2,X1)
| ~ intersect(X2,union(X1,X0)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X2,X1,X0] :
( intersect(X2,union(X1,X0))
<=> ( intersect(X2,X0)
| intersect(X2,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X1,X0] :
( intersect(X0,union(X1,X2))
<=> ( intersect(X0,X2)
| intersect(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_with_union) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET630+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 : n004.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:03:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.47 % (31308)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.47 % (31288)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 (2999ds/37Mi)
% 0.21/0.48 % (31288)First to succeed.
% 0.21/0.48 % (31308)Also succeeded, but the first one will report.
% 0.21/0.48 % (31288)Refutation found. Thanks to Tanya!
% 0.21/0.48 % SZS status Theorem for theBenchmark
% 0.21/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.48 % (31288)------------------------------
% 0.21/0.48 % (31288)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.48 % (31288)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.48 % (31288)Termination reason: Refutation
% 0.21/0.48
% 0.21/0.48 % (31288)Memory used [KB]: 895
% 0.21/0.48 % (31288)Time elapsed: 0.083 s
% 0.21/0.48 % (31288)Instructions burned: 5 (million)
% 0.21/0.48 % (31288)------------------------------
% 0.21/0.48 % (31288)------------------------------
% 0.21/0.48 % (31285)Success in time 0.128 s
%------------------------------------------------------------------------------