TSTP Solution File: SEU128+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU128+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue May 21 03:53:06 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 146 ( 5 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 164 ( 58 ~; 52 |; 40 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 98 ( 83 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f679,plain,
$false,
inference(unit_resulting_resolution,[],[f321,f120,f74,f64]) ).
fof(f64,plain,
! [X2,X0,X1,X4] :
( ~ sP1(X0,X1,X2)
| ~ sP0(X1,X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ( ( ~ sP0(X1,sK6(X0,X1,X2),X0)
| ~ in(sK6(X0,X1,X2),X2) )
& ( sP0(X1,sK6(X0,X1,X2),X0)
| in(sK6(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ sP0(X1,X4,X0) )
& ( sP0(X1,X4,X0)
| ~ in(X4,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f37,f38]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ sP0(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP0(X1,X3,X0)
| in(X3,X2) ) )
=> ( ( ~ sP0(X1,sK6(X0,X1,X2),X0)
| ~ in(sK6(X0,X1,X2),X2) )
& ( sP0(X1,sK6(X0,X1,X2),X0)
| in(sK6(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ? [X3] :
( ( ~ sP0(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP0(X1,X3,X0)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ sP0(X1,X4,X0) )
& ( sP0(X1,X4,X0)
| ~ in(X4,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(rectify,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ? [X3] :
( ( ~ sP0(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP0(X1,X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ sP0(X1,X3,X0) )
& ( sP0(X1,X3,X0)
| ~ in(X3,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( sP1(X0,X1,X2)
<=> ! [X3] :
( in(X3,X2)
<=> sP0(X1,X3,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f74,plain,
! [X0,X1] : sP1(X0,X1,set_intersection2(X0,X1)),
inference(equality_resolution,[],[f70]) ).
fof(f70,plain,
! [X2,X0,X1] :
( sP1(X0,X1,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ~ sP1(X0,X1,X2) )
& ( sP1(X0,X1,X2)
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> sP1(X0,X1,X2) ),
inference(definition_folding,[],[f4,f28,f27]) ).
fof(f27,plain,
! [X1,X3,X0] :
( sP0(X1,X3,X0)
<=> ( in(X3,X1)
& in(X3,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f120,plain,
~ in(sK5(sK2,set_intersection2(sK3,sK4)),set_intersection2(sK3,sK4)),
inference(unit_resulting_resolution,[],[f50,f60]) ).
fof(f60,plain,
! [X0,X1] :
( ~ in(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK5(X0,X1),X1)
& in(sK5(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f33,f34]) ).
fof(f34,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK5(X0,X1),X1)
& in(sK5(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f50,plain,
~ subset(sK2,set_intersection2(sK3,sK4)),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( ~ subset(sK2,set_intersection2(sK3,sK4))
& subset(sK2,sK4)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f21,f30]) ).
fof(f30,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) )
=> ( ~ subset(sK2,set_intersection2(sK3,sK4))
& subset(sK2,sK4)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f321,plain,
sP0(sK4,sK5(sK2,set_intersection2(sK3,sK4)),sK3),
inference(unit_resulting_resolution,[],[f125,f126,f69]) ).
fof(f69,plain,
! [X2,X0,X1] :
( ~ in(X1,X0)
| sP0(X0,X1,X2)
| ~ in(X1,X2) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ~ in(X1,X0)
| ~ in(X1,X2) )
& ( ( in(X1,X0)
& in(X1,X2) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X1,X3,X0] :
( ( sP0(X1,X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ sP0(X1,X3,X0) ) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
! [X1,X3,X0] :
( ( sP0(X1,X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ sP0(X1,X3,X0) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f126,plain,
in(sK5(sK2,set_intersection2(sK3,sK4)),sK4),
inference(unit_resulting_resolution,[],[f110,f49,f58]) ).
fof(f58,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f49,plain,
subset(sK2,sK4),
inference(cnf_transformation,[],[f31]) ).
fof(f110,plain,
in(sK5(sK2,set_intersection2(sK3,sK4)),sK2),
inference(unit_resulting_resolution,[],[f50,f59]) ).
fof(f59,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK5(X0,X1),X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f125,plain,
in(sK5(sK2,set_intersection2(sK3,sK4)),sK3),
inference(unit_resulting_resolution,[],[f110,f48,f58]) ).
fof(f48,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU128+1 : TPTP v8.2.0. Released v3.3.0.
% 0.06/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 17:13:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % (16151)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (16158)WARNING: value z3 for option sas not known
% 0.15/0.37 % (16157)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.37 % (16159)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.37 % (16158)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.37 % (16160)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.37 % (16161)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.37 % (16162)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.37 TRYING [3]
% 0.15/0.38 TRYING [4]
% 0.15/0.38 % (16156)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (16162)First to succeed.
% 0.15/0.38 % (16162)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16151"
% 0.15/0.38 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 % (16162)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (16162)------------------------------
% 0.15/0.39 % (16162)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (16162)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (16162)Memory used [KB]: 924
% 0.15/0.39 % (16162)Time elapsed: 0.014 s
% 0.15/0.39 % (16162)Instructions burned: 22 (million)
% 0.15/0.39 % (16151)Success in time 0.028 s
%------------------------------------------------------------------------------