TSTP Solution File: SEU141+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.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 : n003.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:32:06 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of formulae : 108 ( 5 unt; 0 def)
% Number of atoms : 410 ( 66 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 495 ( 193 ~; 194 |; 83 &)
% ( 17 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 210 ( 186 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f666,plain,
$false,
inference(avatar_sat_refutation,[],[f134,f135,f640,f665]) ).
fof(f665,plain,
( ~ spl9_1
| spl9_2 ),
inference(avatar_contradiction_clause,[],[f664]) ).
fof(f664,plain,
( $false
| ~ spl9_1
| spl9_2 ),
inference(subsumption_resolution,[],[f662,f133]) ).
fof(f133,plain,
( ~ disjoint(sK2,sK3)
| spl9_2 ),
inference(avatar_component_clause,[],[f131]) ).
fof(f131,plain,
( spl9_2
<=> disjoint(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f662,plain,
( disjoint(sK2,sK3)
| ~ spl9_1 ),
inference(superposition,[],[f400,f128]) ).
fof(f128,plain,
( sF8 = sK2
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f127,plain,
( spl9_1
<=> sF8 = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f400,plain,
disjoint(sF8,sK3),
inference(resolution,[],[f397,f99]) ).
fof(f99,plain,
! [X0,X1] :
( ~ disjoint(X1,X0)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1] :
( ~ disjoint(X1,X0)
| disjoint(X0,X1) ),
inference(rectify,[],[f42]) ).
fof(f42,plain,
! [X1,X0] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X1,X0] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f397,plain,
disjoint(sK3,sF8),
inference(duplicate_literal_removal,[],[f396]) ).
fof(f396,plain,
( disjoint(sK3,sF8)
| disjoint(sK3,sF8) ),
inference(resolution,[],[f336,f294]) ).
fof(f294,plain,
! [X4,X5] :
( in(sK7(X5,X4),X4)
| disjoint(X4,X5) ),
inference(resolution,[],[f114,f118]) ).
fof(f118,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X1,X0))
| in(X3,X1) ),
inference(equality_resolution,[],[f104]) ).
fof(f104,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X2)
| set_intersection2(X1,X0) != X2 ),
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X1,X0) != X2 )
& ( set_intersection2(X1,X0) = X2
| ( ( ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f64,f65]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2) )
& ( ( in(X4,X1)
& in(X4,X0) )
| in(X4,X2) ) )
=> ( ( ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X1,X0) != X2 )
& ( set_intersection2(X1,X0) = X2
| ? [X4] :
( ( ~ in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2) )
& ( ( in(X4,X1)
& in(X4,X0) )
| in(X4,X2) ) ) ) ),
inference(rectify,[],[f63]) ).
fof(f63,plain,
! [X1,X0,X2] :
( ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 )
& ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) ) ),
inference(flattening,[],[f62]) ).
fof(f62,plain,
! [X1,X0,X2] :
( ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 )
& ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,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(f114,plain,
! [X0,X1] :
( in(sK7(X0,X1),set_intersection2(X1,X0))
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
! [X0,X1] :
( ( in(sK7(X0,X1),set_intersection2(X1,X0))
| disjoint(X1,X0) )
& ( ~ disjoint(X1,X0)
| ! [X3] : ~ in(X3,set_intersection2(X1,X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f74,f75]) ).
fof(f75,plain,
! [X0,X1] :
( ? [X2] : in(X2,set_intersection2(X1,X0))
=> in(sK7(X0,X1),set_intersection2(X1,X0)) ),
introduced(choice_axiom,[]) ).
fof(f74,plain,
! [X0,X1] :
( ( ? [X2] : in(X2,set_intersection2(X1,X0))
| disjoint(X1,X0) )
& ( ~ disjoint(X1,X0)
| ! [X3] : ~ in(X3,set_intersection2(X1,X0)) ) ),
inference(rectify,[],[f36]) ).
fof(f36,plain,
! [X1,X0] :
( ( ? [X2] : in(X2,set_intersection2(X0,X1))
| disjoint(X0,X1) )
& ( ~ disjoint(X0,X1)
| ! [X3] : ~ in(X3,set_intersection2(X0,X1)) ) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) )
& ~ ( disjoint(X0,X1)
& ? [X3] : in(X3,set_intersection2(X0,X1)) ) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X0,X1] :
( ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f336,plain,
! [X24] :
( ~ in(sK7(sF8,X24),sK3)
| disjoint(X24,sF8) ),
inference(resolution,[],[f293,f209]) ).
fof(f209,plain,
! [X4] :
( ~ in(X4,sF8)
| ~ in(X4,sK3) ),
inference(superposition,[],[f121,f123]) ).
fof(f123,plain,
set_difference(sK2,sK3) = sF8,
introduced(function_definition,[]) ).
fof(f121,plain,
! [X2,X0,X4] :
( ~ in(X4,set_difference(X2,X0))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f108]) ).
fof(f108,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X0)
| ~ in(X4,X1)
| set_difference(X2,X0) != X1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ( set_difference(X2,X0) = 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) ) ) )
& ( ! [X4] :
( ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) )
& ( ( ~ in(X4,X0)
& in(X4,X2) )
| ~ in(X4,X1) ) )
| set_difference(X2,X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f71,f72]) ).
fof(f72,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(f71,plain,
! [X0,X1,X2] :
( ( set_difference(X2,X0) = X1
| ? [X3] :
( ( in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) )
& ( ( ~ in(X3,X0)
& in(X3,X2) )
| in(X3,X1) ) ) )
& ( ! [X4] :
( ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) )
& ( ( ~ in(X4,X0)
& in(X4,X2) )
| ~ in(X4,X1) ) )
| set_difference(X2,X0) != X1 ) ),
inference(rectify,[],[f70]) ).
fof(f70,plain,
! [X1,X0,X2] :
( ( set_difference(X2,X1) = X0
| ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( ( ~ in(X3,X1)
& in(X3,X2) )
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X2) )
| ~ in(X3,X0) ) )
| set_difference(X2,X1) != X0 ) ),
inference(flattening,[],[f69]) ).
fof(f69,plain,
! [X1,X0,X2] :
( ( set_difference(X2,X1) = X0
| ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( ( ~ in(X3,X1)
& in(X3,X2) )
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X2) )
| ~ in(X3,X0) ) )
| set_difference(X2,X1) != X0 ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X1,X0,X2] :
( set_difference(X2,X1) = X0
<=> ! [X3] :
( in(X3,X0)
<=> ( ~ in(X3,X1)
& in(X3,X2) ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X2,X1,X0] :
( ! [X3] :
( ( in(X3,X0)
& ~ in(X3,X1) )
<=> in(X3,X2) )
<=> set_difference(X0,X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f293,plain,
! [X2,X3] :
( in(sK7(X3,X2),X3)
| disjoint(X2,X3) ),
inference(resolution,[],[f114,f119]) ).
fof(f119,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X1,X0))
| in(X3,X0) ),
inference(equality_resolution,[],[f103]) ).
fof(f103,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X2)
| set_intersection2(X1,X0) != X2 ),
inference(cnf_transformation,[],[f66]) ).
fof(f640,plain,
( spl9_1
| ~ spl9_2 ),
inference(avatar_contradiction_clause,[],[f639]) ).
fof(f639,plain,
( $false
| spl9_1
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f630,f275]) ).
fof(f275,plain,
( ~ subset(sK2,sF8)
| spl9_1 ),
inference(subsumption_resolution,[],[f274,f129]) ).
fof(f129,plain,
( sF8 != sK2
| spl9_1 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f274,plain,
( sF8 = sK2
| ~ subset(sK2,sF8) ),
inference(resolution,[],[f94,f247]) ).
fof(f247,plain,
subset(sF8,sK2),
inference(duplicate_literal_removal,[],[f244]) ).
fof(f244,plain,
( subset(sF8,sK2)
| subset(sF8,sK2) ),
inference(resolution,[],[f215,f92]) ).
fof(f92,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f50,f51]) ).
fof(f51,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f49]) ).
fof(f49,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f215,plain,
! [X0] :
( in(sK1(sF8,X0),sK2)
| subset(sF8,X0) ),
inference(resolution,[],[f214,f91]) ).
fof(f91,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f214,plain,
! [X4] :
( ~ in(X4,sF8)
| in(X4,sK2) ),
inference(superposition,[],[f122,f123]) ).
fof(f122,plain,
! [X2,X0,X4] :
( ~ in(X4,set_difference(X2,X0))
| in(X4,X2) ),
inference(equality_resolution,[],[f107]) ).
fof(f107,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_difference(X2,X0) != X1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f94,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f55]) ).
fof(f55,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(flattening,[],[f54]) ).
fof(f54,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> X0 = X1 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f630,plain,
( subset(sK2,sF8)
| ~ spl9_2 ),
inference(duplicate_literal_removal,[],[f627]) ).
fof(f627,plain,
( subset(sK2,sF8)
| subset(sK2,sF8)
| ~ spl9_2 ),
inference(resolution,[],[f620,f92]) ).
fof(f620,plain,
( ! [X1] :
( in(sK1(sK2,X1),sF8)
| subset(sK2,X1) )
| ~ spl9_2 ),
inference(resolution,[],[f618,f91]) ).
fof(f618,plain,
( ! [X4] :
( ~ in(X4,sK2)
| in(X4,sF8) )
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f617,f553]) ).
fof(f553,plain,
( ! [X12] :
( ~ in(X12,sK3)
| ~ in(X12,sK2) )
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f548,f186]) ).
fof(f186,plain,
( ! [X13] : ~ in(X13,empty_set)
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f185,f139]) ).
fof(f139,plain,
( disjoint(sK3,sK2)
| ~ spl9_2 ),
inference(resolution,[],[f99,f132]) ).
fof(f132,plain,
( disjoint(sK2,sK3)
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f131]) ).
fof(f185,plain,
( ! [X13] :
( ~ disjoint(sK3,sK2)
| ~ in(X13,empty_set) )
| ~ spl9_2 ),
inference(superposition,[],[f113,f160]) ).
fof(f160,plain,
( empty_set = set_intersection2(sK3,sK2)
| ~ spl9_2 ),
inference(resolution,[],[f86,f139]) ).
fof(f86,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
! [X0,X1] :
( ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) )
& ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ) ),
inference(rectify,[],[f47]) ).
fof(f47,plain,
! [X1,X0] :
( ( set_intersection2(X1,X0) = empty_set
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| set_intersection2(X1,X0) != empty_set ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X1,X0] :
( set_intersection2(X1,X0) = empty_set
<=> disjoint(X1,X0) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f113,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X1,X0))
| ~ disjoint(X1,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f548,plain,
( ! [X12] :
( ~ in(X12,sK3)
| ~ in(X12,sK2)
| in(X12,empty_set) )
| ~ spl9_2 ),
inference(superposition,[],[f117,f159]) ).
fof(f159,plain,
( empty_set = set_intersection2(sK2,sK3)
| ~ spl9_2 ),
inference(resolution,[],[f86,f132]) ).
fof(f117,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X1,X0))
| ~ in(X3,X1)
| ~ in(X3,X0) ),
inference(equality_resolution,[],[f105]) ).
fof(f105,plain,
! [X2,X3,X0,X1] :
( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0)
| set_intersection2(X1,X0) != X2 ),
inference(cnf_transformation,[],[f66]) ).
fof(f617,plain,
! [X4] :
( ~ in(X4,sK2)
| in(X4,sK3)
| in(X4,sF8) ),
inference(superposition,[],[f120,f123]) ).
fof(f120,plain,
! [X2,X0,X4] :
( in(X4,set_difference(X2,X0))
| ~ in(X4,X2)
| in(X4,X0) ),
inference(equality_resolution,[],[f109]) ).
fof(f109,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2)
| set_difference(X2,X0) != X1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f135,plain,
( spl9_2
| spl9_1 ),
inference(avatar_split_clause,[],[f125,f127,f131]) ).
fof(f125,plain,
( sF8 = sK2
| disjoint(sK2,sK3) ),
inference(definition_folding,[],[f97,f123]) ).
fof(f97,plain,
( set_difference(sK2,sK3) = sK2
| disjoint(sK2,sK3) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
( ( set_difference(sK2,sK3) != sK2
| ~ disjoint(sK2,sK3) )
& ( set_difference(sK2,sK3) = sK2
| disjoint(sK2,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f58,f59]) ).
fof(f59,plain,
( ? [X0,X1] :
( ( set_difference(X0,X1) != X0
| ~ disjoint(X0,X1) )
& ( set_difference(X0,X1) = X0
| disjoint(X0,X1) ) )
=> ( ( set_difference(sK2,sK3) != sK2
| ~ disjoint(sK2,sK3) )
& ( set_difference(sK2,sK3) = sK2
| disjoint(sK2,sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f58,plain,
? [X0,X1] :
( ( set_difference(X0,X1) != X0
| ~ disjoint(X0,X1) )
& ( set_difference(X0,X1) = X0
| disjoint(X0,X1) ) ),
inference(rectify,[],[f57]) ).
fof(f57,plain,
? [X1,X0] :
( ( set_difference(X1,X0) != X1
| ~ disjoint(X1,X0) )
& ( set_difference(X1,X0) = X1
| disjoint(X1,X0) ) ),
inference(nnf_transformation,[],[f41]) ).
fof(f41,plain,
? [X1,X0] :
( disjoint(X1,X0)
<~> set_difference(X1,X0) = X1 ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,plain,
~ ! [X0,X1] :
( set_difference(X1,X0) = X1
<=> disjoint(X1,X0) ),
inference(rectify,[],[f24]) ).
fof(f24,negated_conjecture,
~ ! [X1,X0] :
( set_difference(X0,X1) = X0
<=> disjoint(X0,X1) ),
inference(negated_conjecture,[],[f23]) ).
fof(f23,conjecture,
! [X1,X0] :
( set_difference(X0,X1) = X0
<=> disjoint(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f134,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f124,f131,f127]) ).
fof(f124,plain,
( ~ disjoint(sK2,sK3)
| sF8 != sK2 ),
inference(definition_folding,[],[f98,f123]) ).
fof(f98,plain,
( set_difference(sK2,sK3) != sK2
| ~ disjoint(sK2,sK3) ),
inference(cnf_transformation,[],[f60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:44:07 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.20/0.49 % (5832)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.50 % (5828)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)
% 0.20/0.50 % (5821)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (5836)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (5829)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.52 % (5835)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.52 % (5820)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)
% 0.20/0.52 % (5818)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (5817)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.52 % (5843)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.20/0.52 TRYING [1]
% 0.20/0.52 TRYING [2]
% 0.20/0.53 % (5827)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53 % (5819)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)
% 0.20/0.53 % (5840)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)
% 0.20/0.53 % (5841)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.53 % (5818)Refutation not found, incomplete strategy% (5818)------------------------------
% 0.20/0.53 % (5818)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (5818)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (5818)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.53
% 0.20/0.53 % (5818)Memory used [KB]: 5500
% 0.20/0.53 % (5818)Time elapsed: 0.078 s
% 0.20/0.53 % (5818)Instructions burned: 6 (million)
% 0.20/0.53 % (5818)------------------------------
% 0.20/0.53 % (5818)------------------------------
% 0.20/0.53 % (5822)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.53 % (5842)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.53 % (5831)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.20/0.53 % (5837)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.54 % (5846)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.54 % (5845)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.54 % (5829)First to succeed.
% 0.20/0.54 % (5838)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.54 % (5825)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.20/0.54 % (5834)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.54 % (5823)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.20/0.54 % (5825)Instruction limit reached!
% 0.20/0.54 % (5825)------------------------------
% 0.20/0.54 % (5825)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (5825)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (5825)Termination reason: Unknown
% 0.20/0.54 % (5825)Termination phase: Blocked clause elimination
% 0.20/0.54
% 0.20/0.54 % (5825)Memory used [KB]: 895
% 0.20/0.54 % (5825)Time elapsed: 0.002 s
% 0.20/0.54 % (5825)Instructions burned: 3 (million)
% 0.20/0.54 % (5825)------------------------------
% 0.20/0.54 % (5825)------------------------------
% 0.20/0.54 % (5833)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.20/0.54 % (5830)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54 TRYING [1]
% 0.20/0.54 % (5844)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.54 TRYING [1]
% 0.20/0.54 % (5826)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)
% 0.20/0.54 TRYING [2]
% 0.20/0.54 TRYING [2]
% 0.20/0.54 TRYING [3]
% 0.20/0.55 TRYING [3]
% 0.20/0.55 TRYING [3]
% 0.20/0.55 % (5829)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (5829)------------------------------
% 0.20/0.55 % (5829)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (5829)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (5829)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (5829)Memory used [KB]: 5628
% 0.20/0.55 % (5829)Time elapsed: 0.138 s
% 0.20/0.55 % (5829)Instructions burned: 18 (million)
% 0.20/0.55 % (5829)------------------------------
% 0.20/0.55 % (5829)------------------------------
% 0.20/0.55 % (5815)Success in time 0.189 s
%------------------------------------------------------------------------------