TSTP Solution File: SEU167+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU167+3 : 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 : n011.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:27:04 EDT 2022
% Result : Theorem 1.23s 0.52s
% Output : Refutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 59 ( 20 ~; 10 |; 21 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 47 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,plain,
$false,
inference(subsumption_resolution,[],[f49,f33]) ).
fof(f33,plain,
! [X0] : subset(cartesian_product2(X0,sK2),cartesian_product2(X0,sK1)),
inference(unit_resulting_resolution,[],[f26,f28]) ).
fof(f28,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X0,X2),cartesian_product2(X0,X1))
| ~ subset(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( subset(cartesian_product2(X0,X2),cartesian_product2(X0,X1))
& subset(cartesian_product2(X2,X0),cartesian_product2(X1,X0)) )
| ~ subset(X2,X1) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1,X2,X0] :
( ( subset(cartesian_product2(X1,X0),cartesian_product2(X1,X2))
& subset(cartesian_product2(X0,X1),cartesian_product2(X2,X1)) )
| ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1,X0,X2] :
( subset(X0,X2)
=> ( subset(cartesian_product2(X1,X0),cartesian_product2(X1,X2))
& subset(cartesian_product2(X0,X1),cartesian_product2(X2,X1)) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X2,X1] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
& subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_zfmisc_1) ).
fof(f26,plain,
subset(sK2,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( subset(sK2,sK1)
& subset(sK3,sK0)
& ~ subset(cartesian_product2(sK3,sK2),cartesian_product2(sK0,sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2,X3] :
( subset(X2,X1)
& subset(X3,X0)
& ~ subset(cartesian_product2(X3,X2),cartesian_product2(X0,X1)) )
=> ( subset(sK2,sK1)
& subset(sK3,sK0)
& ~ subset(cartesian_product2(sK3,sK2),cartesian_product2(sK0,sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1,X2,X3] :
( subset(X2,X1)
& subset(X3,X0)
& ~ subset(cartesian_product2(X3,X2),cartesian_product2(X0,X1)) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
? [X3,X0,X1,X2] :
( subset(X1,X0)
& subset(X2,X3)
& ~ subset(cartesian_product2(X2,X1),cartesian_product2(X3,X0)) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X0,X3,X1,X2] :
( ~ subset(cartesian_product2(X2,X1),cartesian_product2(X3,X0))
& subset(X2,X3)
& subset(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X3,X1,X2] :
( ( subset(X2,X3)
& subset(X1,X0) )
=> subset(cartesian_product2(X2,X1),cartesian_product2(X3,X0)) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X3,X2,X0,X1] :
( ( subset(X0,X1)
& subset(X2,X3) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X3,X2,X0,X1] :
( ( subset(X0,X1)
& subset(X2,X3) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t119_zfmisc_1) ).
fof(f49,plain,
~ subset(cartesian_product2(sK3,sK2),cartesian_product2(sK3,sK1)),
inference(unit_resulting_resolution,[],[f24,f32,f23]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| subset(X0,X1)
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ~ subset(X0,X2)
| subset(X0,X1)
| ~ subset(X2,X1) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X2,X0,X1] :
( subset(X0,X1)
| ~ subset(X0,X2)
| ~ subset(X2,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
! [X2,X0,X1] :
( ( subset(X0,X2)
& subset(X2,X1) )
=> subset(X0,X1) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0,X2,X1] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f32,plain,
! [X0] : subset(cartesian_product2(sK3,X0),cartesian_product2(sK0,X0)),
inference(unit_resulting_resolution,[],[f25,f27]) ).
fof(f27,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X2,X0),cartesian_product2(X1,X0))
| ~ subset(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f25,plain,
subset(sK3,sK0),
inference(cnf_transformation,[],[f20]) ).
fof(f24,plain,
~ subset(cartesian_product2(sK3,sK2),cartesian_product2(sK0,sK1)),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU167+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 30 14:42:55 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.51 % (19886)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.22/0.51 % (19902)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.51 % (19894)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.22/0.51 % (19886)Refutation not found, incomplete strategy% (19886)------------------------------
% 0.22/0.51 % (19886)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.51 % (19886)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.51 % (19886)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.51
% 0.22/0.51 % (19886)Memory used [KB]: 5884
% 0.22/0.51 % (19886)Time elapsed: 0.091 s
% 0.22/0.51 % (19886)Instructions burned: 2 (million)
% 0.22/0.51 % (19886)------------------------------
% 0.22/0.51 % (19886)------------------------------
% 0.22/0.51 % (19893)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 1.23/0.51 % (19889)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.23/0.51 % (19894)First to succeed.
% 1.23/0.52 % (19894)Refutation found. Thanks to Tanya!
% 1.23/0.52 % SZS status Theorem for theBenchmark
% 1.23/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.23/0.52 % (19894)------------------------------
% 1.23/0.52 % (19894)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.23/0.52 % (19894)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.23/0.52 % (19894)Termination reason: Refutation
% 1.23/0.52
% 1.23/0.52 % (19894)Memory used [KB]: 5884
% 1.23/0.52 % (19894)Time elapsed: 0.109 s
% 1.23/0.52 % (19894)Instructions burned: 2 (million)
% 1.23/0.52 % (19894)------------------------------
% 1.23/0.52 % (19894)------------------------------
% 1.23/0.52 % (19884)Success in time 0.153 s
%------------------------------------------------------------------------------