TSTP Solution File: SEU107+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n029.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 : Wed Aug 31 18:31:57 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 16 unt; 0 def)
% Number of atoms : 148 ( 18 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 162 ( 65 ~; 61 |; 26 &)
% ( 1 <=>; 9 =>; 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 : 83 ( 78 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f353,plain,
$false,
inference(subsumption_resolution,[],[f352,f134]) ).
fof(f134,plain,
~ in(empty_set,sK6),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
( preboolean(sK6)
& ~ empty(sK6)
& ~ in(empty_set,sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f60,f92]) ).
fof(f92,plain,
( ? [X0] :
( preboolean(X0)
& ~ empty(X0)
& ~ in(empty_set,X0) )
=> ( preboolean(sK6)
& ~ empty(sK6)
& ~ in(empty_set,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
? [X0] :
( preboolean(X0)
& ~ empty(X0)
& ~ in(empty_set,X0) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
? [X0] :
( ~ in(empty_set,X0)
& ~ empty(X0)
& preboolean(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> in(empty_set,X0) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> in(empty_set,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_finsub_1) ).
fof(f352,plain,
in(empty_set,sK6),
inference(backward_demodulation,[],[f283,f348]) ).
fof(f348,plain,
empty_set = prebool_difference(sK6,sK5(sK6),sK5(sK6)),
inference(forward_demodulation,[],[f347,f186]) ).
fof(f186,plain,
! [X0] : empty_set = set_difference(X0,X0),
inference(resolution,[],[f140,f124]) ).
fof(f124,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X1] : subset(X1,X1),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X1,X0] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f140,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| empty_set = set_difference(X1,X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f97,plain,
! [X0,X1] :
( ( subset(X1,X0)
| empty_set != set_difference(X1,X0) )
& ( empty_set = set_difference(X1,X0)
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f96]) ).
fof(f96,plain,
! [X1,X0] :
( ( subset(X0,X1)
| set_difference(X0,X1) != empty_set )
& ( set_difference(X0,X1) = empty_set
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> set_difference(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f347,plain,
set_difference(sK5(sK6),sK5(sK6)) = prebool_difference(sK6,sK5(sK6),sK5(sK6)),
inference(resolution,[],[f291,f133]) ).
fof(f133,plain,
! [X0] : element(sK5(X0),X0),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0] : element(sK5(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f7,f90]) ).
fof(f90,plain,
! [X0] :
( ? [X1] : element(X1,X0)
=> element(sK5(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(f291,plain,
! [X5] :
( ~ element(X5,sK6)
| prebool_difference(sK6,X5,sK5(sK6)) = set_difference(X5,sK5(sK6)) ),
inference(resolution,[],[f275,f133]) ).
fof(f275,plain,
! [X0,X1] :
( ~ element(X0,sK6)
| ~ element(X1,sK6)
| prebool_difference(sK6,X1,X0) = set_difference(X1,X0) ),
inference(subsumption_resolution,[],[f272,f135]) ).
fof(f135,plain,
~ empty(sK6),
inference(cnf_transformation,[],[f93]) ).
fof(f272,plain,
! [X0,X1] :
( prebool_difference(sK6,X1,X0) = set_difference(X1,X0)
| ~ element(X1,sK6)
| ~ element(X0,sK6)
| empty(sK6) ),
inference(resolution,[],[f132,f136]) ).
fof(f136,plain,
preboolean(sK6),
inference(cnf_transformation,[],[f93]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| empty(X0)
| ~ element(X1,X0)
| ~ element(X2,X0)
| set_difference(X2,X1) = prebool_difference(X0,X2,X1) ),
inference(cnf_transformation,[],[f89]) ).
fof(f89,plain,
! [X0,X1,X2] :
( ~ element(X2,X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| set_difference(X2,X1) = prebool_difference(X0,X2,X1) ),
inference(rectify,[],[f57]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ element(X1,X2)
| empty(X2)
| ~ preboolean(X2)
| ~ element(X0,X2)
| prebool_difference(X2,X1,X0) = set_difference(X1,X0) ),
inference(flattening,[],[f56]) ).
fof(f56,plain,
! [X0,X1,X2] :
( prebool_difference(X2,X1,X0) = set_difference(X1,X0)
| ~ element(X1,X2)
| empty(X2)
| ~ element(X0,X2)
| ~ preboolean(X2) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( element(X1,X2)
& ~ empty(X2)
& element(X0,X2)
& preboolean(X2) )
=> prebool_difference(X2,X1,X0) = set_difference(X1,X0) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X2,X1,X0] :
( ( element(X2,X0)
& ~ empty(X0)
& preboolean(X0)
& element(X1,X0) )
=> prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(f283,plain,
in(prebool_difference(sK6,sK5(sK6),sK5(sK6)),sK6),
inference(resolution,[],[f280,f133]) ).
fof(f280,plain,
! [X5] :
( ~ element(X5,sK6)
| in(prebool_difference(sK6,X5,sK5(sK6)),sK6) ),
inference(resolution,[],[f277,f133]) ).
fof(f277,plain,
! [X0,X1] :
( ~ element(X1,sK6)
| in(prebool_difference(sK6,X0,X1),sK6)
| ~ element(X0,sK6) ),
inference(subsumption_resolution,[],[f276,f135]) ).
fof(f276,plain,
! [X0,X1] :
( in(prebool_difference(sK6,X0,X1),sK6)
| ~ element(X1,sK6)
| ~ element(X0,sK6)
| empty(sK6) ),
inference(resolution,[],[f271,f146]) ).
fof(f146,plain,
! [X0,X1] :
( ~ element(X0,X1)
| empty(X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f271,plain,
! [X0,X1] :
( element(prebool_difference(sK6,X0,X1),sK6)
| ~ element(X0,sK6)
| ~ element(X1,sK6) ),
inference(subsumption_resolution,[],[f268,f135]) ).
fof(f268,plain,
! [X0,X1] :
( empty(sK6)
| element(prebool_difference(sK6,X0,X1),sK6)
| ~ element(X1,sK6)
| ~ element(X0,sK6) ),
inference(resolution,[],[f130,f136]) ).
fof(f130,plain,
! [X2,X0,X1] :
( ~ preboolean(X2)
| empty(X2)
| element(prebool_difference(X2,X0,X1),X2)
| ~ element(X0,X2)
| ~ element(X1,X2) ),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
! [X0,X1,X2] :
( empty(X2)
| ~ element(X0,X2)
| ~ preboolean(X2)
| ~ element(X1,X2)
| element(prebool_difference(X2,X0,X1),X2) ),
inference(rectify,[],[f74]) ).
fof(f74,plain,
! [X2,X0,X1] :
( empty(X1)
| ~ element(X2,X1)
| ~ preboolean(X1)
| ~ element(X0,X1)
| element(prebool_difference(X1,X2,X0),X1) ),
inference(flattening,[],[f73]) ).
fof(f73,plain,
! [X1,X0,X2] :
( element(prebool_difference(X1,X2,X0),X1)
| ~ element(X0,X1)
| ~ preboolean(X1)
| ~ element(X2,X1)
| empty(X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
! [X1,X0,X2] :
( ( element(X0,X1)
& preboolean(X1)
& element(X2,X1)
& ~ empty(X1) )
=> element(prebool_difference(X1,X2,X0),X1) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X2,X0,X1] :
( ( ~ empty(X0)
& element(X1,X0)
& element(X2,X0)
& preboolean(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.12 % Problem : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.35 % Computer : n029.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Aug 30 14:48:27 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 % (23191)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.47 % (23183)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.48 % (23191)First to succeed.
% 0.20/0.49 % (23183)Instruction limit reached!
% 0.20/0.49 % (23183)------------------------------
% 0.20/0.49 % (23183)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (23183)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (23183)Termination reason: Unknown
% 0.20/0.49 % (23183)Termination phase: Saturation
% 0.20/0.49
% 0.20/0.49 % (23183)Memory used [KB]: 5500
% 0.20/0.49 % (23183)Time elapsed: 0.076 s
% 0.20/0.49 % (23183)Instructions burned: 7 (million)
% 0.20/0.49 % (23183)------------------------------
% 0.20/0.49 % (23183)------------------------------
% 0.20/0.49 % (23191)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (23191)------------------------------
% 0.20/0.49 % (23191)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (23191)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (23191)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (23191)Memory used [KB]: 1151
% 0.20/0.49 % (23191)Time elapsed: 0.072 s
% 0.20/0.49 % (23191)Instructions burned: 10 (million)
% 0.20/0.49 % (23191)------------------------------
% 0.20/0.49 % (23191)------------------------------
% 0.20/0.49 % (23175)Success in time 0.134 s
%------------------------------------------------------------------------------