TSTP Solution File: SWC086+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC086+1 : TPTP v8.1.0. Released v2.4.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 : n022.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:41:39 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 14 unt; 0 def)
% Number of atoms : 258 ( 72 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 301 ( 92 ~; 89 |; 106 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 52 ( 26 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f630,plain,
$false,
inference(subsumption_resolution,[],[f628,f444]) ).
fof(f444,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f628,plain,
~ ssList(nil),
inference(resolution,[],[f627,f365]) ).
fof(f365,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).
fof(f627,plain,
~ segmentP(nil,nil),
inference(forward_demodulation,[],[f621,f612]) ).
fof(f612,plain,
nil = sK8,
inference(subsumption_resolution,[],[f609,f381]) ).
fof(f381,plain,
ssList(sK7),
inference(cnf_transformation,[],[f241]) ).
fof(f241,plain,
( ssList(sK8)
& sK10 = sK8
& sK9 = sK7
& ssList(sK10)
& neq(sK8,nil)
& ( ( nil = sK9
& nil = sK10 )
| ( segmentP(sK10,sK9)
& neq(sK9,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4) )
& ssList(sK9)
& ssList(sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10])],[f176,f240,f239,f238,f237]) ).
fof(f237,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ssList(X3)
& neq(X1,nil)
& ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(X0,X4) ) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& sK7 = X2
& ssList(X3)
& neq(X1,nil)
& ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4) ) )
& ssList(X2) ) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f238,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& sK7 = X2
& ssList(X3)
& neq(X1,nil)
& ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4) ) )
& ssList(X2) ) )
=> ( ssList(sK8)
& ? [X2] :
( ? [X3] :
( sK8 = X3
& sK7 = X2
& ssList(X3)
& neq(sK8,nil)
& ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4) ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f239,plain,
( ? [X2] :
( ? [X3] :
( sK8 = X3
& sK7 = X2
& ssList(X3)
& neq(sK8,nil)
& ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK8 = X3
& sK9 = sK7
& ssList(X3)
& neq(sK8,nil)
& ( ( nil = sK9
& nil = X3 )
| ( segmentP(X3,sK9)
& neq(sK9,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4) ) )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f240,plain,
( ? [X3] :
( sK8 = X3
& sK9 = sK7
& ssList(X3)
& neq(sK8,nil)
& ( ( nil = sK9
& nil = X3 )
| ( segmentP(X3,sK9)
& neq(sK9,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4) ) )
=> ( sK10 = sK8
& sK9 = sK7
& ssList(sK10)
& neq(sK8,nil)
& ( ( nil = sK9
& nil = sK10 )
| ( segmentP(sK10,sK9)
& neq(sK9,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ssList(X3)
& neq(X1,nil)
& ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(X0,X4) ) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f175]) ).
fof(f175,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(X0,X4) )
& neq(X1,nil)
& X0 = X2
& ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ? [X4] :
( segmentP(X1,X4)
& segmentP(X0,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ? [X4] :
( segmentP(X1,X4)
& segmentP(X0,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f609,plain,
( ~ ssList(sK7)
| nil = sK8 ),
inference(resolution,[],[f492,f604]) ).
fof(f604,plain,
( ~ segmentP(sK7,sK7)
| nil = sK8 ),
inference(subsumption_resolution,[],[f603,f562]) ).
fof(f562,plain,
( segmentP(sK8,sK7)
| nil = sK8 ),
inference(definition_unfolding,[],[f385,f391,f391,f390]) ).
fof(f390,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f241]) ).
fof(f391,plain,
sK10 = sK8,
inference(cnf_transformation,[],[f241]) ).
fof(f385,plain,
( nil = sK10
| segmentP(sK10,sK9) ),
inference(cnf_transformation,[],[f241]) ).
fof(f603,plain,
( ~ segmentP(sK7,sK7)
| ~ segmentP(sK8,sK7)
| nil = sK8 ),
inference(subsumption_resolution,[],[f600,f381]) ).
fof(f600,plain,
( nil = sK8
| ~ ssList(sK7)
| ~ segmentP(sK8,sK7)
| ~ segmentP(sK7,sK7) ),
inference(resolution,[],[f383,f563]) ).
fof(f563,plain,
( neq(sK7,nil)
| nil = sK8 ),
inference(definition_unfolding,[],[f384,f391,f390]) ).
fof(f384,plain,
( nil = sK10
| neq(sK9,nil) ),
inference(cnf_transformation,[],[f241]) ).
fof(f383,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK8,X4)
| ~ segmentP(sK7,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f241]) ).
fof(f492,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f621,plain,
~ segmentP(nil,sK8),
inference(forward_demodulation,[],[f611,f610]) ).
fof(f610,plain,
nil = sK7,
inference(subsumption_resolution,[],[f608,f381]) ).
fof(f608,plain,
( nil = sK7
| ~ ssList(sK7) ),
inference(resolution,[],[f492,f606]) ).
fof(f606,plain,
( ~ segmentP(sK7,sK7)
| nil = sK7 ),
inference(subsumption_resolution,[],[f605,f560]) ).
fof(f560,plain,
( segmentP(sK8,sK7)
| nil = sK7 ),
inference(definition_unfolding,[],[f387,f390,f391,f390]) ).
fof(f387,plain,
( nil = sK9
| segmentP(sK10,sK9) ),
inference(cnf_transformation,[],[f241]) ).
fof(f605,plain,
( ~ segmentP(sK8,sK7)
| nil = sK7
| ~ segmentP(sK7,sK7) ),
inference(subsumption_resolution,[],[f601,f381]) ).
fof(f601,plain,
( ~ segmentP(sK8,sK7)
| nil = sK7
| ~ ssList(sK7)
| ~ segmentP(sK7,sK7) ),
inference(resolution,[],[f383,f561]) ).
fof(f561,plain,
( neq(sK7,nil)
| nil = sK7 ),
inference(definition_unfolding,[],[f386,f390,f390]) ).
fof(f386,plain,
( nil = sK9
| neq(sK9,nil) ),
inference(cnf_transformation,[],[f241]) ).
fof(f611,plain,
~ segmentP(sK7,sK8),
inference(subsumption_resolution,[],[f607,f392]) ).
fof(f392,plain,
ssList(sK8),
inference(cnf_transformation,[],[f241]) ).
fof(f607,plain,
( ~ ssList(sK8)
| ~ segmentP(sK7,sK8) ),
inference(resolution,[],[f492,f602]) ).
fof(f602,plain,
( ~ segmentP(sK8,sK8)
| ~ segmentP(sK7,sK8) ),
inference(subsumption_resolution,[],[f599,f392]) ).
fof(f599,plain,
( ~ segmentP(sK7,sK8)
| ~ ssList(sK8)
| ~ segmentP(sK8,sK8) ),
inference(resolution,[],[f383,f388]) ).
fof(f388,plain,
neq(sK8,nil),
inference(cnf_transformation,[],[f241]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC086+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/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.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:12:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (4246)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.49 % (4238)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.50 % (4225)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (4223)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)
% 0.19/0.51 % (4230)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (4233)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.51 % (4234)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.51 % (4232)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51 % (4222)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (4221)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.51 % (4243)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)
% 0.19/0.51 % (4235)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.19/0.52 % (4249)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.52 % (4229)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.19/0.52 % (4229)Instruction limit reached!
% 0.19/0.52 % (4229)------------------------------
% 0.19/0.52 % (4229)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (4229)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (4229)Termination reason: Unknown
% 0.19/0.52 % (4229)Termination phase: Preprocessing 2
% 0.19/0.52
% 0.19/0.52 % (4229)Memory used [KB]: 1023
% 0.19/0.52 % (4229)Time elapsed: 0.002 s
% 0.19/0.52 % (4229)Instructions burned: 2 (million)
% 0.19/0.52 % (4229)------------------------------
% 0.19/0.52 % (4229)------------------------------
% 0.19/0.52 % (4231)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (4241)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.52 % (4244)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)
% 0.19/0.52 % (4247)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.19/0.52 % (4240)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.53 % (4237)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.19/0.53 % (4226)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)
% 0.19/0.53 % (4224)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (4243)First to succeed.
% 0.19/0.53 TRYING [1]
% 0.19/0.53 % (4228)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.53 % (4243)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (4243)------------------------------
% 0.19/0.53 % (4243)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (4243)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (4243)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (4243)Memory used [KB]: 1407
% 0.19/0.53 % (4243)Time elapsed: 0.093 s
% 0.19/0.53 % (4243)Instructions burned: 12 (million)
% 0.19/0.53 % (4243)------------------------------
% 0.19/0.53 % (4243)------------------------------
% 0.19/0.53 % (4220)Success in time 0.183 s
%------------------------------------------------------------------------------