TSTP Solution File: SET918+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET918+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:05 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 17 unt; 0 def)
% Number of atoms : 86 ( 38 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 76 ( 33 ~; 24 |; 9 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 53 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f147,plain,
$false,
inference(avatar_sat_refutation,[],[f131,f133,f146]) ).
fof(f146,plain,
~ spl11_1,
inference(avatar_contradiction_clause,[],[f145]) ).
fof(f145,plain,
( $false
| ~ spl11_1 ),
inference(trivial_inequality_removal,[],[f138]) ).
fof(f138,plain,
( sK1 != sK1
| ~ spl11_1 ),
inference(superposition,[],[f26,f136]) ).
fof(f136,plain,
( sK3 = sK1
| ~ spl11_1 ),
inference(resolution,[],[f126,f87]) ).
fof(f87,plain,
! [X0] :
( ~ in(X0,sF8)
| sK1 = X0 ),
inference(superposition,[],[f55,f56]) ).
fof(f56,plain,
singleton(sK1) = sF8,
introduced(function_definition,[]) ).
fof(f55,plain,
! [X2,X0] :
( ~ in(X2,singleton(X0))
| X0 = X2 ),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ in(X2,X1)
| X0 = X2
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( X0 = X2
<=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f126,plain,
( in(sK3,sF8)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f124,plain,
( spl11_1
<=> in(sK3,sF8) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f26,plain,
sK3 != sK1,
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
? [X2,X1,X0] :
( singleton(X2) = set_intersection2(unordered_pair(X2,X0),X1)
& in(X0,X1)
& X0 != X2 ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X1,X0,X2] :
~ ( singleton(X2) = set_intersection2(unordered_pair(X2,X0),X1)
& in(X0,X1)
& X0 != X2 ),
inference(rectify,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X1,X2,X0] :
~ ( in(X1,X2)
& singleton(X0) = set_intersection2(unordered_pair(X0,X1),X2)
& X0 != X1 ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X1,X2,X0] :
~ ( in(X1,X2)
& singleton(X0) = set_intersection2(unordered_pair(X0,X1),X2)
& X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t59_zfmisc_1) ).
fof(f133,plain,
spl11_2,
inference(avatar_contradiction_clause,[],[f132]) ).
fof(f132,plain,
( $false
| spl11_2 ),
inference(resolution,[],[f130,f27]) ).
fof(f27,plain,
in(sK3,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f130,plain,
( ~ in(sK3,sK2)
| spl11_2 ),
inference(avatar_component_clause,[],[f128]) ).
fof(f128,plain,
( spl11_2
<=> in(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f131,plain,
( spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f121,f128,f124]) ).
fof(f121,plain,
( ~ in(sK3,sK2)
| in(sK3,sF8) ),
inference(resolution,[],[f119,f63]) ).
fof(f63,plain,
in(sK3,sF9),
inference(superposition,[],[f46,f57]) ).
fof(f57,plain,
unordered_pair(sK1,sK3) = sF9,
introduced(function_definition,[]) ).
fof(f46,plain,
! [X2,X3] : in(X3,unordered_pair(X2,X3)),
inference(equality_resolution,[],[f45]) ).
fof(f45,plain,
! [X2,X3,X0] :
( in(X3,X0)
| unordered_pair(X2,X3) != X0 ),
inference(equality_resolution,[],[f25]) ).
fof(f25,plain,
! [X2,X3,X0,X1] :
( X1 != X3
| in(X3,X0)
| unordered_pair(X2,X1) != X0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( unordered_pair(X2,X1) = X0
<=> ! [X3] :
( in(X3,X0)
<=> ( X1 = X3
| X2 = X3 ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X2,X1,X0] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( ( X1 = X3
| X0 = X3 )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f119,plain,
! [X9] :
( ~ in(X9,sF9)
| ~ in(X9,sK2)
| in(X9,sF8) ),
inference(superposition,[],[f52,f74]) ).
fof(f74,plain,
set_intersection2(sK2,sF9) = sF8,
inference(superposition,[],[f60,f36]) ).
fof(f36,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f60,plain,
sF8 = set_intersection2(sF9,sK2),
inference(forward_demodulation,[],[f58,f59]) ).
fof(f59,plain,
sF8 = sF10,
inference(definition_folding,[],[f28,f58,f57,f56]) ).
fof(f28,plain,
singleton(sK1) = set_intersection2(unordered_pair(sK1,sK3),sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f58,plain,
set_intersection2(sF9,sK2) = sF10,
introduced(function_definition,[]) ).
fof(f52,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ in(X3,X0)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f29]) ).
fof(f29,plain,
! [X2,X3,X0,X1] :
( set_intersection2(X0,X1) != X2
| in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X2,X1] :
( ! [X3] :
( ( in(X3,X0)
& in(X3,X1) )
<=> in(X3,X2) )
<=> set_intersection2(X0,X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET918+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/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 : n022.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:31:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (17317)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.49 % (17313)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.49 % (17292)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.20/0.49 % (17304)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 % (17292)First to succeed.
% 0.20/0.50 % (17296)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50 % (17299)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50 % (17309)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.50 % (17292)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (17292)------------------------------
% 0.20/0.50 % (17292)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (17292)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (17292)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (17292)Memory used [KB]: 5500
% 0.20/0.50 % (17292)Time elapsed: 0.104 s
% 0.20/0.50 % (17292)Instructions burned: 5 (million)
% 0.20/0.50 % (17292)------------------------------
% 0.20/0.50 % (17292)------------------------------
% 0.20/0.50 % (17285)Success in time 0.156 s
%------------------------------------------------------------------------------