TSTP Solution File: SEU130+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU130+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 : 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 : Sun May 5 09:27:08 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 50 ( 18 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 41 ( 17 ~; 10 |; 9 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 34 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6651,plain,
$false,
inference(subsumption_resolution,[],[f6650,f1551]) ).
fof(f1551,plain,
~ subset(sK4,set_intersection2(sK4,sK5)),
inference(unit_resulting_resolution,[],[f109,f113,f141]) ).
fof(f141,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f81]) ).
fof(f81,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f113,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f23]) ).
fof(f23,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f109,plain,
sK4 != set_intersection2(sK4,sK5),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
( sK4 != set_intersection2(sK4,sK5)
& subset(sK4,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f45,f71]) ).
fof(f71,plain,
( ? [X0,X1] :
( set_intersection2(X0,X1) != X0
& subset(X0,X1) )
=> ( sK4 != set_intersection2(sK4,sK5)
& subset(sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
? [X0,X1] :
( set_intersection2(X0,X1) != X0
& subset(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
inference(negated_conjecture,[],[f28]) ).
fof(f28,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f6650,plain,
subset(sK4,set_intersection2(sK4,sK5)),
inference(forward_demodulation,[],[f6642,f134]) ).
fof(f134,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f6642,plain,
subset(sK4,set_intersection2(sK5,sK4)),
inference(superposition,[],[f6538,f132]) ).
fof(f132,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X0,X1] : set_intersection2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(f6538,plain,
! [X0] : subset(set_intersection2(sK4,X0),set_intersection2(sK5,X0)),
inference(unit_resulting_resolution,[],[f108,f120]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f108,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU130+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 11:17:31 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % (28959)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.35 % (28965)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.13/0.36 % (28962)WARNING: value z3 for option sas not known
% 0.13/0.36 % (28961)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.36 % (28960)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.36 % (28963)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.36 % (28962)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.13/0.36 % (28966)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.13/0.36 % (28964)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.13/0.36 TRYING [1]
% 0.13/0.36 TRYING [2]
% 0.13/0.37 TRYING [3]
% 0.13/0.37 TRYING [4]
% 0.13/0.37 TRYING [1]
% 0.19/0.38 TRYING [2]
% 0.19/0.40 TRYING [5]
% 0.19/0.40 TRYING [3]
% 0.19/0.45 TRYING [6]
% 0.19/0.47 % (28966)First to succeed.
% 0.19/0.47 % (28966)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28959"
% 0.19/0.47 % (28966)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (28966)------------------------------
% 0.19/0.47 % (28966)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.47 % (28966)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (28966)Memory used [KB]: 2018
% 0.19/0.47 % (28966)Time elapsed: 0.112 s
% 0.19/0.47 % (28966)Instructions burned: 196 (million)
% 0.19/0.47 % (28959)Success in time 0.128 s
%------------------------------------------------------------------------------