TSTP Solution File: SEU127+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_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:32:02 EDT 2022
% Result : Theorem 1.47s 0.55s
% Output : Refutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 132 ( 11 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 160 ( 60 ~; 56 |; 34 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 79 ( 68 !; 11 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_6,type,
sQ11_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_7,type,
sQ12_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_8,type,
sQ13_eqProxy: ( $real * $real ) > $o ).
fof(f575,plain,
$false,
inference(subsumption_resolution,[],[f567,f172]) ).
fof(f172,plain,
~ subset(set_intersection2(sK5,sK4),sK5),
inference(literal_reordering,[],[f129]) ).
fof(f129,plain,
~ subset(set_intersection2(sK5,sK4),sK5),
inference(cnf_transformation,[],[f89]) ).
fof(f89,plain,
~ subset(set_intersection2(sK5,sK4),sK5),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f54,f88]) ).
fof(f88,plain,
( ? [X0,X1] : ~ subset(set_intersection2(X1,X0),X1)
=> ~ subset(set_intersection2(sK5,sK4),sK5) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
? [X0,X1] : ~ subset(set_intersection2(X1,X0),X1),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
~ ! [X1,X0] : 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/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f567,plain,
subset(set_intersection2(sK5,sK4),sK5),
inference(resolution,[],[f507,f208]) ).
fof(f208,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(literal_reordering,[],[f110]) ).
fof(f110,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f71,f72]) ).
fof(f72,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) )
=> ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f71,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) ) ) ),
inference(rectify,[],[f70]) ).
fof(f70,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) ) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0,X1] :
( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f507,plain,
in(sK0(set_intersection2(sK5,sK4),sK5),sK5),
inference(resolution,[],[f337,f218]) ).
fof(f218,plain,
! [X2,X3,X1] :
( ~ in(X3,set_intersection2(X1,X2))
| in(X3,X1) ),
inference(literal_reordering,[],[f168]) ).
fof(f168,plain,
! [X2,X3,X1] :
( ~ in(X3,set_intersection2(X1,X2))
| in(X3,X1) ),
inference(equality_resolution,[],[f157]) ).
fof(f157,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| set_intersection2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X1) )
| ~ in(X3,X0) )
& ( in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) ) )
| set_intersection2(X1,X2) != X0 )
& ( set_intersection2(X1,X2) = X0
| ( ( ~ in(sK8(X0,X1,X2),X0)
| ~ in(sK8(X0,X1,X2),X2)
| ~ in(sK8(X0,X1,X2),X1) )
& ( in(sK8(X0,X1,X2),X0)
| ( in(sK8(X0,X1,X2),X2)
& in(sK8(X0,X1,X2),X1) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f105,f106]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X0)
| ~ in(X4,X2)
| ~ in(X4,X1) )
& ( in(X4,X0)
| ( in(X4,X2)
& in(X4,X1) ) ) )
=> ( ( ~ in(sK8(X0,X1,X2),X0)
| ~ in(sK8(X0,X1,X2),X2)
| ~ in(sK8(X0,X1,X2),X1) )
& ( in(sK8(X0,X1,X2),X0)
| ( in(sK8(X0,X1,X2),X2)
& in(sK8(X0,X1,X2),X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X1) )
| ~ in(X3,X0) )
& ( in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) ) )
| set_intersection2(X1,X2) != X0 )
& ( set_intersection2(X1,X2) = X0
| ? [X4] :
( ( ~ in(X4,X0)
| ~ in(X4,X2)
| ~ in(X4,X1) )
& ( in(X4,X0)
| ( in(X4,X2)
& in(X4,X1) ) ) ) ) ),
inference(rectify,[],[f104]) ).
fof(f104,plain,
! [X1,X2,X0] :
( ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X2) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) ) )
| set_intersection2(X2,X0) != X1 )
& ( set_intersection2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( in(X3,X1)
| ( in(X3,X0)
& in(X3,X2) ) ) ) ) ),
inference(flattening,[],[f103]) ).
fof(f103,plain,
! [X1,X2,X0] :
( ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X2) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) ) )
| set_intersection2(X2,X0) != X1 )
& ( set_intersection2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( in(X3,X1)
| ( in(X3,X0)
& in(X3,X2) ) ) ) ) ),
inference(nnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X1,X2,X0] :
( ! [X3] :
( ( in(X3,X0)
& in(X3,X2) )
<=> in(X3,X1) )
<=> set_intersection2(X2,X0) = X1 ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X2,X0] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( ( in(X3,X0)
& in(X3,X1) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f337,plain,
in(sK0(set_intersection2(sK5,sK4),sK5),set_intersection2(sK5,sK4)),
inference(resolution,[],[f189,f172]) ).
fof(f189,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(literal_reordering,[],[f111]) ).
fof(f111,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU127+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 14:04:35 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.52 % (19542)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.21/0.52 % (19540)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (19541)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.52 TRYING [1]
% 0.21/0.52 % (19548)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.52 TRYING [2]
% 0.21/0.52 TRYING [3]
% 0.21/0.53 % (19563)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.21/0.53 % (19550)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.21/0.53 % (19542)Instruction limit reached!
% 0.21/0.53 % (19542)------------------------------
% 0.21/0.53 % (19542)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (19542)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (19542)Termination reason: Unknown
% 0.21/0.53 % (19542)Termination phase: Blocked clause elimination
% 0.21/0.53
% 0.21/0.53 % (19542)Memory used [KB]: 895
% 0.21/0.53 % (19542)Time elapsed: 0.003 s
% 0.21/0.53 % (19542)Instructions burned: 3 (million)
% 0.21/0.53 % (19542)------------------------------
% 0.21/0.53 % (19542)------------------------------
% 0.21/0.54 % (19548)First to succeed.
% 0.21/0.54 TRYING [4]
% 0.21/0.54 % (19557)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.47/0.54 % (19556)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.47/0.54 % (19541)Instruction limit reached!
% 1.47/0.54 % (19541)------------------------------
% 1.47/0.54 % (19541)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.54 % (19541)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.54 % (19541)Termination reason: Unknown
% 1.47/0.54 % (19541)Termination phase: Saturation
% 1.47/0.54
% 1.47/0.54 % (19541)Memory used [KB]: 5500
% 1.47/0.54 % (19541)Time elapsed: 0.128 s
% 1.47/0.54 % (19541)Instructions burned: 8 (million)
% 1.47/0.54 % (19541)------------------------------
% 1.47/0.54 % (19541)------------------------------
% 1.47/0.55 % (19549)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.47/0.55 % (19539)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)
% 1.47/0.55 % (19560)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.47/0.55 % (19536)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.47/0.55 % (19546)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.47/0.55 % (19548)Refutation found. Thanks to Tanya!
% 1.47/0.55 % SZS status Theorem for theBenchmark
% 1.47/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 1.47/0.55 % (19548)------------------------------
% 1.47/0.55 % (19548)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.55 % (19548)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.55 % (19548)Termination reason: Refutation
% 1.47/0.55
% 1.47/0.55 % (19548)Memory used [KB]: 6012
% 1.47/0.55 % (19548)Time elapsed: 0.017 s
% 1.47/0.55 % (19548)Instructions burned: 19 (million)
% 1.47/0.55 % (19548)------------------------------
% 1.47/0.55 % (19548)------------------------------
% 1.47/0.55 % (19533)Success in time 0.198 s
%------------------------------------------------------------------------------