TSTP Solution File: SEU107+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU107+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n014.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:13 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 13 unt; 0 def)
% Number of atoms : 127 ( 14 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 143 ( 61 ~; 55 |; 19 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 60 ( 55 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f512,plain,
$false,
inference(resolution,[],[f510,f114]) ).
fof(f114,plain,
! [X0] : element(sK4(X0),X0),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0] : element(sK4(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f7,f77]) ).
fof(f77,plain,
! [X0] :
( ? [X1] : element(X1,X0)
=> element(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f7,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f510,plain,
~ element(sK4(sK0),sK0),
inference(resolution,[],[f505,f94]) ).
fof(f94,plain,
preboolean(sK0),
inference(cnf_transformation,[],[f70]) ).
fof(f70,plain,
( ~ in(empty_set,sK0)
& preboolean(sK0)
& ~ empty(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f45,f69]) ).
fof(f69,plain,
( ? [X0] :
( ~ in(empty_set,X0)
& preboolean(X0)
& ~ empty(X0) )
=> ( ~ in(empty_set,sK0)
& preboolean(sK0)
& ~ empty(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
? [X0] :
( ~ in(empty_set,X0)
& preboolean(X0)
& ~ empty(X0) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
? [X0] :
( ~ in(empty_set,X0)
& preboolean(X0)
& ~ empty(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> in(empty_set,X0) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> in(empty_set,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_finsub_1) ).
fof(f505,plain,
( ~ preboolean(sK0)
| ~ element(sK4(sK0),sK0) ),
inference(resolution,[],[f504,f93]) ).
fof(f93,plain,
~ empty(sK0),
inference(cnf_transformation,[],[f70]) ).
fof(f504,plain,
( empty(sK0)
| ~ preboolean(sK0)
| ~ element(sK4(sK0),sK0) ),
inference(duplicate_literal_removal,[],[f500]) ).
fof(f500,plain,
( ~ element(sK4(sK0),sK0)
| ~ preboolean(sK0)
| empty(sK0)
| empty(sK0) ),
inference(resolution,[],[f497,f159]) ).
fof(f159,plain,
( ~ element(empty_set,sK0)
| empty(sK0) ),
inference(resolution,[],[f124,f95]) ).
fof(f95,plain,
~ in(empty_set,sK0),
inference(cnf_transformation,[],[f70]) ).
fof(f124,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f497,plain,
( element(empty_set,sK0)
| ~ element(sK4(sK0),sK0)
| ~ preboolean(sK0)
| empty(sK0) ),
inference(duplicate_literal_removal,[],[f496]) ).
fof(f496,plain,
( element(empty_set,sK0)
| ~ element(sK4(sK0),sK0)
| ~ element(sK4(sK0),sK0)
| ~ preboolean(sK0)
| empty(sK0) ),
inference(superposition,[],[f131,f495]) ).
fof(f495,plain,
empty_set = prebool_difference(sK0,sK4(sK0),sK4(sK0)),
inference(resolution,[],[f491,f114]) ).
fof(f491,plain,
! [X0] :
( ~ element(X0,sK0)
| empty_set = prebool_difference(sK0,X0,X0) ),
inference(forward_demodulation,[],[f490,f172]) ).
fof(f172,plain,
! [X0] : empty_set = set_difference(X0,X0),
inference(resolution,[],[f128,f120]) ).
fof(f120,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f128,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
! [X0,X1] :
( ( set_difference(X0,X1) = empty_set
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| set_difference(X0,X1) != empty_set ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f490,plain,
! [X0] :
( ~ element(X0,sK0)
| set_difference(X0,X0) = prebool_difference(sK0,X0,X0) ),
inference(factoring,[],[f294]) ).
fof(f294,plain,
! [X0,X1] :
( ~ element(X1,sK0)
| ~ element(X0,sK0)
| set_difference(X0,X1) = prebool_difference(sK0,X0,X1) ),
inference(resolution,[],[f262,f94]) ).
fof(f262,plain,
! [X0,X1] :
( ~ preboolean(sK0)
| ~ element(X1,sK0)
| ~ element(X0,sK0)
| prebool_difference(sK0,X1,X0) = set_difference(X1,X0) ),
inference(resolution,[],[f132,f93]) ).
fof(f132,plain,
! [X2,X0,X1] :
( empty(X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(flattening,[],[f64]) ).
fof(f64,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0,X1,X2] :
( ( element(X2,X0)
& element(X1,X0)
& preboolean(X0)
& ~ empty(X0) )
=> prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(f131,plain,
! [X2,X0,X1] :
( element(prebool_difference(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(flattening,[],[f62]) ).
fof(f62,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( ( element(X2,X0)
& element(X1,X0)
& preboolean(X0)
& ~ empty(X0) )
=> element(prebool_difference(X0,X1,X2),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_finsub_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU107+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.33 % Computer : n014.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Apr 29 20:34:34 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 % (17156)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.35 % (17163)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.36 % (17158)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.37 % (17161)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.37 % (17160)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.37 TRYING [1]
% 0.16/0.37 TRYING [2]
% 0.16/0.37 TRYING [3]
% 0.16/0.37 % (17157)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.38 TRYING [1]
% 0.16/0.38 TRYING [2]
% 0.16/0.38 % (17159)WARNING: value z3 for option sas not known
% 0.16/0.38 % (17159)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.38 TRYING [3]
% 0.16/0.39 TRYING [4]
% 0.16/0.40 TRYING [5]
% 0.16/0.40 TRYING [4]
% 0.16/0.40 % (17162)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.43 TRYING [6]
% 0.16/0.43 % (17162)First to succeed.
% 0.16/0.44 % (17162)Refutation found. Thanks to Tanya!
% 0.16/0.44 % SZS status Theorem for theBenchmark
% 0.16/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.44 % (17162)------------------------------
% 0.16/0.44 % (17162)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.16/0.44 % (17162)Termination reason: Refutation
% 0.16/0.44
% 0.16/0.44 % (17162)Memory used [KB]: 1059
% 0.16/0.44 % (17162)Time elapsed: 0.068 s
% 0.16/0.44 % (17162)Instructions burned: 25 (million)
% 0.16/0.44 % (17162)------------------------------
% 0.16/0.44 % (17162)------------------------------
% 0.16/0.44 % (17156)Success in time 0.1 s
%------------------------------------------------------------------------------