TSTP Solution File: SEU109+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU109+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 : n026.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 1.90s 0.60s
% Output : Refutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 11
% Syntax : Number of formulae : 83 ( 10 unt; 0 def)
% Number of atoms : 331 ( 17 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 420 ( 172 ~; 150 |; 79 &)
% ( 7 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 130 ( 112 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f520,plain,
$false,
inference(subsumption_resolution,[],[f519,f219]) ).
fof(f219,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f519,plain,
in(empty_set,empty_set),
inference(subsumption_resolution,[],[f516,f275]) ).
fof(f275,plain,
in(empty_set,sK7),
inference(subsumption_resolution,[],[f270,f183]) ).
fof(f183,plain,
~ empty(sK7),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
( preboolean(sK7)
& ~ empty(sK7)
& ~ empty(sK8)
& ( empty(set_intersection2(sK7,sK8))
| ~ preboolean(set_intersection2(sK7,sK8)) )
& preboolean(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f99,f125,f124]) ).
fof(f124,plain,
( ? [X0] :
( preboolean(X0)
& ~ empty(X0)
& ? [X1] :
( ~ empty(X1)
& ( empty(set_intersection2(X0,X1))
| ~ preboolean(set_intersection2(X0,X1)) )
& preboolean(X1) ) )
=> ( preboolean(sK7)
& ~ empty(sK7)
& ? [X1] :
( ~ empty(X1)
& ( empty(set_intersection2(sK7,X1))
| ~ preboolean(set_intersection2(sK7,X1)) )
& preboolean(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X1] :
( ~ empty(X1)
& ( empty(set_intersection2(sK7,X1))
| ~ preboolean(set_intersection2(sK7,X1)) )
& preboolean(X1) )
=> ( ~ empty(sK8)
& ( empty(set_intersection2(sK7,sK8))
| ~ preboolean(set_intersection2(sK7,sK8)) )
& preboolean(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( preboolean(X0)
& ~ empty(X0)
& ? [X1] :
( ~ empty(X1)
& ( empty(set_intersection2(X0,X1))
| ~ preboolean(set_intersection2(X0,X1)) )
& preboolean(X1) ) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ( empty(set_intersection2(X0,X1))
| ~ preboolean(set_intersection2(X0,X1)) )
& ~ empty(X1)
& preboolean(X1) )
& ~ empty(X0)
& preboolean(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,negated_conjecture,
~ ! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& preboolean(X1) )
=> ( ~ empty(set_intersection2(X0,X1))
& preboolean(set_intersection2(X0,X1)) ) ) ),
inference(negated_conjecture,[],[f35]) ).
fof(f35,conjecture,
! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& preboolean(X1) )
=> ( ~ empty(set_intersection2(X0,X1))
& preboolean(set_intersection2(X0,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_finsub_1) ).
fof(f270,plain,
( empty(sK7)
| in(empty_set,sK7) ),
inference(resolution,[],[f162,f184]) ).
fof(f184,plain,
preboolean(sK7),
inference(cnf_transformation,[],[f126]) ).
fof(f162,plain,
! [X0] :
( ~ preboolean(X0)
| empty(X0)
| in(empty_set,X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X0] :
( empty(X0)
| in(empty_set,X0)
| ~ preboolean(X0) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
! [X0] :
( in(empty_set,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,axiom,
! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> in(empty_set,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_finsub_1) ).
fof(f516,plain,
( ~ in(empty_set,sK7)
| in(empty_set,empty_set) ),
inference(resolution,[],[f471,f272]) ).
fof(f272,plain,
in(empty_set,sK8),
inference(subsumption_resolution,[],[f271,f182]) ).
fof(f182,plain,
~ empty(sK8),
inference(cnf_transformation,[],[f126]) ).
fof(f271,plain,
( empty(sK8)
| in(empty_set,sK8) ),
inference(resolution,[],[f162,f180]) ).
fof(f180,plain,
preboolean(sK8),
inference(cnf_transformation,[],[f126]) ).
fof(f471,plain,
! [X2] :
( ~ in(X2,sK8)
| in(X2,empty_set)
| ~ in(X2,sK7) ),
inference(superposition,[],[f222,f447]) ).
fof(f447,plain,
empty_set = set_intersection2(sK7,sK8),
inference(resolution,[],[f445,f218]) ).
fof(f218,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,axiom,
! [X0] :
( empty(X0)
=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f445,plain,
empty(set_intersection2(sK7,sK8)),
inference(subsumption_resolution,[],[f444,f330]) ).
fof(f330,plain,
( in(sK14(set_intersection2(sK7,sK8)),sK7)
| empty(set_intersection2(sK7,sK8)) ),
inference(resolution,[],[f221,f244]) ).
fof(f244,plain,
( in(sK14(set_intersection2(sK7,sK8)),set_intersection2(sK7,sK8))
| empty(set_intersection2(sK7,sK8)) ),
inference(resolution,[],[f211,f181]) ).
fof(f181,plain,
( ~ preboolean(set_intersection2(sK7,sK8))
| empty(set_intersection2(sK7,sK8)) ),
inference(cnf_transformation,[],[f126]) ).
fof(f211,plain,
! [X0] :
( preboolean(X0)
| in(sK14(X0),X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0] :
( ( ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) )
| ~ preboolean(X0) )
& ( preboolean(X0)
| ( ( ~ in(set_union2(sK13(X0),sK14(X0)),X0)
| ~ in(set_difference(sK13(X0),sK14(X0)),X0) )
& in(sK13(X0),X0)
& in(sK14(X0),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f141,f142]) ).
fof(f142,plain,
! [X0] :
( ? [X3,X4] :
( ( ~ in(set_union2(X3,X4),X0)
| ~ in(set_difference(X3,X4),X0) )
& in(X3,X0)
& in(X4,X0) )
=> ( ( ~ in(set_union2(sK13(X0),sK14(X0)),X0)
| ~ in(set_difference(sK13(X0),sK14(X0)),X0) )
& in(sK13(X0),X0)
& in(sK14(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
! [X0] :
( ( ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) )
| ~ preboolean(X0) )
& ( preboolean(X0)
| ? [X3,X4] :
( ( ~ in(set_union2(X3,X4),X0)
| ~ in(set_difference(X3,X4),X0) )
& in(X3,X0)
& in(X4,X0) ) ) ),
inference(rectify,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ( ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) )
| ~ preboolean(X0) )
& ( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_union2(X1,X2),X0)
| ~ in(set_difference(X1,X2),X0) )
& in(X1,X0)
& in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f76,plain,
! [X0] :
( ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) )
<=> preboolean(X0) ),
inference(flattening,[],[f75]) ).
fof(f75,plain,
! [X0] :
( ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X2,X0)
| ~ in(X1,X0) )
<=> preboolean(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,axiom,
! [X0] :
( ! [X1,X2] :
( ( in(X2,X0)
& in(X1,X0) )
=> ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) ) )
<=> preboolean(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(f221,plain,
! [X2,X1,X4] :
( ~ in(X4,set_intersection2(X1,X2))
| in(X4,X1) ),
inference(equality_resolution,[],[f171]) ).
fof(f171,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0,X1,X2] :
( ( set_intersection2(X1,X2) = X0
| ( ( ~ in(sK6(X0,X1,X2),X0)
| ~ in(sK6(X0,X1,X2),X2)
| ~ in(sK6(X0,X1,X2),X1) )
& ( in(sK6(X0,X1,X2),X0)
| ( in(sK6(X0,X1,X2),X2)
& in(sK6(X0,X1,X2),X1) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X2)
& in(X4,X1) )
| ~ in(X4,X0) )
& ( in(X4,X0)
| ~ in(X4,X2)
| ~ in(X4,X1) ) )
| set_intersection2(X1,X2) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f118,f119]) ).
fof(f119,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) )
& ( in(X3,X0)
| ( in(X3,X2)
& in(X3,X1) ) ) )
=> ( ( ~ in(sK6(X0,X1,X2),X0)
| ~ in(sK6(X0,X1,X2),X2)
| ~ in(sK6(X0,X1,X2),X1) )
& ( in(sK6(X0,X1,X2),X0)
| ( in(sK6(X0,X1,X2),X2)
& in(sK6(X0,X1,X2),X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
! [X0,X1,X2] :
( ( set_intersection2(X1,X2) = X0
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) )
& ( in(X3,X0)
| ( in(X3,X2)
& in(X3,X1) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X2)
& in(X4,X1) )
| ~ in(X4,X0) )
& ( in(X4,X0)
| ~ in(X4,X2)
| ~ in(X4,X1) ) )
| set_intersection2(X1,X2) != X0 ) ),
inference(rectify,[],[f117]) ).
fof(f117,plain,
! [X2,X1,X0] :
( ( set_intersection2(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X2)
| ( in(X3,X0)
& in(X3,X1) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) ) )
| set_intersection2(X1,X0) != X2 ) ),
inference(flattening,[],[f116]) ).
fof(f116,plain,
! [X2,X1,X0] :
( ( set_intersection2(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X2)
| ( in(X3,X0)
& in(X3,X1) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) ) )
| set_intersection2(X1,X0) != X2 ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X2,X1,X0] :
( set_intersection2(X1,X0) = X2
<=> ! [X3] :
( ( in(X3,X0)
& in(X3,X1) )
<=> in(X3,X2) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X0,X2] :
( ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) )
<=> set_intersection2(X0,X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f444,plain,
( empty(set_intersection2(sK7,sK8))
| ~ in(sK14(set_intersection2(sK7,sK8)),sK7) ),
inference(subsumption_resolution,[],[f443,f331]) ).
fof(f331,plain,
( in(sK13(set_intersection2(sK7,sK8)),sK7)
| empty(set_intersection2(sK7,sK8)) ),
inference(resolution,[],[f221,f246]) ).
fof(f246,plain,
( in(sK13(set_intersection2(sK7,sK8)),set_intersection2(sK7,sK8))
| empty(set_intersection2(sK7,sK8)) ),
inference(resolution,[],[f212,f181]) ).
fof(f212,plain,
! [X0] :
( preboolean(X0)
| in(sK13(X0),X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f443,plain,
( ~ in(sK13(set_intersection2(sK7,sK8)),sK7)
| empty(set_intersection2(sK7,sK8))
| ~ in(sK14(set_intersection2(sK7,sK8)),sK7) ),
inference(subsumption_resolution,[],[f442,f321]) ).
fof(f321,plain,
( in(sK13(set_intersection2(sK7,sK8)),sK8)
| empty(set_intersection2(sK7,sK8)) ),
inference(resolution,[],[f220,f246]) ).
fof(f220,plain,
! [X2,X1,X4] :
( ~ in(X4,set_intersection2(X1,X2))
| in(X4,X2) ),
inference(equality_resolution,[],[f172]) ).
fof(f172,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_intersection2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f120]) ).
fof(f442,plain,
( ~ in(sK13(set_intersection2(sK7,sK8)),sK8)
| ~ in(sK14(set_intersection2(sK7,sK8)),sK7)
| empty(set_intersection2(sK7,sK8))
| ~ in(sK13(set_intersection2(sK7,sK8)),sK7) ),
inference(resolution,[],[f441,f320]) ).
fof(f320,plain,
( in(sK14(set_intersection2(sK7,sK8)),sK8)
| empty(set_intersection2(sK7,sK8)) ),
inference(resolution,[],[f220,f244]) ).
fof(f441,plain,
( ~ in(sK14(set_intersection2(sK7,sK8)),sK8)
| ~ in(sK14(set_intersection2(sK7,sK8)),sK7)
| ~ in(sK13(set_intersection2(sK7,sK8)),sK8)
| ~ in(sK13(set_intersection2(sK7,sK8)),sK7) ),
inference(subsumption_resolution,[],[f440,f396]) ).
fof(f396,plain,
! [X14,X13] :
( in(set_union2(X13,X14),sK8)
| ~ in(X14,sK8)
| ~ in(X13,sK8) ),
inference(resolution,[],[f215,f180]) ).
fof(f215,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| ~ in(X1,X0)
| in(set_union2(X1,X2),X0)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f440,plain,
( ~ in(sK14(set_intersection2(sK7,sK8)),sK8)
| ~ in(sK14(set_intersection2(sK7,sK8)),sK7)
| ~ in(set_union2(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),sK8)
| ~ in(sK13(set_intersection2(sK7,sK8)),sK7)
| ~ in(sK13(set_intersection2(sK7,sK8)),sK8) ),
inference(subsumption_resolution,[],[f439,f395]) ).
fof(f395,plain,
! [X11,X12] :
( in(set_union2(X11,X12),sK7)
| ~ in(X11,sK7)
| ~ in(X12,sK7) ),
inference(resolution,[],[f215,f184]) ).
fof(f439,plain,
( ~ in(set_union2(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),sK7)
| ~ in(sK13(set_intersection2(sK7,sK8)),sK8)
| ~ in(sK14(set_intersection2(sK7,sK8)),sK8)
| ~ in(set_union2(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),sK8)
| ~ in(sK14(set_intersection2(sK7,sK8)),sK7)
| ~ in(sK13(set_intersection2(sK7,sK8)),sK7) ),
inference(resolution,[],[f438,f222]) ).
fof(f438,plain,
( ~ in(set_union2(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),set_intersection2(sK7,sK8))
| ~ in(sK14(set_intersection2(sK7,sK8)),sK8)
| ~ in(sK13(set_intersection2(sK7,sK8)),sK8)
| ~ in(sK14(set_intersection2(sK7,sK8)),sK7)
| ~ in(sK13(set_intersection2(sK7,sK8)),sK7) ),
inference(resolution,[],[f437,f377]) ).
fof(f377,plain,
! [X11,X12] :
( in(set_difference(X11,X12),sK7)
| ~ in(X12,sK7)
| ~ in(X11,sK7) ),
inference(resolution,[],[f214,f184]) ).
fof(f214,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| in(set_difference(X1,X2),X0)
| ~ in(X2,X0)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f437,plain,
( ~ in(set_difference(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),sK7)
| ~ in(set_union2(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),set_intersection2(sK7,sK8))
| ~ in(sK13(set_intersection2(sK7,sK8)),sK8)
| ~ in(sK14(set_intersection2(sK7,sK8)),sK8) ),
inference(resolution,[],[f436,f378]) ).
fof(f378,plain,
! [X14,X13] :
( in(set_difference(X13,X14),sK8)
| ~ in(X14,sK8)
| ~ in(X13,sK8) ),
inference(resolution,[],[f214,f180]) ).
fof(f436,plain,
( ~ in(set_difference(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),sK8)
| ~ in(set_union2(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),set_intersection2(sK7,sK8))
| ~ in(set_difference(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),sK7) ),
inference(resolution,[],[f434,f222]) ).
fof(f434,plain,
( ~ in(set_difference(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),set_intersection2(sK7,sK8))
| ~ in(set_union2(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),set_intersection2(sK7,sK8)) ),
inference(subsumption_resolution,[],[f430,f216]) ).
fof(f216,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(rectify,[],[f89]) ).
fof(f89,plain,
! [X1,X0] :
( ~ empty(X0)
| ~ in(X1,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0,X1] :
~ ( in(X1,X0)
& empty(X0) ),
inference(rectify,[],[f45]) ).
fof(f45,axiom,
! [X1,X0] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f430,plain,
( ~ in(set_union2(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),set_intersection2(sK7,sK8))
| empty(set_intersection2(sK7,sK8))
| ~ in(set_difference(sK13(set_intersection2(sK7,sK8)),sK14(set_intersection2(sK7,sK8))),set_intersection2(sK7,sK8)) ),
inference(resolution,[],[f213,f181]) ).
fof(f213,plain,
! [X0] :
( preboolean(X0)
| ~ in(set_difference(sK13(X0),sK14(X0)),X0)
| ~ in(set_union2(sK13(X0),sK14(X0)),X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f222,plain,
! [X2,X1,X4] :
( in(X4,set_intersection2(X1,X2))
| ~ in(X4,X2)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f170]) ).
fof(f170,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| ~ in(X4,X1)
| set_intersection2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU109+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % 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.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 14:53:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.53 % (16468)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53 % (16460)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.53 % (16458)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (16460)Instruction limit reached!
% 0.19/0.53 % (16460)------------------------------
% 0.19/0.53 % (16460)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (16460)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (16460)Termination reason: Unknown
% 0.19/0.53 % (16460)Termination phase: Preprocessing 3
% 0.19/0.53
% 0.19/0.53 % (16460)Memory used [KB]: 895
% 0.19/0.53 % (16460)Time elapsed: 0.003 s
% 0.19/0.53 % (16460)Instructions burned: 2 (million)
% 0.19/0.53 % (16460)------------------------------
% 0.19/0.53 % (16460)------------------------------
% 0.19/0.54 % (16476)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.54 % (16466)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.54 % (16474)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.55 TRYING [1]
% 0.19/0.55 TRYING [2]
% 0.19/0.55 TRYING [3]
% 0.19/0.56 % (16459)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.56 TRYING [4]
% 0.19/0.56 % (16459)Instruction limit reached!
% 0.19/0.56 % (16459)------------------------------
% 0.19/0.56 % (16459)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (16459)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (16459)Termination reason: Unknown
% 0.19/0.56 % (16459)Termination phase: Saturation
% 0.19/0.56
% 0.19/0.56 % (16459)Memory used [KB]: 5628
% 0.19/0.56 % (16459)Time elapsed: 0.132 s
% 0.19/0.56 % (16459)Instructions burned: 7 (million)
% 0.19/0.56 % (16459)------------------------------
% 0.19/0.56 % (16459)------------------------------
% 0.19/0.57 % (16467)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.19/0.57 % (16475)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.56/0.58 % (16455)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.56/0.58 % (16474)First to succeed.
% 1.56/0.59 % (16456)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.90/0.60 % (16469)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.90/0.60 % (16454)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.90/0.60 % (16463)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.90/0.60 % (16461)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.90/0.60 % (16474)Refutation found. Thanks to Tanya!
% 1.90/0.60 % SZS status Theorem for theBenchmark
% 1.90/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.90/0.60 % (16474)------------------------------
% 1.90/0.60 % (16474)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.60 % (16474)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.60 % (16474)Termination reason: Refutation
% 1.90/0.60
% 1.90/0.60 % (16474)Memory used [KB]: 1151
% 1.90/0.60 % (16474)Time elapsed: 0.176 s
% 1.90/0.60 % (16474)Instructions burned: 17 (million)
% 1.90/0.60 % (16474)------------------------------
% 1.90/0.60 % (16474)------------------------------
% 1.90/0.60 % (16451)Success in time 0.256 s
%------------------------------------------------------------------------------