TSTP Solution File: SET974+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET974+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_uns --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:22:55 EDT 2022
% Result : Theorem 0.21s 0.60s
% Output : Refutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 7 unt; 0 def)
% Number of atoms : 99 ( 7 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 103 ( 41 ~; 25 |; 29 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-5 aty)
% Number of variables : 107 ( 85 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f132,plain,
$false,
inference(avatar_sat_refutation,[],[f68,f129,f131]) ).
fof(f131,plain,
~ spl9_2,
inference(avatar_contradiction_clause,[],[f130]) ).
fof(f130,plain,
( $false
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f122,f67]) ).
fof(f67,plain,
( disjoint(sK5,sK3)
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f65]) ).
fof(f65,plain,
( spl9_2
<=> disjoint(sK5,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f122,plain,
~ disjoint(sK5,sK3),
inference(resolution,[],[f86,f101]) ).
fof(f101,plain,
! [X8,X6,X9,X7,X5] :
( ~ in(X5,set_intersection2(cartesian_product2(X6,X7),cartesian_product2(X8,X9)))
| ~ disjoint(X7,X9) ),
inference(resolution,[],[f44,f56]) ).
fof(f56,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X1,X0))
| ~ disjoint(X1,X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ( disjoint(X1,X0)
| in(sK8(X0,X1),set_intersection2(X1,X0)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X1,X0))
| ~ disjoint(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f26,f40]) ).
fof(f40,plain,
! [X0,X1] :
( ? [X2] : in(X2,set_intersection2(X1,X0))
=> in(sK8(X0,X1),set_intersection2(X1,X0)) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0,X1] :
( ( disjoint(X1,X0)
| ? [X2] : in(X2,set_intersection2(X1,X0)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X1,X0))
| ~ disjoint(X1,X0) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,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,[],[f13]) ).
fof(f13,axiom,
! [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/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f44,plain,
! [X2,X3,X0,X1,X4] :
( in(sK1(X0,X1,X2,X3,X4),set_intersection2(X3,X0))
| ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X0))) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2,X3,X4] :
( ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X0)))
| ( in(sK1(X0,X1,X2,X3,X4),set_intersection2(X3,X0))
& ordered_pair(sK0(X0,X1,X2,X3,X4),sK1(X0,X1,X2,X3,X4)) = X1
& in(sK0(X0,X1,X2,X3,X4),set_intersection2(X2,X4)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f27,f28]) ).
fof(f28,plain,
! [X0,X1,X2,X3,X4] :
( ? [X5,X6] :
( in(X6,set_intersection2(X3,X0))
& ordered_pair(X5,X6) = X1
& in(X5,set_intersection2(X2,X4)) )
=> ( in(sK1(X0,X1,X2,X3,X4),set_intersection2(X3,X0))
& ordered_pair(sK0(X0,X1,X2,X3,X4),sK1(X0,X1,X2,X3,X4)) = X1
& in(sK0(X0,X1,X2,X3,X4),set_intersection2(X2,X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1,X2,X3,X4] :
( ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X0)))
| ? [X5,X6] :
( in(X6,set_intersection2(X3,X0))
& ordered_pair(X5,X6) = X1
& in(X5,set_intersection2(X2,X4)) ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X4,X0,X2,X3,X1] :
( ~ in(X0,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X1,X4)))
| ? [X5,X6] :
( in(X6,set_intersection2(X3,X4))
& ordered_pair(X5,X6) = X0
& in(X5,set_intersection2(X2,X1)) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X3,X0,X2,X1,X4] :
~ ( in(X0,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X1,X4)))
& ! [X6,X5] :
~ ( in(X6,set_intersection2(X3,X4))
& ordered_pair(X5,X6) = X0
& in(X5,set_intersection2(X2,X1)) ) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X0,X3,X1,X2,X4] :
~ ( ! [X5,X6] :
~ ( in(X5,set_intersection2(X1,X3))
& in(X6,set_intersection2(X2,X4))
& ordered_pair(X5,X6) = X0 )
& in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t104_zfmisc_1) ).
fof(f86,plain,
in(sK8(cartesian_product2(sK4,sK3),cartesian_product2(sK2,sK5)),set_intersection2(cartesian_product2(sK2,sK5),cartesian_product2(sK4,sK3))),
inference(resolution,[],[f57,f48]) ).
fof(f48,plain,
~ disjoint(cartesian_product2(sK2,sK5),cartesian_product2(sK4,sK3)),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
( ~ disjoint(cartesian_product2(sK2,sK5),cartesian_product2(sK4,sK3))
& ( disjoint(sK2,sK4)
| disjoint(sK5,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f30,f31]) ).
fof(f31,plain,
( ? [X0,X1,X2,X3] :
( ~ disjoint(cartesian_product2(X0,X3),cartesian_product2(X2,X1))
& ( disjoint(X0,X2)
| disjoint(X3,X1) ) )
=> ( ~ disjoint(cartesian_product2(sK2,sK5),cartesian_product2(sK4,sK3))
& ( disjoint(sK2,sK4)
| disjoint(sK5,sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
? [X0,X1,X2,X3] :
( ~ disjoint(cartesian_product2(X0,X3),cartesian_product2(X2,X1))
& ( disjoint(X0,X2)
| disjoint(X3,X1) ) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
? [X2,X1,X3,X0] :
( ~ disjoint(cartesian_product2(X2,X0),cartesian_product2(X3,X1))
& ( disjoint(X2,X3)
| disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1,X2,X3] :
( ( disjoint(X2,X3)
| disjoint(X0,X1) )
=> disjoint(cartesian_product2(X2,X0),cartesian_product2(X3,X1)) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X2,X3,X0,X1] :
( ( disjoint(X2,X3)
| disjoint(X0,X1) )
=> disjoint(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X2,X3,X0,X1] :
( ( disjoint(X2,X3)
| disjoint(X0,X1) )
=> disjoint(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t127_zfmisc_1) ).
fof(f57,plain,
! [X0,X1] :
( disjoint(X1,X0)
| in(sK8(X0,X1),set_intersection2(X1,X0)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f129,plain,
~ spl9_1,
inference(avatar_split_clause,[],[f124,f61]) ).
fof(f61,plain,
( spl9_1
<=> disjoint(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f124,plain,
~ disjoint(sK2,sK4),
inference(resolution,[],[f86,f89]) ).
fof(f89,plain,
! [X8,X6,X9,X7,X5] :
( ~ in(X5,set_intersection2(cartesian_product2(X6,X7),cartesian_product2(X8,X9)))
| ~ disjoint(X6,X8) ),
inference(resolution,[],[f42,f56]) ).
fof(f42,plain,
! [X2,X3,X0,X1,X4] :
( in(sK0(X0,X1,X2,X3,X4),set_intersection2(X2,X4))
| ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X0))) ),
inference(cnf_transformation,[],[f29]) ).
fof(f68,plain,
( spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f47,f65,f61]) ).
fof(f47,plain,
( disjoint(sK5,sK3)
| disjoint(sK2,sK4) ),
inference(cnf_transformation,[],[f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET974+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 14:42:57 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.58 % (10020)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.58 % (9999)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.58 % (9999)Refutation not found, incomplete strategy% (9999)------------------------------
% 0.21/0.58 % (9999)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.58 % (9999)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.58 % (9999)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.58
% 0.21/0.58 % (9999)Memory used [KB]: 5884
% 0.21/0.58 % (9999)Time elapsed: 0.151 s
% 0.21/0.58 % (9999)Instructions burned: 2 (million)
% 0.21/0.58 % (9999)------------------------------
% 0.21/0.58 % (9999)------------------------------
% 0.21/0.58 % (10012)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.59 % (10020)Refutation not found, incomplete strategy% (10020)------------------------------
% 0.21/0.59 % (10020)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.59 % (10020)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.59 % (10020)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.59
% 0.21/0.59 % (10020)Memory used [KB]: 1535
% 0.21/0.59 % (10020)Time elapsed: 0.085 s
% 0.21/0.59 % (10020)Instructions burned: 4 (million)
% 0.21/0.59 % (10020)------------------------------
% 0.21/0.59 % (10020)------------------------------
% 0.21/0.59 % (10004)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.59 % (10012)First to succeed.
% 0.21/0.60 % (10000)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.60 % (9998)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.60 % (9998)Refutation not found, incomplete strategy% (9998)------------------------------
% 0.21/0.60 % (9998)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.60 % (9998)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.60 % (9998)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.60
% 0.21/0.60 % (9998)Memory used [KB]: 5884
% 0.21/0.60 % (9998)Time elapsed: 0.177 s
% 0.21/0.60 % (9998)Instructions burned: 1 (million)
% 0.21/0.60 % (9998)------------------------------
% 0.21/0.60 % (9998)------------------------------
% 0.21/0.60 % (10012)Refutation found. Thanks to Tanya!
% 0.21/0.60 % SZS status Theorem for theBenchmark
% 0.21/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.76/0.60 % (10012)------------------------------
% 1.76/0.60 % (10012)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.76/0.60 % (10012)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.76/0.60 % (10012)Termination reason: Refutation
% 1.76/0.60
% 1.76/0.60 % (10012)Memory used [KB]: 6012
% 1.76/0.60 % (10012)Time elapsed: 0.090 s
% 1.76/0.60 % (10012)Instructions burned: 6 (million)
% 1.76/0.60 % (10012)------------------------------
% 1.76/0.60 % (10012)------------------------------
% 1.76/0.60 % (9996)Success in time 0.24 s
%------------------------------------------------------------------------------