TSTP Solution File: SEU120+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU120+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 : n017.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:59 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 54 ( 6 unt; 0 def)
% Number of atoms : 133 ( 24 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 146 ( 67 ~; 44 |; 24 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 59 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f110,plain,
$false,
inference(avatar_sat_refutation,[],[f67,f68,f96,f109]) ).
fof(f109,plain,
( ~ spl6_1
| spl6_3 ),
inference(avatar_contradiction_clause,[],[f108]) ).
fof(f108,plain,
( $false
| ~ spl6_1
| spl6_3 ),
inference(subsumption_resolution,[],[f101,f103]) ).
fof(f103,plain,
( empty_set = set_intersection2(sK3,sK4)
| ~ spl6_1 ),
inference(resolution,[],[f98,f43]) ).
fof(f43,plain,
! [X0] :
( in(sK1(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0] :
( ( empty_set = X0
| in(sK1(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f26,f27]) ).
fof(f27,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK1(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f98,plain,
( ! [X2] : ~ in(X2,set_intersection2(sK3,sK4))
| ~ spl6_1 ),
inference(forward_demodulation,[],[f57,f51]) ).
fof(f51,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f57,plain,
( ! [X2] : ~ in(X2,set_intersection2(sK4,sK3))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f56,plain,
( spl6_1
<=> ! [X2] : ~ in(X2,set_intersection2(sK4,sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f101,plain,
( empty_set != set_intersection2(sK3,sK4)
| spl6_3 ),
inference(resolution,[],[f100,f49]) ).
fof(f49,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) )
& ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
! [X1,X0] :
( ( set_intersection2(X1,X0) = empty_set
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| set_intersection2(X1,X0) != empty_set ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( set_intersection2(X1,X0) = empty_set
<=> disjoint(X1,X0) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f100,plain,
( ~ disjoint(sK3,sK4)
| spl6_3 ),
inference(resolution,[],[f65,f41]) ).
fof(f41,plain,
! [X0,X1] :
( disjoint(X0,X1)
| ~ disjoint(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ disjoint(X1,X0)
| disjoint(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( disjoint(X1,X0)
=> disjoint(X0,X1) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X1,X0] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f65,plain,
( ~ disjoint(sK4,sK3)
| spl6_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f64,plain,
( spl6_3
<=> disjoint(sK4,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f96,plain,
( ~ spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f95]) ).
fof(f95,plain,
( $false
| ~ spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f94,f54]) ).
fof(f54,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f28]) ).
fof(f94,plain,
( in(sK5,empty_set)
| ~ spl6_2
| ~ spl6_3 ),
inference(backward_demodulation,[],[f81,f88]) ).
fof(f88,plain,
( empty_set = set_intersection2(sK3,sK4)
| ~ spl6_3 ),
inference(resolution,[],[f50,f72]) ).
fof(f72,plain,
( disjoint(sK3,sK4)
| ~ spl6_3 ),
inference(resolution,[],[f41,f66]) ).
fof(f66,plain,
( disjoint(sK4,sK3)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f50,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f36]) ).
fof(f81,plain,
( in(sK5,set_intersection2(sK3,sK4))
| ~ spl6_2 ),
inference(backward_demodulation,[],[f61,f51]) ).
fof(f61,plain,
( in(sK5,set_intersection2(sK4,sK3))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f59,plain,
( spl6_2
<=> in(sK5,set_intersection2(sK4,sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f68,plain,
( spl6_2
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f47,f64,f59]) ).
fof(f47,plain,
( ~ disjoint(sK4,sK3)
| in(sK5,set_intersection2(sK4,sK3)) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
( ( ~ disjoint(sK4,sK3)
& ! [X2] : ~ in(X2,set_intersection2(sK4,sK3)) )
| ( disjoint(sK4,sK3)
& in(sK5,set_intersection2(sK4,sK3)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f31,f33,f32]) ).
fof(f32,plain,
( ? [X0,X1] :
( ( ~ disjoint(X1,X0)
& ! [X2] : ~ in(X2,set_intersection2(X1,X0)) )
| ( disjoint(X1,X0)
& ? [X3] : in(X3,set_intersection2(X1,X0)) ) )
=> ( ( ~ disjoint(sK4,sK3)
& ! [X2] : ~ in(X2,set_intersection2(sK4,sK3)) )
| ( disjoint(sK4,sK3)
& ? [X3] : in(X3,set_intersection2(sK4,sK3)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
( ? [X3] : in(X3,set_intersection2(sK4,sK3))
=> in(sK5,set_intersection2(sK4,sK3)) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
? [X0,X1] :
( ( ~ disjoint(X1,X0)
& ! [X2] : ~ in(X2,set_intersection2(X1,X0)) )
| ( disjoint(X1,X0)
& ? [X3] : in(X3,set_intersection2(X1,X0)) ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
? [X0,X1] :
( ( ~ disjoint(X1,X0)
& ! [X3] : ~ in(X3,set_intersection2(X1,X0)) )
| ( disjoint(X1,X0)
& ? [X2] : in(X2,set_intersection2(X1,X0)) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
~ ! [X0,X1] :
( ~ ( ~ disjoint(X1,X0)
& ! [X3] : ~ in(X3,set_intersection2(X1,X0)) )
& ~ ( disjoint(X1,X0)
& ? [X2] : in(X2,set_intersection2(X1,X0)) ) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X1,X0] :
( ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) )
& ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X1,X0] :
( ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) )
& ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f67,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f46,f64,f56]) ).
fof(f46,plain,
! [X2] :
( disjoint(sK4,sK3)
| ~ in(X2,set_intersection2(sK4,sK3)) ),
inference(cnf_transformation,[],[f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/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.13/0.34 % Computer : n017.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 : Tue Aug 30 14:03:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (14832)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.49 % (14821)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.19/0.49 % (14824)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.49 % (14824)Instruction limit reached!
% 0.19/0.49 % (14824)------------------------------
% 0.19/0.49 % (14824)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (14832)First to succeed.
% 0.19/0.50 % (14824)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (14824)Termination reason: Unknown
% 0.19/0.50 % (14824)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (14824)Memory used [KB]: 895
% 0.19/0.50 % (14824)Time elapsed: 0.002 s
% 0.19/0.50 % (14824)Instructions burned: 2 (million)
% 0.19/0.50 % (14824)------------------------------
% 0.19/0.50 % (14824)------------------------------
% 0.19/0.50 % (14816)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.19/0.50 % (14832)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (14832)------------------------------
% 0.19/0.50 % (14832)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (14832)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (14832)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (14832)Memory used [KB]: 5500
% 0.19/0.50 % (14832)Time elapsed: 0.098 s
% 0.19/0.50 % (14832)Instructions burned: 4 (million)
% 0.19/0.50 % (14832)------------------------------
% 0.19/0.50 % (14832)------------------------------
% 0.19/0.50 % (14815)Success in time 0.15 s
%------------------------------------------------------------------------------