TSTP Solution File: SEU114+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU114+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 : n018.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 Apr 30 15:22:14 EDT 2024
% Result : Theorem 16.38s 2.69s
% Output : Refutation 16.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 69 ( 21 unt; 0 def)
% Number of atoms : 214 ( 21 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 235 ( 90 ~; 82 |; 41 &)
% ( 12 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 123 ( 115 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f206950,plain,
$false,
inference(subsumption_resolution,[],[f206917,f206895]) ).
fof(f206895,plain,
subset(sK13(powerset(sK5),finite_subsets(sK5)),sK5),
inference(unit_resulting_resolution,[],[f52412,f177]) ).
fof(f177,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f32,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f52412,plain,
element(sK13(powerset(sK5),finite_subsets(sK5)),powerset(sK5)),
inference(unit_resulting_resolution,[],[f5650,f14736,f181]) ).
fof(f181,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| element(X0,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(flattening,[],[f68]) ).
fof(f68,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,axiom,
! [X0,X1,X2] :
( ( element(X1,powerset(X2))
& in(X0,X1) )
=> element(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(f14736,plain,
in(sK13(powerset(sK5),finite_subsets(sK5)),powerset(sK5)),
inference(unit_resulting_resolution,[],[f14701,f175]) ).
fof(f175,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK13(X0,X1),X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK13(X0,X1),X1)
& in(sK13(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f107,f108]) ).
fof(f108,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK13(X0,X1),X1)
& in(sK13(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f107,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,[],[f106]) ).
fof(f106,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,[],[f65]) ).
fof(f65,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f14701,plain,
~ subset(powerset(sK5),finite_subsets(sK5)),
inference(unit_resulting_resolution,[],[f120,f124,f173]) ).
fof(f173,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f124,plain,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_finsub_1) ).
fof(f120,plain,
powerset(sK5) != finite_subsets(sK5),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
( powerset(sK5) != finite_subsets(sK5)
& finite(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f47,f79]) ).
fof(f79,plain,
( ? [X0] :
( powerset(X0) != finite_subsets(X0)
& finite(X0) )
=> ( powerset(sK5) != finite_subsets(sK5)
& finite(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
? [X0] :
( powerset(X0) != finite_subsets(X0)
& finite(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X0] :
( finite(X0)
=> powerset(X0) = finite_subsets(X0) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X0] :
( finite(X0)
=> powerset(X0) = finite_subsets(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t27_finsub_1) ).
fof(f5650,plain,
! [X0] : element(X0,powerset(X0)),
inference(unit_resulting_resolution,[],[f155,f178]) ).
fof(f178,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f110]) ).
fof(f155,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f25]) ).
fof(f25,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f206917,plain,
~ subset(sK13(powerset(sK5),finite_subsets(sK5)),sK5),
inference(unit_resulting_resolution,[],[f49851,f206894,f164]) ).
fof(f164,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ finite(X0)
| sP2(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0,X1] :
( ( sP2(X0,X1)
| ~ finite(X0)
| ~ subset(X0,X1) )
& ( ( finite(X0)
& subset(X0,X1) )
| ~ sP2(X0,X1) ) ),
inference(rectify,[],[f102]) ).
fof(f102,plain,
! [X2,X0] :
( ( sP2(X2,X0)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ sP2(X2,X0) ) ),
inference(flattening,[],[f101]) ).
fof(f101,plain,
! [X2,X0] :
( ( sP2(X2,X0)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ sP2(X2,X0) ) ),
inference(nnf_transformation,[],[f75]) ).
fof(f75,plain,
! [X2,X0] :
( sP2(X2,X0)
<=> ( finite(X2)
& subset(X2,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f206894,plain,
finite(sK13(powerset(sK5),finite_subsets(sK5))),
inference(unit_resulting_resolution,[],[f119,f52412,f147]) ).
fof(f147,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f119,plain,
finite(sK5),
inference(cnf_transformation,[],[f80]) ).
fof(f49851,plain,
~ sP2(sK13(powerset(sK5),finite_subsets(sK5)),sK5),
inference(unit_resulting_resolution,[],[f11425,f14735,f159]) ).
fof(f159,plain,
! [X3,X0,X1] :
( ~ sP3(X0,X1)
| ~ sP2(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ( ( ~ sP2(sK12(X0,X1),X0)
| ~ in(sK12(X0,X1),X1) )
& ( sP2(sK12(X0,X1),X0)
| in(sK12(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,[sK12])],[f98,f99]) ).
fof(f99,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ sP2(X2,X0)
| ~ in(X2,X1) )
& ( sP2(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ sP2(sK12(X0,X1),X0)
| ~ in(sK12(X0,X1),X1) )
& ( sP2(sK12(X0,X1),X0)
| in(sK12(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f98,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,[],[f97]) ).
fof(f97,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,[],[f76]) ).
fof(f76,plain,
! [X0,X1] :
( sP3(X0,X1)
<=> ! [X2] :
( in(X2,X1)
<=> sP2(X2,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f14735,plain,
~ in(sK13(powerset(sK5),finite_subsets(sK5)),finite_subsets(sK5)),
inference(unit_resulting_resolution,[],[f14701,f176]) ).
fof(f176,plain,
! [X0,X1] :
( ~ in(sK13(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f11425,plain,
! [X0] : sP3(X0,finite_subsets(X0)),
inference(unit_resulting_resolution,[],[f742,f191]) ).
fof(f191,plain,
! [X1] :
( ~ sP4(finite_subsets(X1),X1)
| sP3(X1,finite_subsets(X1)) ),
inference(equality_resolution,[],[f156]) ).
fof(f156,plain,
! [X0,X1] :
( sP3(X1,X0)
| finite_subsets(X1) != X0
| ~ sP4(X0,X1) ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
! [X0,X1] :
( ( ( finite_subsets(X1) = X0
| ~ sP3(X1,X0) )
& ( sP3(X1,X0)
| finite_subsets(X1) != X0 ) )
| ~ sP4(X0,X1) ),
inference(rectify,[],[f95]) ).
fof(f95,plain,
! [X1,X0] :
( ( ( finite_subsets(X0) = X1
| ~ sP3(X0,X1) )
& ( sP3(X0,X1)
| finite_subsets(X0) != X1 ) )
| ~ sP4(X1,X0) ),
inference(nnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X1,X0] :
( ( finite_subsets(X0) = X1
<=> sP3(X0,X1) )
| ~ sP4(X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f742,plain,
! [X0,X1] : sP4(finite_subsets(X0),X1),
inference(unit_resulting_resolution,[],[f123,f165]) ).
fof(f165,plain,
! [X0,X1] :
( ~ preboolean(X1)
| sP4(X1,X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0,X1] :
( sP4(X1,X0)
| ~ preboolean(X1) ),
inference(definition_folding,[],[f57,f77,f76,f75]) ).
fof(f57,plain,
! [X0,X1] :
( ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,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(f123,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU114+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n018.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 : Mon Apr 29 21:10:43 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (30831)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (30835)WARNING: value z3 for option sas not known
% 0.15/0.38 % (30833)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (30836)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (30834)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (30837)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.38 % (30838)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.38 % (30835)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.38 % (30839)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.38 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.40 TRYING [5]
% 0.22/0.40 TRYING [3]
% 0.22/0.41 TRYING [6]
% 0.22/0.43 TRYING [4]
% 0.22/0.44 TRYING [7]
% 0.22/0.47 TRYING [8]
% 0.22/0.47 TRYING [5]
% 0.22/0.51 TRYING [9]
% 0.22/0.51 TRYING [1]
% 0.22/0.51 TRYING [2]
% 0.22/0.51 TRYING [3]
% 0.22/0.51 TRYING [4]
% 0.22/0.52 TRYING [5]
% 0.22/0.53 TRYING [6]
% 0.22/0.55 TRYING [6]
% 0.22/0.55 TRYING [7]
% 0.22/0.56 TRYING [10]
% 0.22/0.60 TRYING [8]
% 1.89/0.62 TRYING [11]
% 2.52/0.72 TRYING [12]
% 2.52/0.77 TRYING [9]
% 3.02/0.83 TRYING [7]
% 3.02/0.86 TRYING [13]
% 4.63/1.02 TRYING [14]
% 6.20/1.25 TRYING [15]
% 6.20/1.26 TRYING [8]
% 6.86/1.33 TRYING [10]
% 8.13/1.53 TRYING [16]
% 9.44/1.73 TRYING [9]
% 10.44/1.89 TRYING [17]
% 13.07/2.26 TRYING [10]
% 13.63/2.29 TRYING [18]
% 16.38/2.68 % (30839)First to succeed.
% 16.38/2.69 % (30839)Refutation found. Thanks to Tanya!
% 16.38/2.69 % SZS status Theorem for theBenchmark
% 16.38/2.69 % SZS output start Proof for theBenchmark
% See solution above
% 16.38/2.69 % (30839)------------------------------
% 16.38/2.69 % (30839)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 16.38/2.69 % (30839)Termination reason: Refutation
% 16.38/2.69
% 16.38/2.69 % (30839)Memory used [KB]: 51318
% 16.38/2.69 % (30839)Time elapsed: 2.305 s
% 16.38/2.69 % (30839)Instructions burned: 7244 (million)
% 16.38/2.69 % (30839)------------------------------
% 16.38/2.69 % (30839)------------------------------
% 16.38/2.69 % (30831)Success in time 2.318 s
%------------------------------------------------------------------------------