TSTP Solution File: SEU146+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU146+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 : n017.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:35 EDT 2024
% Result : Theorem 0.21s 0.42s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 58 ( 13 unt; 0 def)
% Number of atoms : 183 ( 82 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 205 ( 80 ~; 82 |; 31 &)
% ( 7 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 71 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1899,plain,
$false,
inference(subsumption_resolution,[],[f1896,f1871]) ).
fof(f1871,plain,
in(sK5,sK4),
inference(subsumption_resolution,[],[f1869,f310]) ).
fof(f310,plain,
empty_set != sK4,
inference(subsumption_resolution,[],[f295,f177]) ).
fof(f177,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f47]) ).
fof(f47,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f295,plain,
( empty_set != sK4
| ~ subset(empty_set,singleton(sK5)) ),
inference(inner_rewriting,[],[f175]) ).
fof(f175,plain,
( empty_set != sK4
| ~ subset(sK4,singleton(sK5)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
( ( ( sK4 != singleton(sK5)
& empty_set != sK4 )
| ~ subset(sK4,singleton(sK5)) )
& ( sK4 = singleton(sK5)
| empty_set = sK4
| subset(sK4,singleton(sK5)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f117,f118]) ).
fof(f118,plain,
( ? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) )
=> ( ( ( sK4 != singleton(sK5)
& empty_set != sK4 )
| ~ subset(sK4,singleton(sK5)) )
& ( sK4 = singleton(sK5)
| empty_set = sK4
| subset(sK4,singleton(sK5)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f116]) ).
fof(f116,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f76,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(negated_conjecture,[],[f32]) ).
fof(f32,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f1869,plain,
( in(sK5,sK4)
| empty_set = sK4 ),
inference(superposition,[],[f218,f1867]) ).
fof(f1867,plain,
sK5 = sK8(sK4),
inference(subsumption_resolution,[],[f1865,f310]) ).
fof(f1865,plain,
( sK5 = sK8(sK4)
| empty_set = sK4 ),
inference(resolution,[],[f1853,f218]) ).
fof(f1853,plain,
! [X0] :
( ~ in(X0,sK4)
| sK5 = X0 ),
inference(resolution,[],[f1850,f287]) ).
fof(f287,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f242]) ).
fof(f242,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK11(X0,X1) != X0
| ~ in(sK11(X0,X1),X1) )
& ( sK11(X0,X1) = X0
| in(sK11(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f143,f144]) ).
fof(f144,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK11(X0,X1) != X0
| ~ in(sK11(X0,X1),X1) )
& ( sK11(X0,X1) = X0
| in(sK11(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f142]) ).
fof(f142,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f1850,plain,
! [X0] :
( in(X0,singleton(sK5))
| ~ in(X0,sK4) ),
inference(resolution,[],[f1849,f198]) ).
fof(f198,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f1849,plain,
! [X0] :
( ~ subset(singleton(X0),sK4)
| in(X0,singleton(sK5)) ),
inference(resolution,[],[f1842,f197]) ).
fof(f197,plain,
! [X0,X1] :
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f1842,plain,
! [X0] :
( subset(X0,singleton(sK5))
| ~ subset(X0,sK4) ),
inference(resolution,[],[f208,f1080]) ).
fof(f1080,plain,
subset(sK4,singleton(sK5)),
inference(subsumption_resolution,[],[f1079,f310]) ).
fof(f1079,plain,
( empty_set = sK4
| subset(sK4,singleton(sK5)) ),
inference(subsumption_resolution,[],[f174,f309]) ).
fof(f309,plain,
sK4 != singleton(sK5),
inference(subsumption_resolution,[],[f294,f220]) ).
fof(f220,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f36]) ).
fof(f36,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f294,plain,
( sK4 != singleton(sK5)
| ~ subset(sK4,sK4) ),
inference(inner_rewriting,[],[f176]) ).
fof(f176,plain,
( sK4 != singleton(sK5)
| ~ subset(sK4,singleton(sK5)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f174,plain,
( sK4 = singleton(sK5)
| empty_set = sK4
| subset(sK4,singleton(sK5)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f90]) ).
fof(f90,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f218,plain,
! [X0] :
( in(sK8(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ( empty_set = X0
| in(sK8(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f129,f130]) ).
fof(f130,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK8(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f128]) ).
fof(f128,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f1896,plain,
~ in(sK5,sK4),
inference(resolution,[],[f1895,f198]) ).
fof(f1895,plain,
~ subset(singleton(sK5),sK4),
inference(subsumption_resolution,[],[f1892,f309]) ).
fof(f1892,plain,
( sK4 = singleton(sK5)
| ~ subset(singleton(sK5),sK4) ),
inference(resolution,[],[f235,f1080]) ).
fof(f235,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f135]) ).
fof(f135,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU146+2 : TPTP v8.1.2. Released v3.3.0.
% 0.14/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Apr 29 19:59:18 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.36 % (14611)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38 % (14614)WARNING: value z3 for option sas not known
% 0.21/0.38 % (14612)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38 % (14613)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38 % (14615)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38 % (14614)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.21/0.38 % (14616)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.21/0.38 % (14617)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.21/0.38 % (14618)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.21/0.38 TRYING [1]
% 0.21/0.39 TRYING [2]
% 0.21/0.39 TRYING [3]
% 0.21/0.40 TRYING [4]
% 0.21/0.41 TRYING [1]
% 0.21/0.41 TRYING [2]
% 0.21/0.42 % (14614)First to succeed.
% 0.21/0.42 % (14616)Also succeeded, but the first one will report.
% 0.21/0.42 % (14614)Refutation found. Thanks to Tanya!
% 0.21/0.42 % SZS status Theorem for theBenchmark
% 0.21/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.42 % (14614)------------------------------
% 0.21/0.42 % (14614)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.42 % (14614)Termination reason: Refutation
% 0.21/0.42
% 0.21/0.42 % (14614)Memory used [KB]: 1368
% 0.21/0.42 % (14614)Time elapsed: 0.043 s
% 0.21/0.42 % (14614)Instructions burned: 64 (million)
% 0.21/0.42 % (14614)------------------------------
% 0.21/0.42 % (14614)------------------------------
% 0.21/0.42 % (14611)Success in time 0.061 s
%------------------------------------------------------------------------------