TSTP Solution File: SET983+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET983+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 : n009.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:56 EDT 2022
% Result : Theorem 0.17s 0.51s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 128 ( 19 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 145 ( 51 ~; 44 |; 41 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 98 ( 74 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f74,plain,
$false,
inference(subsumption_resolution,[],[f73,f53]) ).
fof(f53,plain,
~ in(sK4,set_intersection2(cartesian_product2(sK0,sK3),cartesian_product2(sK2,sK1))),
inference(forward_demodulation,[],[f52,f39]) ).
fof(f39,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f11]) ).
fof(f11,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/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f52,plain,
~ in(sK4,set_intersection2(cartesian_product2(sK2,sK1),cartesian_product2(sK0,sK3))),
inference(forward_demodulation,[],[f37,f40]) ).
fof(f40,plain,
! [X2,X3,X0,X1] : set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X0)) = cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X0)),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2,X3] : set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X0)) = cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X0)),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X2,X0,X1,X3] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X3,X2)) = set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2)),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X3,X2] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(f37,plain,
~ in(sK4,cartesian_product2(set_intersection2(sK2,sK0),set_intersection2(sK1,sK3))),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( ~ in(sK4,cartesian_product2(set_intersection2(sK2,sK0),set_intersection2(sK1,sK3)))
& in(sK4,cartesian_product2(sK0,sK3))
& in(sK4,cartesian_product2(sK2,sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f19,f20]) ).
fof(f20,plain,
( ? [X0,X1,X2,X3,X4] :
( ~ in(X4,cartesian_product2(set_intersection2(X2,X0),set_intersection2(X1,X3)))
& in(X4,cartesian_product2(X0,X3))
& in(X4,cartesian_product2(X2,X1)) )
=> ( ~ in(sK4,cartesian_product2(set_intersection2(sK2,sK0),set_intersection2(sK1,sK3)))
& in(sK4,cartesian_product2(sK0,sK3))
& in(sK4,cartesian_product2(sK2,sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0,X1,X2,X3,X4] :
( ~ in(X4,cartesian_product2(set_intersection2(X2,X0),set_intersection2(X1,X3)))
& in(X4,cartesian_product2(X0,X3))
& in(X4,cartesian_product2(X2,X1)) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
? [X1,X3,X0,X2,X4] :
( ~ in(X4,cartesian_product2(set_intersection2(X0,X1),set_intersection2(X3,X2)))
& in(X4,cartesian_product2(X1,X2))
& in(X4,cartesian_product2(X0,X3)) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
? [X3,X2,X1,X0,X4] :
( ~ in(X4,cartesian_product2(set_intersection2(X0,X1),set_intersection2(X3,X2)))
& in(X4,cartesian_product2(X0,X3))
& in(X4,cartesian_product2(X1,X2)) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
~ ! [X3,X2,X1,X0,X4] :
( ( in(X4,cartesian_product2(X0,X3))
& in(X4,cartesian_product2(X1,X2)) )
=> in(X4,cartesian_product2(set_intersection2(X0,X1),set_intersection2(X3,X2))) ),
inference(rectify,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X1,X3,X4,X2,X0] :
( ( in(X0,cartesian_product2(X3,X4))
& in(X0,cartesian_product2(X1,X2)) )
=> in(X0,cartesian_product2(set_intersection2(X1,X3),set_intersection2(X2,X4))) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X1,X3,X4,X2,X0] :
( ( in(X0,cartesian_product2(X3,X4))
& in(X0,cartesian_product2(X1,X2)) )
=> in(X0,cartesian_product2(set_intersection2(X1,X3),set_intersection2(X2,X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t137_zfmisc_1) ).
fof(f73,plain,
in(sK4,set_intersection2(cartesian_product2(sK0,sK3),cartesian_product2(sK2,sK1))),
inference(forward_demodulation,[],[f71,f39]) ).
fof(f71,plain,
in(sK4,set_intersection2(cartesian_product2(sK2,sK1),cartesian_product2(sK0,sK3))),
inference(resolution,[],[f62,f36]) ).
fof(f36,plain,
in(sK4,cartesian_product2(sK0,sK3)),
inference(cnf_transformation,[],[f21]) ).
fof(f62,plain,
! [X0] :
( ~ in(sK4,X0)
| in(sK4,set_intersection2(cartesian_product2(sK2,sK1),X0)) ),
inference(resolution,[],[f49,f35]) ).
fof(f35,plain,
in(sK4,cartesian_product2(sK2,sK1)),
inference(cnf_transformation,[],[f21]) ).
fof(f49,plain,
! [X2,X3,X0] :
( ~ in(X3,X0)
| in(X3,set_intersection2(X0,X2))
| ~ in(X3,X2) ),
inference(equality_resolution,[],[f47]) ).
fof(f47,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0)
| set_intersection2(X0,X2) != X1 ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( ( in(X3,X2)
& in(X3,X0) )
| ~ in(X3,X1) ) )
| set_intersection2(X0,X2) != X1 )
& ( set_intersection2(X0,X2) = X1
| ( ( ~ in(sK7(X0,X1,X2),X2)
| ~ in(sK7(X0,X1,X2),X0)
| ~ in(sK7(X0,X1,X2),X1) )
& ( ( in(sK7(X0,X1,X2),X2)
& in(sK7(X0,X1,X2),X0) )
| in(sK7(X0,X1,X2),X1) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f30,f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X2)
& in(X4,X0) )
| in(X4,X1) ) )
=> ( ( ~ in(sK7(X0,X1,X2),X2)
| ~ in(sK7(X0,X1,X2),X0)
| ~ in(sK7(X0,X1,X2),X1) )
& ( ( in(sK7(X0,X1,X2),X2)
& in(sK7(X0,X1,X2),X0) )
| in(sK7(X0,X1,X2),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( ( in(X3,X2)
& in(X3,X0) )
| ~ in(X3,X1) ) )
| set_intersection2(X0,X2) != X1 )
& ( set_intersection2(X0,X2) = X1
| ? [X4] :
( ( ~ in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X2)
& in(X4,X0) )
| in(X4,X1) ) ) ) ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X2) )
| ~ in(X3,X0) ) )
| set_intersection2(X2,X1) != X0 )
& ( set_intersection2(X2,X1) = X0
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X2) )
| in(X3,X0) ) ) ) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X2) )
| ~ in(X3,X0) ) )
| set_intersection2(X2,X1) != X0 )
& ( set_intersection2(X2,X1) = X0
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X2) )
| in(X3,X0) ) ) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X2,X0,X1] :
( ! [X3] :
( in(X3,X0)
<=> ( in(X3,X1)
& in(X3,X2) ) )
<=> set_intersection2(X2,X1) = X0 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X2,X1,X0] :
( ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) )
<=> set_intersection2(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 14:31:05 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.49 % (4660)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.17/0.49 % (4645)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.17/0.50 % (4645)Refutation not found, incomplete strategy% (4645)------------------------------
% 0.17/0.50 % (4645)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (4645)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (4645)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.50
% 0.17/0.50 % (4645)Memory used [KB]: 5884
% 0.17/0.50 % (4645)Time elapsed: 0.109 s
% 0.17/0.50 % (4645)Instructions burned: 2 (million)
% 0.17/0.50 % (4645)------------------------------
% 0.17/0.50 % (4645)------------------------------
% 0.17/0.50 % (4652)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.17/0.50 % (4655)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.17/0.50 TRYING [1]
% 0.17/0.50 % (4660)First to succeed.
% 0.17/0.50 TRYING [1]
% 0.17/0.50 % (4652)Instruction limit reached!
% 0.17/0.50 % (4652)------------------------------
% 0.17/0.50 % (4652)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (4652)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (4652)Termination reason: Unknown
% 0.17/0.50 % (4652)Termination phase: Finite model building constraint generation
% 0.17/0.50
% 0.17/0.50 % (4652)Memory used [KB]: 5884
% 0.17/0.50 % (4652)Time elapsed: 0.006 s
% 0.17/0.50 % (4652)Instructions burned: 4 (million)
% 0.17/0.50 % (4652)------------------------------
% 0.17/0.50 % (4652)------------------------------
% 0.17/0.51 % (4660)Refutation found. Thanks to Tanya!
% 0.17/0.51 % SZS status Theorem for theBenchmark
% 0.17/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.51 % (4660)------------------------------
% 0.17/0.51 % (4660)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.51 % (4660)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.51 % (4660)Termination reason: Refutation
% 0.17/0.51
% 0.17/0.51 % (4660)Memory used [KB]: 6012
% 0.17/0.51 % (4660)Time elapsed: 0.123 s
% 0.17/0.51 % (4660)Instructions burned: 3 (million)
% 0.17/0.51 % (4660)------------------------------
% 0.17/0.51 % (4660)------------------------------
% 0.17/0.51 % (4634)Success in time 0.179 s
%------------------------------------------------------------------------------