TSTP Solution File: SEU127+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU127+2 : 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_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:26:46 EDT 2022
% Result : Theorem 1.28s 0.52s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 127 ( 11 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 156 ( 57 ~; 53 |; 34 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 75 ( 64 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f220,plain,
$false,
inference(unit_resulting_resolution,[],[f141,f200,f137]) ).
fof(f137,plain,
! [X0,X1] :
( ~ in(sK3(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f92,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( ~ in(sK3(X0,X1),X0)
& in(sK3(X0,X1),X1) ) )
& ( ! [X3] :
( in(X3,X0)
| ~ in(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f90,f91]) ).
fof(f91,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) )
=> ( ~ in(sK3(X0,X1),X0)
& in(sK3(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) ) )
& ( ! [X3] :
( in(X3,X0)
| ~ in(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f89]) ).
fof(f89,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) ) )
& ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0,X1] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f200,plain,
in(sK3(sK6,set_intersection2(sK6,sK5)),sK6),
inference(resolution,[],[f195,f169]) ).
fof(f169,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X1,X0))
| in(X4,X1) ),
inference(equality_resolution,[],[f151]) ).
fof(f151,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X1,X0) != X2 ),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( set_intersection2(X1,X0) = X2
| ( ( ~ in(sK8(X0,X1,X2),X0)
| ~ in(sK8(X0,X1,X2),X1)
| ~ in(sK8(X0,X1,X2),X2) )
& ( ( in(sK8(X0,X1,X2),X0)
& in(sK8(X0,X1,X2),X1) )
| in(sK8(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X1,X0) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f101,f102]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) )
=> ( ( ~ in(sK8(X0,X1,X2),X0)
| ~ in(sK8(X0,X1,X2),X1)
| ~ in(sK8(X0,X1,X2),X2) )
& ( ( in(sK8(X0,X1,X2),X0)
& in(sK8(X0,X1,X2),X1) )
| in(sK8(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ( set_intersection2(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X1,X0) != X2 ) ),
inference(rectify,[],[f100]) ).
fof(f100,plain,
! [X0,X2,X1] :
( ( set_intersection2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X2) )
| in(X3,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X2) )
| ~ in(X3,X1) ) )
| set_intersection2(X2,X0) != X1 ) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
! [X0,X2,X1] :
( ( set_intersection2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X2) )
| in(X3,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X2) )
| ~ in(X3,X1) ) )
| set_intersection2(X2,X0) != X1 ) ),
inference(nnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X2,X1] :
( set_intersection2(X2,X0) = X1
<=> ! [X3] :
( in(X3,X1)
<=> ( in(X3,X0)
& in(X3,X2) ) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X2,X0] :
( ! [X3] :
( ( in(X3,X1)
& in(X3,X0) )
<=> in(X3,X2) )
<=> set_intersection2(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f195,plain,
in(sK3(sK6,set_intersection2(sK6,sK5)),set_intersection2(sK6,sK5)),
inference(resolution,[],[f141,f136]) ).
fof(f136,plain,
! [X0,X1] :
( subset(X1,X0)
| in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f141,plain,
~ subset(set_intersection2(sK6,sK5),sK6),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
~ subset(set_intersection2(sK6,sK5),sK6),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f57,f95]) ).
fof(f95,plain,
( ? [X0,X1] : ~ subset(set_intersection2(X1,X0),X1)
=> ~ subset(set_intersection2(sK6,sK5),sK6) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
? [X0,X1] : ~ subset(set_intersection2(X1,X0),X1),
inference(ennf_transformation,[],[f52]) ).
fof(f52,plain,
~ ! [X0,X1] : subset(set_intersection2(X1,X0),X1),
inference(rectify,[],[f24]) ).
fof(f24,negated_conjecture,
~ ! [X1,X0] : subset(set_intersection2(X0,X1),X0),
inference(negated_conjecture,[],[f23]) ).
fof(f23,conjecture,
! [X1,X0] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU127+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 14:38:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (23429)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 1.28/0.51 % (23417)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)
% 1.28/0.51 % (23437)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 1.28/0.51 % (23438)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 1.28/0.51 % (23414)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.28/0.52 % (23415)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.28/0.52 % (23438)First to succeed.
% 1.28/0.52 % (23422)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.28/0.52 % (23430)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)
% 1.28/0.52 % (23421)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.28/0.52 % (23413)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)
% 1.28/0.52 % (23412)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)
% 1.28/0.52 % (23412)Instruction limit reached!
% 1.28/0.52 % (23412)------------------------------
% 1.28/0.52 % (23412)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.28/0.52 % (23412)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.28/0.52 % (23412)Termination reason: Unknown
% 1.28/0.52 % (23412)Termination phase: Saturation
% 1.28/0.52
% 1.28/0.52 % (23412)Memory used [KB]: 1535
% 1.28/0.52 % (23412)Time elapsed: 0.003 s
% 1.28/0.52 % (23412)Instructions burned: 3 (million)
% 1.28/0.52 % (23412)------------------------------
% 1.28/0.52 % (23412)------------------------------
% 1.28/0.52 % (23411)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)
% 1.28/0.52 % (23438)Refutation found. Thanks to Tanya!
% 1.28/0.52 % SZS status Theorem for theBenchmark
% 1.28/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.28/0.52 % (23438)------------------------------
% 1.28/0.52 % (23438)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.28/0.52 % (23438)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.28/0.52 % (23438)Termination reason: Refutation
% 1.28/0.52
% 1.28/0.52 % (23438)Memory used [KB]: 6012
% 1.28/0.52 % (23438)Time elapsed: 0.124 s
% 1.28/0.52 % (23438)Instructions burned: 5 (million)
% 1.28/0.52 % (23438)------------------------------
% 1.28/0.52 % (23438)------------------------------
% 1.28/0.52 % (23409)Success in time 0.176 s
%------------------------------------------------------------------------------