TSTP Solution File: SWC082+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC082+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n003.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 : Tue Apr 30 15:51:19 EDT 2024
% Result : Theorem 0.22s 0.40s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 289 ( 58 equ)
% Maximal formula atoms : 36 ( 9 avg)
% Number of connectives : 379 ( 120 ~; 98 |; 141 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 67 ( 29 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f653,plain,
$false,
inference(resolution,[],[f652,f645]) ).
fof(f645,plain,
ssList(sK22),
inference(resolution,[],[f385,f642]) ).
fof(f642,plain,
neq(sK21,nil),
inference(forward_demodulation,[],[f382,f380]) ).
fof(f380,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ( ~ neq(sK21,nil)
| ( segmentP(sK20,sK22)
& segmentP(sK21,sK22)
& neq(sK22,nil)
& ssList(sK22) ) )
& ( nil != sK21
| nil = sK20 )
& ! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(sK19,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f100,f255,f254,f253,f252,f251]) ).
fof(f251,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(sK19,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(sK19,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK20,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = sK20 )
& ! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(sK19,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK20,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = sK20 )
& ! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(sK19,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ~ neq(sK21,nil)
| ? [X4] :
( segmentP(sK20,X4)
& segmentP(sK21,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK21
| nil = sK20 )
& ! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(sK19,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X4] :
( segmentP(sK20,X4)
& segmentP(sK21,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( segmentP(sK20,sK22)
& segmentP(sK21,sK22)
& neq(sK22,nil)
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f382,plain,
neq(sK19,nil),
inference(cnf_transformation,[],[f256]) ).
fof(f385,plain,
( ~ neq(sK21,nil)
| ssList(sK22) ),
inference(cnf_transformation,[],[f256]) ).
fof(f652,plain,
~ ssList(sK22),
inference(resolution,[],[f651,f642]) ).
fof(f651,plain,
( ~ neq(sK21,nil)
| ~ ssList(sK22) ),
inference(resolution,[],[f650,f387]) ).
fof(f387,plain,
( segmentP(sK21,sK22)
| ~ neq(sK21,nil) ),
inference(cnf_transformation,[],[f256]) ).
fof(f650,plain,
( ~ segmentP(sK21,sK22)
| ~ ssList(sK22) ),
inference(resolution,[],[f649,f642]) ).
fof(f649,plain,
( ~ neq(sK21,nil)
| ~ segmentP(sK21,sK22)
| ~ ssList(sK22) ),
inference(resolution,[],[f648,f388]) ).
fof(f388,plain,
( segmentP(sK20,sK22)
| ~ neq(sK21,nil) ),
inference(cnf_transformation,[],[f256]) ).
fof(f648,plain,
( ~ segmentP(sK20,sK22)
| ~ ssList(sK22)
| ~ segmentP(sK21,sK22) ),
inference(resolution,[],[f647,f642]) ).
fof(f647,plain,
( ~ neq(sK21,nil)
| ~ segmentP(sK21,sK22)
| ~ ssList(sK22)
| ~ segmentP(sK20,sK22) ),
inference(resolution,[],[f641,f386]) ).
fof(f386,plain,
( neq(sK22,nil)
| ~ neq(sK21,nil) ),
inference(cnf_transformation,[],[f256]) ).
fof(f641,plain,
! [X5] :
( ~ neq(X5,nil)
| ~ segmentP(sK20,X5)
| ~ segmentP(sK21,X5)
| ~ ssList(X5) ),
inference(forward_demodulation,[],[f640,f380]) ).
fof(f640,plain,
! [X5] :
( ~ segmentP(sK20,X5)
| ~ segmentP(sK19,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(forward_demodulation,[],[f383,f381]) ).
fof(f381,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f256]) ).
fof(f383,plain,
! [X5] :
( ~ segmentP(sK18,X5)
| ~ segmentP(sK19,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC082+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 04:16:18 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (6284)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.39 % (6285)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.39 % (6290)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.39 % (6287)WARNING: value z3 for option sas not known
% 0.15/0.39 % (6286)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.39 % (6289)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.39 % (6291)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.39 % (6288)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39 % (6287)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.40 % (6290)First to succeed.
% 0.22/0.40 % (6289)Also succeeded, but the first one will report.
% 0.22/0.40 TRYING [1]
% 0.22/0.40 % (6290)Refutation found. Thanks to Tanya!
% 0.22/0.40 % SZS status Theorem for theBenchmark
% 0.22/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.40 % (6290)------------------------------
% 0.22/0.40 % (6290)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.40 % (6290)Termination reason: Refutation
% 0.22/0.40
% 0.22/0.40 % (6290)Memory used [KB]: 1317
% 0.22/0.40 % (6290)Time elapsed: 0.013 s
% 0.22/0.40 % (6290)Instructions burned: 21 (million)
% 0.22/0.40 % (6290)------------------------------
% 0.22/0.40 % (6290)------------------------------
% 0.22/0.40 % (6284)Success in time 0.038 s
%------------------------------------------------------------------------------