TSTP Solution File: SEU173+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU173+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 : n002.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:28:01 EDT 2024
% Result : Theorem 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 134 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 160 ( 61 ~; 53 |; 28 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 61 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1686,plain,
$false,
inference(resolution,[],[f1684,f1500]) ).
fof(f1500,plain,
~ subset(sK6,sK7),
inference(resolution,[],[f1493,f500]) ).
fof(f500,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f439]) ).
fof(f439,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f260]) ).
fof(f260,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK22(X0,X1),X0)
| ~ in(sK22(X0,X1),X1) )
& ( subset(sK22(X0,X1),X0)
| in(sK22(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22])],[f258,f259]) ).
fof(f259,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK22(X0,X1),X0)
| ~ in(sK22(X0,X1),X1) )
& ( subset(sK22(X0,X1),X0)
| in(sK22(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f258,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f257]) ).
fof(f257,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f1493,plain,
~ in(sK6,powerset(sK7)),
inference(resolution,[],[f1487,f381]) ).
fof(f381,plain,
! [X0] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
! [X0] : ~ empty(powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f1487,plain,
( empty(powerset(sK7))
| ~ in(sK6,powerset(sK7)) ),
inference(resolution,[],[f408,f301]) ).
fof(f301,plain,
~ element(sK6,powerset(sK7)),
inference(cnf_transformation,[],[f200]) ).
fof(f200,plain,
( ~ element(sK6,powerset(sK7))
& ! [X2] :
( in(X2,sK7)
| ~ in(X2,sK6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f126,f199]) ).
fof(f199,plain,
( ? [X0,X1] :
( ~ element(X0,powerset(X1))
& ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) )
=> ( ~ element(sK6,powerset(sK7))
& ! [X2] :
( in(X2,sK7)
| ~ in(X2,sK6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
? [X0,X1] :
( ~ element(X0,powerset(X1))
& ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f56]) ).
fof(f56,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
inference(negated_conjecture,[],[f55]) ).
fof(f55,conjecture,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l71_subset_1) ).
fof(f408,plain,
! [X0,X1] :
( element(X1,X0)
| ~ in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f239]) ).
fof(f239,plain,
! [X0,X1] :
( ( ( ( element(X1,X0)
| ~ empty(X1) )
& ( empty(X1)
| ~ element(X1,X0) ) )
| ~ empty(X0) )
& ( ( ( element(X1,X0)
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ element(X1,X0) ) )
| empty(X0) ) ),
inference(nnf_transformation,[],[f172]) ).
fof(f172,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) )
& ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( ( empty(X0)
=> ( element(X1,X0)
<=> empty(X1) ) )
& ( ~ empty(X0)
=> ( element(X1,X0)
<=> in(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f1684,plain,
subset(sK6,sK7),
inference(resolution,[],[f1682,f428]) ).
fof(f428,plain,
! [X0,X1] :
( in(sK18(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f249]) ).
fof(f249,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK18(X0,X1),X1)
& in(sK18(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18])],[f247,f248]) ).
fof(f248,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK18(X0,X1),X1)
& in(sK18(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f247,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,[],[f246]) ).
fof(f246,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,[],[f184]) ).
fof(f184,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f1682,plain,
~ in(sK18(sK6,sK7),sK6),
inference(resolution,[],[f1681,f300]) ).
fof(f300,plain,
! [X2] :
( in(X2,sK7)
| ~ in(X2,sK6) ),
inference(cnf_transformation,[],[f200]) ).
fof(f1681,plain,
~ in(sK18(sK6,sK7),sK7),
inference(resolution,[],[f429,f1500]) ).
fof(f429,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK18(X0,X1),X1) ),
inference(cnf_transformation,[],[f249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU173+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34 % Computer : n002.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 11:48:42 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % (2006)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.36 % (2019)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.36 % (2018)WARNING: value z3 for option sas not known
% 0.14/0.36 % (2017)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (2018)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.37 % (2021)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.37 % (2020)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.37 % (2022)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.37 % (2016)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.37 TRYING [1]
% 0.20/0.37 TRYING [2]
% 0.20/0.38 TRYING [3]
% 0.20/0.41 % (2021)First to succeed.
% 0.20/0.41 % (2021)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2006"
% 0.20/0.41 % (2018)Also succeeded, but the first one will report.
% 0.20/0.41 % (2021)Refutation found. Thanks to Tanya!
% 0.20/0.41 % SZS status Theorem for theBenchmark
% 0.20/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.41 % (2021)------------------------------
% 0.20/0.41 % (2021)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.41 % (2021)Termination reason: Refutation
% 0.20/0.41
% 0.20/0.41 % (2021)Memory used [KB]: 1521
% 0.20/0.41 % (2021)Time elapsed: 0.048 s
% 0.20/0.41 % (2021)Instructions burned: 69 (million)
% 0.20/0.41 % (2006)Success in time 0.067 s
%------------------------------------------------------------------------------