TSTP Solution File: SEU125+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU125+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n013.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 : Sun May 5 09:27:06 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : Refutation 0.22s
% 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 : 166 ( 60 ~; 54 |; 38 &)
% ( 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(f7292,plain,
$false,
inference(unit_resulting_resolution,[],[f4654,f415,f157,f142]) ).
fof(f142,plain,
! [X2,X0,X1,X4] :
( ~ sP3(X0,X1,X2)
| ~ in(X4,X2)
| sP2(X1,X4,X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ( sP3(X0,X1,X2)
| ( ( ~ sP2(X1,sK12(X0,X1,X2),X0)
| ~ in(sK12(X0,X1,X2),X2) )
& ( sP2(X1,sK12(X0,X1,X2),X0)
| in(sK12(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ sP2(X1,X4,X0) )
& ( sP2(X1,X4,X0)
| ~ in(X4,X2) ) )
| ~ sP3(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f86,f87]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ sP2(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP2(X1,X3,X0)
| in(X3,X2) ) )
=> ( ( ~ sP2(X1,sK12(X0,X1,X2),X0)
| ~ in(sK12(X0,X1,X2),X2) )
& ( sP2(X1,sK12(X0,X1,X2),X0)
| in(sK12(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ( sP3(X0,X1,X2)
| ? [X3] :
( ( ~ sP2(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP2(X1,X3,X0)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ sP2(X1,X4,X0) )
& ( sP2(X1,X4,X0)
| ~ in(X4,X2) ) )
| ~ sP3(X0,X1,X2) ) ),
inference(rectify,[],[f85]) ).
fof(f85,plain,
! [X0,X1,X2] :
( ( sP3(X0,X1,X2)
| ? [X3] :
( ( ~ sP2(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP2(X1,X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ sP2(X1,X3,X0) )
& ( sP2(X1,X3,X0)
| ~ in(X3,X2) ) )
| ~ sP3(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0,X1,X2] :
( sP3(X0,X1,X2)
<=> ! [X3] :
( in(X3,X2)
<=> sP2(X1,X3,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f157,plain,
! [X0,X1] : sP3(X0,X1,set_union2(X0,X1)),
inference(equality_resolution,[],[f149]) ).
fof(f149,plain,
! [X2,X0,X1] :
( sP3(X0,X1,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f92]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ~ sP3(X0,X1,X2) )
& ( sP3(X0,X1,X2)
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> sP3(X0,X1,X2) ),
inference(definition_folding,[],[f6,f58,f57]) ).
fof(f57,plain,
! [X1,X3,X0] :
( sP2(X1,X3,X0)
<=> ( in(X3,X1)
| in(X3,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f415,plain,
in(sK10(set_union2(sK4,sK6),sK5),set_union2(sK4,sK6)),
inference(unit_resulting_resolution,[],[f99,f129]) ).
fof(f129,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK10(X0,X1),X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK10(X0,X1),X1)
& in(sK10(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f74,f75]) ).
fof(f75,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK10(X0,X1),X1)
& in(sK10(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f74,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,[],[f73]) ).
fof(f73,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,[],[f51]) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f99,plain,
~ subset(set_union2(sK4,sK6),sK5),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
( ~ subset(set_union2(sK4,sK6),sK5)
& subset(sK6,sK5)
& subset(sK4,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f40,f60]) ).
fof(f60,plain,
( ? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) )
=> ( ~ subset(set_union2(sK4,sK6),sK5)
& subset(sK6,sK5)
& subset(sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
inference(negated_conjecture,[],[f32]) ).
fof(f32,conjecture,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(f4654,plain,
~ sP2(sK6,sK10(set_union2(sK4,sK6),sK5),sK4),
inference(unit_resulting_resolution,[],[f2117,f2114,f146]) ).
fof(f146,plain,
! [X2,X0,X1] :
( ~ sP2(X0,X1,X2)
| in(X1,X2)
| in(X1,X0) ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| ( ~ in(X1,X0)
& ~ in(X1,X2) ) )
& ( in(X1,X0)
| in(X1,X2)
| ~ sP2(X0,X1,X2) ) ),
inference(rectify,[],[f90]) ).
fof(f90,plain,
! [X1,X3,X0] :
( ( sP2(X1,X3,X0)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ sP2(X1,X3,X0) ) ),
inference(flattening,[],[f89]) ).
fof(f89,plain,
! [X1,X3,X0] :
( ( sP2(X1,X3,X0)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ sP2(X1,X3,X0) ) ),
inference(nnf_transformation,[],[f57]) ).
fof(f2114,plain,
~ in(sK10(set_union2(sK4,sK6),sK5),sK4),
inference(unit_resulting_resolution,[],[f423,f97,f128]) ).
fof(f128,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f97,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f61]) ).
fof(f423,plain,
~ in(sK10(set_union2(sK4,sK6),sK5),sK5),
inference(unit_resulting_resolution,[],[f99,f130]) ).
fof(f130,plain,
! [X0,X1] :
( ~ in(sK10(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f2117,plain,
~ in(sK10(set_union2(sK4,sK6),sK5),sK6),
inference(unit_resulting_resolution,[],[f423,f98,f128]) ).
fof(f98,plain,
subset(sK6,sK5),
inference(cnf_transformation,[],[f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU125+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 10:54:49 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (2881)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38 % (2884)WARNING: value z3 for option sas not known
% 0.22/0.38 % (2882)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.38 % (2885)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.38 % (2886)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.22/0.38 % (2887)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.22/0.38 % (2884)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.22/0.38 % (2888)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.22/0.38 % (2883)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.39 TRYING [1]
% 0.22/0.39 TRYING [2]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [1]
% 0.22/0.40 TRYING [4]
% 0.22/0.40 TRYING [2]
% 0.22/0.42 TRYING [5]
% 0.22/0.42 TRYING [3]
% 0.22/0.47 TRYING [6]
% 0.22/0.48 TRYING [4]
% 0.22/0.51 % (2888)First to succeed.
% 0.22/0.51 % (2888)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2881"
% 0.22/0.51 % (2888)Refutation found. Thanks to Tanya!
% 0.22/0.51 % SZS status Theorem for theBenchmark
% 0.22/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.51 % (2888)------------------------------
% 0.22/0.51 % (2888)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.51 % (2888)Termination reason: Refutation
% 0.22/0.51
% 0.22/0.51 % (2888)Memory used [KB]: 2232
% 0.22/0.51 % (2888)Time elapsed: 0.126 s
% 0.22/0.51 % (2888)Instructions burned: 276 (million)
% 0.22/0.51 % (2881)Success in time 0.131 s
%------------------------------------------------------------------------------