TSTP Solution File: SET971+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET971+1 : TPTP v8.1.0. Released v3.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 : n018.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:26:13 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 49 ( 25 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 36 ( 14 ~; 2 |; 15 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 40 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(trivial_inequality_removal,[],[f51]) ).
fof(f51,plain,
cartesian_product2(sK2,sK4) != cartesian_product2(sK2,sK4),
inference(forward_demodulation,[],[f50,f38]) ).
fof(f38,plain,
set_intersection2(sK4,sK5) = sK4,
inference(resolution,[],[f28,f35]) ).
fof(f35,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
( subset(sK4,sK5)
& subset(sK2,sK3)
& cartesian_product2(sK2,sK4) != set_intersection2(cartesian_product2(sK2,sK5),cartesian_product2(sK3,sK4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f24,f25]) ).
fof(f25,plain,
( ? [X0,X1,X2,X3] :
( subset(X2,X3)
& subset(X0,X1)
& cartesian_product2(X0,X2) != set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2)) )
=> ( subset(sK4,sK5)
& subset(sK2,sK3)
& cartesian_product2(sK2,sK4) != set_intersection2(cartesian_product2(sK2,sK5),cartesian_product2(sK3,sK4)) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
? [X0,X1,X2,X3] :
( subset(X2,X3)
& subset(X0,X1)
& cartesian_product2(X0,X2) != set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2)) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
? [X3,X1,X0,X2] :
( subset(X0,X2)
& subset(X3,X1)
& cartesian_product2(X3,X0) != set_intersection2(cartesian_product2(X3,X2),cartesian_product2(X1,X0)) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X3,X1,X0,X2] :
( cartesian_product2(X3,X0) != set_intersection2(cartesian_product2(X3,X2),cartesian_product2(X1,X0))
& subset(X0,X2)
& subset(X3,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
~ ! [X3,X1,X0,X2] :
( ( subset(X0,X2)
& subset(X3,X1) )
=> cartesian_product2(X3,X0) = set_intersection2(cartesian_product2(X3,X2),cartesian_product2(X1,X0)) ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X2,X1,X3,X0] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> cartesian_product2(X0,X2) = set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2)) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X2,X1,X3,X0] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> cartesian_product2(X0,X2) = set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t124_zfmisc_1) ).
fof(f28,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f50,plain,
cartesian_product2(sK2,set_intersection2(sK4,sK5)) != cartesian_product2(sK2,sK4),
inference(forward_demodulation,[],[f49,f36]) ).
fof(f36,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f49,plain,
cartesian_product2(sK2,sK4) != cartesian_product2(sK2,set_intersection2(sK5,sK4)),
inference(backward_demodulation,[],[f33,f43]) ).
fof(f43,plain,
! [X11,X12] : cartesian_product2(sK2,set_intersection2(X11,X12)) = set_intersection2(cartesian_product2(sK2,X11),cartesian_product2(sK3,X12)),
inference(superposition,[],[f31,f37]) ).
fof(f37,plain,
sK2 = set_intersection2(sK2,sK3),
inference(resolution,[],[f28,f34]) ).
fof(f34,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f26]) ).
fof(f31,plain,
! [X2,X3,X0,X1] : cartesian_product2(set_intersection2(X1,X3),set_intersection2(X0,X2)) = set_intersection2(cartesian_product2(X1,X0),cartesian_product2(X3,X2)),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2,X3] : cartesian_product2(set_intersection2(X1,X3),set_intersection2(X0,X2)) = set_intersection2(cartesian_product2(X1,X0),cartesian_product2(X3,X2)),
inference(rectify,[],[f11]) ).
fof(f11,plain,
! [X1,X3,X0,X2] : cartesian_product2(set_intersection2(X3,X2),set_intersection2(X1,X0)) = set_intersection2(cartesian_product2(X3,X1),cartesian_product2(X2,X0)),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X3,X2,X1,X0] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(f33,plain,
cartesian_product2(sK2,sK4) != set_intersection2(cartesian_product2(sK2,sK5),cartesian_product2(sK3,sK4)),
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET971+1 : TPTP v8.1.0. Released v3.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.13/0.34 % Computer : n018.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:36:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (2882)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50 % (2905)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 (2999ds/467Mi)
% 0.20/0.50 % (2881)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.50 TRYING [1]
% 0.20/0.50 TRYING [2]
% 0.20/0.50 % (2896)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 (2999ds/75Mi)
% 0.20/0.50 TRYING [3]
% 0.20/0.51 % (2905)First to succeed.
% 0.20/0.51 % (2889)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51 % (2905)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 % (2905)------------------------------
% 0.20/0.51 % (2905)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (2905)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (2905)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (2905)Memory used [KB]: 5373
% 0.20/0.51 % (2905)Time elapsed: 0.054 s
% 0.20/0.51 % (2905)Instructions burned: 2 (million)
% 0.20/0.51 % (2905)------------------------------
% 0.20/0.51 % (2905)------------------------------
% 0.20/0.51 % (2877)Success in time 0.157 s
%------------------------------------------------------------------------------