TSTP Solution File: SEU146+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU146+1 : 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 : n024.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:23 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 14 unt; 0 def)
% Number of atoms : 125 ( 51 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 127 ( 49 ~; 52 |; 17 &)
% ( 5 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 46 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f101,plain,
$false,
inference(subsumption_resolution,[],[f98,f58]) ).
fof(f58,plain,
empty_set != sK0,
inference(subsumption_resolution,[],[f56,f39]) ).
fof(f39,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f56,plain,
( empty_set != sK0
| ~ subset(empty_set,singleton(sK1)) ),
inference(inner_rewriting,[],[f36]) ).
fof(f36,plain,
( empty_set != sK0
| ~ subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
( ( ( sK0 != singleton(sK1)
& empty_set != sK0 )
| ~ subset(sK0,singleton(sK1)) )
& ( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f24,f25]) ).
fof(f25,plain,
( ? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) )
=> ( ( ( sK0 != singleton(sK1)
& empty_set != sK0 )
| ~ subset(sK0,singleton(sK1)) )
& ( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,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,[],[f23]) ).
fof(f23,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,[],[f18]) ).
fof(f18,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f98,plain,
empty_set = sK0,
inference(resolution,[],[f97,f40]) ).
fof(f40,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0] :
( empty_set = X0
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( subset(X0,empty_set)
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f97,plain,
subset(sK0,empty_set),
inference(subsumption_resolution,[],[f95,f82]) ).
fof(f82,plain,
~ in(sK1,sK0),
inference(resolution,[],[f81,f47]) ).
fof(f47,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f81,plain,
~ subset(singleton(sK1),sK0),
inference(subsumption_resolution,[],[f80,f57]) ).
fof(f57,plain,
sK0 != singleton(sK1),
inference(subsumption_resolution,[],[f55,f41]) ).
fof(f41,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f55,plain,
( sK0 != singleton(sK1)
| ~ subset(sK0,sK0) ),
inference(inner_rewriting,[],[f37]) ).
fof(f37,plain,
( sK0 != singleton(sK1)
| ~ subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f26]) ).
fof(f80,plain,
( sK0 = singleton(sK1)
| ~ subset(singleton(sK1),sK0) ),
inference(resolution,[],[f45,f73]) ).
fof(f73,plain,
subset(sK0,singleton(sK1)),
inference(subsumption_resolution,[],[f72,f58]) ).
fof(f72,plain,
( empty_set = sK0
| subset(sK0,singleton(sK1)) ),
inference(subsumption_resolution,[],[f35,f57]) ).
fof(f35,plain,
( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f26]) ).
fof(f45,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f95,plain,
( in(sK1,sK0)
| subset(sK0,empty_set) ),
inference(resolution,[],[f91,f41]) ).
fof(f91,plain,
! [X0] :
( ~ subset(X0,sK0)
| in(sK1,X0)
| subset(X0,empty_set) ),
inference(superposition,[],[f50,f74]) ).
fof(f74,plain,
empty_set = set_difference(sK0,singleton(sK1)),
inference(resolution,[],[f73,f49]) ).
fof(f49,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| empty_set = set_difference(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f50,plain,
! [X2,X0,X1] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU146+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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 : Fri May 3 10:55:50 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (2938)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (2941)WARNING: value z3 for option sas not known
% 0.14/0.38 % (2939)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (2942)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (2940)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (2941)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.38 % (2944)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.38 % (2943)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.38 % (2945)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.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [4]
% 0.14/0.38 TRYING [2]
% 0.14/0.39 TRYING [1]
% 0.14/0.39 % (2941)First to succeed.
% 0.14/0.39 TRYING [2]
% 0.14/0.39 % (2945)Also succeeded, but the first one will report.
% 0.14/0.39 TRYING [3]
% 0.14/0.39 % (2941)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2938"
% 0.14/0.39 TRYING [5]
% 0.14/0.39 TRYING [4]
% 0.14/0.39 % (2941)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (2941)------------------------------
% 0.14/0.39 % (2941)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.39 % (2941)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (2941)Memory used [KB]: 768
% 0.14/0.39 % (2941)Time elapsed: 0.007 s
% 0.14/0.39 % (2941)Instructions burned: 6 (million)
% 0.14/0.39 % (2938)Success in time 0.022 s
%------------------------------------------------------------------------------