TSTP Solution File: SET583+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET583+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n013.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 May 21 03:19:25 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 46 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 47 ( 17 ~; 9 |; 17 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 18 ( 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f35,plain,
$false,
inference(subsumption_resolution,[],[f34,f18]) ).
fof(f18,plain,
subset(sK1,sK0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
( sK0 != sK1
& subset(sK1,sK0)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9]) ).
fof(f9,plain,
( ? [X0,X1] :
( X0 != X1
& subset(X1,X0)
& subset(X0,X1) )
=> ( sK0 != sK1
& subset(sK1,sK0)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1] :
( X0 != X1
& subset(X1,X0)
& subset(X0,X1) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
? [X0,X1] :
( X0 != X1
& subset(X1,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_extensionality) ).
fof(f34,plain,
~ subset(sK1,sK0),
inference(subsumption_resolution,[],[f31,f19]) ).
fof(f19,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f10]) ).
fof(f31,plain,
( sK0 = sK1
| ~ subset(sK1,sK0) ),
inference(resolution,[],[f23,f17]) ).
fof(f17,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f10]) ).
fof(f23,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SET583+3 : TPTP v8.2.0. Released v2.2.0.
% 0.13/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.37 % Computer : n013.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 11:06:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 % (27275)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38 % (27278)WARNING: value z3 for option sas not known
% 0.16/0.39 % (27278)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.16/0.39 % (27276)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.39 % (27279)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.39 % (27277)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.39 % (27280)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.16/0.39 % (27281)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.16/0.39 % (27282)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.16/0.39 % (27278)First to succeed.
% 0.16/0.39 TRYING [1]
% 0.16/0.39 % (27278)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27275"
% 0.16/0.39 TRYING [2]
% 0.16/0.39 % (27279)Also succeeded, but the first one will report.
% 0.16/0.39 TRYING [1]
% 0.16/0.39 % (27282)Also succeeded, but the first one will report.
% 0.16/0.39 TRYING [2]
% 0.16/0.39 % (27281)Also succeeded, but the first one will report.
% 0.16/0.39 % (27280)Also succeeded, but the first one will report.
% 0.16/0.39 % (27278)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for theBenchmark
% 0.16/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.39 % (27278)------------------------------
% 0.16/0.39 % (27278)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.39 % (27278)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (27278)Memory used [KB]: 755
% 0.16/0.39 % (27278)Time elapsed: 0.005 s
% 0.16/0.39 % (27278)Instructions burned: 3 (million)
% 0.16/0.39 % (27275)Success in time 0.018 s
%------------------------------------------------------------------------------