TSTP Solution File: SEU110+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU110+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n027.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:02 EDT 2024
% Result : Theorem 3.89s 0.94s
% Output : Refutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 55 ( 15 unt; 0 def)
% Number of atoms : 178 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 200 ( 77 ~; 70 |; 35 &)
% ( 10 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 105 ( 95 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f58232,plain,
$false,
inference(subsumption_resolution,[],[f58210,f58047]) ).
fof(f58047,plain,
~ subset(sK14(finite_subsets(sK5),finite_subsets(sK6)),sK6),
inference(unit_resulting_resolution,[],[f58019,f28135,f159]) ).
fof(f159,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ finite(X0)
| sP2(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1] :
( ( sP2(X0,X1)
| ~ finite(X0)
| ~ subset(X0,X1) )
& ( ( finite(X0)
& subset(X0,X1) )
| ~ sP2(X0,X1) ) ),
inference(rectify,[],[f100]) ).
fof(f100,plain,
! [X2,X0] :
( ( sP2(X2,X0)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ sP2(X2,X0) ) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
! [X2,X0] :
( ( sP2(X2,X0)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ sP2(X2,X0) ) ),
inference(nnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X2,X0] :
( sP2(X2,X0)
<=> ( finite(X2)
& subset(X2,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f28135,plain,
~ sP2(sK14(finite_subsets(sK5),finite_subsets(sK6)),sK6),
inference(unit_resulting_resolution,[],[f10002,f10001,f154]) ).
fof(f154,plain,
! [X3,X0,X1] :
( ~ sP3(X0,X1)
| ~ sP2(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ( ( ~ sP2(sK13(X0,X1),X0)
| ~ in(sK13(X0,X1),X1) )
& ( sP2(sK13(X0,X1),X0)
| in(sK13(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ sP2(X3,X0) )
& ( sP2(X3,X0)
| ~ in(X3,X1) ) )
| ~ sP3(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f96,f97]) ).
fof(f97,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ sP2(X2,X0)
| ~ in(X2,X1) )
& ( sP2(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ sP2(sK13(X0,X1),X0)
| ~ in(sK13(X0,X1),X1) )
& ( sP2(sK13(X0,X1),X0)
| in(sK13(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f96,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ? [X2] :
( ( ~ sP2(X2,X0)
| ~ in(X2,X1) )
& ( sP2(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ sP2(X3,X0) )
& ( sP2(X3,X0)
| ~ in(X3,X1) ) )
| ~ sP3(X0,X1) ) ),
inference(rectify,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ? [X2] :
( ( ~ sP2(X2,X0)
| ~ in(X2,X1) )
& ( sP2(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ sP2(X2,X0) )
& ( sP2(X2,X0)
| ~ in(X2,X1) ) )
| ~ sP3(X0,X1) ) ),
inference(nnf_transformation,[],[f74]) ).
fof(f74,plain,
! [X0,X1] :
( sP3(X0,X1)
<=> ! [X2] :
( in(X2,X1)
<=> sP2(X2,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f10001,plain,
~ in(sK14(finite_subsets(sK5),finite_subsets(sK6)),finite_subsets(sK6)),
inference(unit_resulting_resolution,[],[f116,f167]) ).
fof(f167,plain,
! [X0,X1] :
( ~ in(sK14(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK14(X0,X1),X1)
& in(sK14(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f103,f104]) ).
fof(f104,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK14(X0,X1),X1)
& in(sK14(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f103,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,[],[f102]) ).
fof(f102,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,[],[f61]) ).
fof(f61,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(f116,plain,
~ subset(finite_subsets(sK5),finite_subsets(sK6)),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
( ~ subset(finite_subsets(sK5),finite_subsets(sK6))
& subset(sK5,sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f45,f77]) ).
fof(f77,plain,
( ? [X0,X1] :
( ~ subset(finite_subsets(X0),finite_subsets(X1))
& subset(X0,X1) )
=> ( ~ subset(finite_subsets(sK5),finite_subsets(sK6))
& subset(sK5,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
? [X0,X1] :
( ~ subset(finite_subsets(X0),finite_subsets(X1))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
inference(negated_conjecture,[],[f27]) ).
fof(f27,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_finsub_1) ).
fof(f10002,plain,
! [X0] : sP3(X0,finite_subsets(X0)),
inference(unit_resulting_resolution,[],[f732,f183]) ).
fof(f183,plain,
! [X1] :
( ~ sP4(finite_subsets(X1),X1)
| sP3(X1,finite_subsets(X1)) ),
inference(equality_resolution,[],[f151]) ).
fof(f151,plain,
! [X0,X1] :
( sP3(X1,X0)
| finite_subsets(X1) != X0
| ~ sP4(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f94,plain,
! [X0,X1] :
( ( ( finite_subsets(X1) = X0
| ~ sP3(X1,X0) )
& ( sP3(X1,X0)
| finite_subsets(X1) != X0 ) )
| ~ sP4(X0,X1) ),
inference(rectify,[],[f93]) ).
fof(f93,plain,
! [X1,X0] :
( ( ( finite_subsets(X0) = X1
| ~ sP3(X0,X1) )
& ( sP3(X0,X1)
| finite_subsets(X0) != X1 ) )
| ~ sP4(X1,X0) ),
inference(nnf_transformation,[],[f75]) ).
fof(f75,plain,
! [X1,X0] :
( ( finite_subsets(X0) = X1
<=> sP3(X0,X1) )
| ~ sP4(X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f732,plain,
! [X0,X1] : sP4(finite_subsets(X0),X1),
inference(unit_resulting_resolution,[],[f119,f160]) ).
fof(f160,plain,
! [X0,X1] :
( ~ preboolean(X1)
| sP4(X1,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
! [X0,X1] :
( sP4(X1,X0)
| ~ preboolean(X1) ),
inference(definition_folding,[],[f55,f75,f74,f73]) ).
fof(f55,plain,
! [X0,X1] :
( ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f119,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f58019,plain,
finite(sK14(finite_subsets(sK5),finite_subsets(sK6))),
inference(unit_resulting_resolution,[],[f27722,f158]) ).
fof(f158,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| finite(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f27722,plain,
sP2(sK14(finite_subsets(sK5),finite_subsets(sK6)),sK5),
inference(unit_resulting_resolution,[],[f10002,f9996,f153]) ).
fof(f153,plain,
! [X3,X0,X1] :
( ~ sP3(X0,X1)
| ~ in(X3,X1)
| sP2(X3,X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f9996,plain,
in(sK14(finite_subsets(sK5),finite_subsets(sK6)),finite_subsets(sK5)),
inference(unit_resulting_resolution,[],[f116,f166]) ).
fof(f166,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK14(X0,X1),X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f58210,plain,
subset(sK14(finite_subsets(sK5),finite_subsets(sK6)),sK6),
inference(unit_resulting_resolution,[],[f115,f58018,f173]) ).
fof(f173,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f66]) ).
fof(f66,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f58018,plain,
subset(sK14(finite_subsets(sK5),finite_subsets(sK6)),sK5),
inference(unit_resulting_resolution,[],[f27722,f157]) ).
fof(f157,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f115,plain,
subset(sK5,sK6),
inference(cnf_transformation,[],[f78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SEU110+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.37 % Computer : n027.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Fri May 3 11:55:06 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 % (13948)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.39 % (13950)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.39 % (13951)WARNING: value z3 for option sas not known
% 0.14/0.39 % (13953)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.14/0.39 % (13951)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.14/0.40 % (13955)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.14/0.40 % (13952)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.41 TRYING [1]
% 0.14/0.41 TRYING [2]
% 0.14/0.41 TRYING [3]
% 0.14/0.41 % (13954)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.14/0.41 TRYING [4]
% 0.14/0.41 % (13949)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.42 TRYING [1]
% 0.14/0.42 TRYING [2]
% 0.14/0.42 TRYING [3]
% 0.14/0.42 TRYING [1]
% 0.14/0.42 TRYING [4]
% 0.14/0.42 TRYING [2]
% 0.14/0.43 TRYING [5]
% 0.21/0.43 TRYING [5]
% 0.21/0.44 TRYING [3]
% 0.21/0.45 TRYING [6]
% 0.21/0.45 TRYING [6]
% 0.21/0.46 TRYING [4]
% 0.21/0.47 TRYING [7]
% 0.21/0.48 TRYING [7]
% 0.21/0.50 TRYING [5]
% 1.24/0.57 TRYING [8]
% 1.39/0.59 TRYING [6]
% 1.39/0.60 TRYING [8]
% 3.89/0.93 % (13955)First to succeed.
% 3.89/0.93 % (13955)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13948"
% 3.89/0.94 % (13955)Refutation found. Thanks to Tanya!
% 3.89/0.94 % SZS status Theorem for theBenchmark
% 3.89/0.94 % SZS output start Proof for theBenchmark
% See solution above
% 3.89/0.94 % (13955)------------------------------
% 3.89/0.94 % (13955)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 3.89/0.94 % (13955)Termination reason: Refutation
% 3.89/0.94
% 3.89/0.94 % (13955)Memory used [KB]: 12917
% 3.89/0.94 % (13955)Time elapsed: 0.528 s
% 3.89/0.94 % (13955)Instructions burned: 1646 (million)
% 3.89/0.94 % (13948)Success in time 0.561 s
%------------------------------------------------------------------------------