TSTP Solution File: SET983+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET983+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 : n022.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:15 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 25 unt; 0 def)
% Number of atoms : 70 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 19 ~; 13 |; 8 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 56 ( 46 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f338,plain,
$false,
inference(avatar_sat_refutation,[],[f330,f332,f337]) ).
fof(f337,plain,
~ spl13_10,
inference(avatar_contradiction_clause,[],[f333]) ).
fof(f333,plain,
( $false
| ~ spl13_10 ),
inference(resolution,[],[f329,f39]) ).
fof(f39,plain,
~ in(sK3,sF11),
inference(definition_folding,[],[f22,f38,f37,f36]) ).
fof(f36,plain,
sF9 = set_intersection2(sK5,sK2),
introduced(function_definition,[]) ).
fof(f37,plain,
sF10 = set_intersection2(sK6,sK4),
introduced(function_definition,[]) ).
fof(f38,plain,
cartesian_product2(sF9,sF10) = sF11,
introduced(function_definition,[]) ).
fof(f22,plain,
~ in(sK3,cartesian_product2(set_intersection2(sK5,sK2),set_intersection2(sK6,sK4))),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
? [X3,X2,X1,X0,X4] :
( in(X2,cartesian_product2(X3,X1))
& ~ in(X2,cartesian_product2(set_intersection2(X0,X3),set_intersection2(X4,X1)))
& in(X2,cartesian_product2(X0,X4)) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
? [X3,X4,X2,X0,X1] :
( ~ in(X2,cartesian_product2(set_intersection2(X0,X3),set_intersection2(X4,X1)))
& in(X2,cartesian_product2(X3,X1))
& in(X2,cartesian_product2(X0,X4)) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
~ ! [X3,X4,X2,X0,X1] :
( ( in(X2,cartesian_product2(X3,X1))
& in(X2,cartesian_product2(X0,X4)) )
=> in(X2,cartesian_product2(set_intersection2(X0,X3),set_intersection2(X4,X1))) ),
inference(rectify,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X1,X4,X0,X3,X2] :
( ( in(X0,cartesian_product2(X1,X2))
& in(X0,cartesian_product2(X3,X4)) )
=> in(X0,cartesian_product2(set_intersection2(X1,X3),set_intersection2(X2,X4))) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X1,X4,X0,X3,X2] :
( ( in(X0,cartesian_product2(X1,X2))
& in(X0,cartesian_product2(X3,X4)) )
=> in(X0,cartesian_product2(set_intersection2(X1,X3),set_intersection2(X2,X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t137_zfmisc_1) ).
fof(f329,plain,
( in(sK3,sF11)
| ~ spl13_10 ),
inference(avatar_component_clause,[],[f327]) ).
fof(f327,plain,
( spl13_10
<=> in(sK3,sF11) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_10])]) ).
fof(f332,plain,
spl13_9,
inference(avatar_contradiction_clause,[],[f331]) ).
fof(f331,plain,
( $false
| spl13_9 ),
inference(resolution,[],[f325,f35]) ).
fof(f35,plain,
in(sK3,sF8),
inference(definition_folding,[],[f23,f34]) ).
fof(f34,plain,
sF8 = cartesian_product2(sK2,sK4),
introduced(function_definition,[]) ).
fof(f23,plain,
in(sK3,cartesian_product2(sK2,sK4)),
inference(cnf_transformation,[],[f15]) ).
fof(f325,plain,
( ~ in(sK3,sF8)
| spl13_9 ),
inference(avatar_component_clause,[],[f323]) ).
fof(f323,plain,
( spl13_9
<=> in(sK3,sF8) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_9])]) ).
fof(f330,plain,
( ~ spl13_9
| spl13_10 ),
inference(avatar_split_clause,[],[f321,f327,f323]) ).
fof(f321,plain,
( in(sK3,sF11)
| ~ in(sK3,sF8) ),
inference(resolution,[],[f306,f41]) ).
fof(f41,plain,
in(sK3,sF12),
inference(definition_folding,[],[f21,f40]) ).
fof(f40,plain,
sF12 = cartesian_product2(sK5,sK6),
introduced(function_definition,[]) ).
fof(f21,plain,
in(sK3,cartesian_product2(sK5,sK6)),
inference(cnf_transformation,[],[f15]) ).
fof(f306,plain,
! [X4] :
( ~ in(X4,sF12)
| in(X4,sF11)
| ~ in(X4,sF8) ),
inference(superposition,[],[f31,f303]) ).
fof(f303,plain,
set_intersection2(sF8,sF12) = sF11,
inference(forward_demodulation,[],[f302,f38]) ).
fof(f302,plain,
cartesian_product2(sF9,sF10) = set_intersection2(sF8,sF12),
inference(forward_demodulation,[],[f301,f17]) ).
fof(f17,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f301,plain,
cartesian_product2(sF9,sF10) = set_intersection2(sF12,sF8),
inference(forward_demodulation,[],[f291,f34]) ).
fof(f291,plain,
cartesian_product2(sF9,sF10) = set_intersection2(sF12,cartesian_product2(sK2,sK4)),
inference(superposition,[],[f272,f37]) ).
fof(f272,plain,
! [X0] : cartesian_product2(sF9,set_intersection2(sK6,X0)) = set_intersection2(sF12,cartesian_product2(sK2,X0)),
inference(superposition,[],[f93,f40]) ).
fof(f93,plain,
! [X16,X15] : set_intersection2(cartesian_product2(sK5,X15),cartesian_product2(sK2,X16)) = cartesian_product2(sF9,set_intersection2(X15,X16)),
inference(superposition,[],[f24,f36]) ).
fof(f24,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,[],[f11]) ).
fof(f11,plain,
! [X0,X3,X2,X1] : cartesian_product2(set_intersection2(X1,X3),set_intersection2(X0,X2)) = set_intersection2(cartesian_product2(X1,X0),cartesian_product2(X3,X2)),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X2,X0,X3,X1] : 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(f31,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ in(X3,X1)
| ~ in(X3,X0) ),
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X2,X1,X0] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/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 : n022.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:34:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.48 % (27745)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.49 % (27754)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.50 % (27766)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.19/0.50 % (27754)First to succeed.
% 0.19/0.50 % (27758)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.19/0.50 % (27750)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (27749)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (27743)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.19/0.51 % (27756)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.51 % (27755)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.51 % (27763)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.51 % (27750)Instruction limit reached!
% 0.19/0.51 % (27750)------------------------------
% 0.19/0.51 % (27750)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (27750)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (27750)Termination reason: Unknown
% 0.19/0.51 % (27750)Termination phase: Saturation
% 0.19/0.51
% 0.19/0.51 % (27750)Memory used [KB]: 5500
% 0.19/0.51 % (27750)Time elapsed: 0.071 s
% 0.19/0.51 % (27750)Instructions burned: 8 (million)
% 0.19/0.51 % (27750)------------------------------
% 0.19/0.51 % (27750)------------------------------
% 0.19/0.51 % (27763)Also succeeded, but the first one will report.
% 0.19/0.51 % (27754)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (27754)------------------------------
% 0.19/0.51 % (27754)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (27754)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (27754)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (27754)Memory used [KB]: 5756
% 0.19/0.51 % (27754)Time elapsed: 0.104 s
% 0.19/0.51 % (27754)Instructions burned: 13 (million)
% 0.19/0.51 % (27754)------------------------------
% 0.19/0.51 % (27754)------------------------------
% 0.19/0.51 % (27740)Success in time 0.164 s
%------------------------------------------------------------------------------