TSTP Solution File: SET620+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET620+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 : n011.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:07 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 26 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 45 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f167,plain,
$false,
inference(trivial_inequality_removal,[],[f166]) ).
fof(f166,plain,
union(difference(sK0,sK1),difference(sK1,sK0)) != union(difference(sK0,sK1),difference(sK1,sK0)),
inference(backward_demodulation,[],[f81,f162]) ).
fof(f162,plain,
! [X2,X3] : union(difference(X3,X2),difference(X2,X3)) = difference(union(X3,X2),intersection(X3,X2)),
inference(superposition,[],[f104,f90]) ).
fof(f90,plain,
! [X0,X1] : difference(X0,X1) = difference(X0,intersection(X1,X0)),
inference(superposition,[],[f53,f63]) ).
fof(f63,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f53,plain,
! [X0,X1] : difference(X0,X1) = difference(X0,intersection(X0,X1)),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] : difference(X0,X1) = difference(X0,intersection(X0,X1)),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X1,X0] : difference(X1,X0) = difference(X1,intersection(X1,X0)),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : difference(X0,X1) = difference(X0,intersection(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_into_intersection) ).
fof(f104,plain,
! [X2,X0,X1] : difference(union(X0,X2),intersection(X0,X1)) = union(difference(X0,X1),difference(X2,intersection(X0,X1))),
inference(superposition,[],[f69,f53]) ).
fof(f69,plain,
! [X2,X0,X1] : difference(union(X0,X1),X2) = union(difference(X0,X2),difference(X1,X2)),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2] : difference(union(X0,X1),X2) = union(difference(X0,X2),difference(X1,X2)),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1,X2,X0] : difference(union(X1,X2),X0) = union(difference(X1,X0),difference(X2,X0)),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X2,X0,X1] : difference(union(X0,X1),X2) = union(difference(X0,X2),difference(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_distributes_over_union) ).
fof(f81,plain,
difference(union(sK0,sK1),intersection(sK0,sK1)) != union(difference(sK0,sK1),difference(sK1,sK0)),
inference(definition_unfolding,[],[f64,f65]) ).
fof(f65,plain,
! [X0,X1] : symmetric_difference(X1,X0) = union(difference(X1,X0),difference(X0,X1)),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] : 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/sandbox2/benchmark/theBenchmark.p',symmetric_difference_defn) ).
fof(f64,plain,
difference(union(sK0,sK1),intersection(sK0,sK1)) != symmetric_difference(sK0,sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
difference(union(sK0,sK1),intersection(sK0,sK1)) != symmetric_difference(sK0,sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f27,f37]) ).
fof(f37,plain,
( ? [X0,X1] : symmetric_difference(X0,X1) != difference(union(X0,X1),intersection(X0,X1))
=> difference(union(sK0,sK1),intersection(sK0,sK1)) != symmetric_difference(sK0,sK1) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1] : symmetric_difference(X0,X1) != difference(union(X0,X1),intersection(X0,X1)),
inference(ennf_transformation,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] : symmetric_difference(X0,X1) = difference(union(X0,X1),intersection(X0,X1)),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X0,X1] : symmetric_difference(X0,X1) = difference(union(X0,X1),intersection(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th96) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET620+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_sat --cores 0 -t %d %s
% 0.12/0.35 % Computer : n011.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Aug 30 14:02:25 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.48 % (14287)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.49 % (14301)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.20/0.49 % (14293)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.20/0.50 % (14280)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.50 % (14301)First to succeed.
% 0.20/0.50 % (14295)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.20/0.51 TRYING [1]
% 0.20/0.51 % (14282)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.20/0.51 % (14301)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (14301)------------------------------
% 0.20/0.51 % (14301)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (14301)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (14301)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (14301)Memory used [KB]: 5500
% 0.20/0.51 % (14301)Time elapsed: 0.075 s
% 0.20/0.51 % (14301)Instructions burned: 8 (million)
% 0.20/0.51 % (14301)------------------------------
% 0.20/0.51 % (14301)------------------------------
% 0.20/0.51 % (14273)Success in time 0.155 s
%------------------------------------------------------------------------------