TSTP Solution File: SWC060+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC060+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n006.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 : Sat Sep 2 12:39:11 EDT 2023
% Result : Theorem 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 10 unt; 0 def)
% Number of atoms : 323 ( 112 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 406 ( 142 ~; 140 |; 109 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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 : 59 (; 37 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f730,plain,
$false,
inference(resolution,[],[f729,f395]) ).
fof(f395,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.NfrBOHBrh9/Vampire---4.8_29973',ax17) ).
fof(f729,plain,
~ ssList(nil),
inference(duplicate_literal_removal,[],[f726]) ).
fof(f726,plain,
( ~ ssList(nil)
| ~ ssList(nil) ),
inference(resolution,[],[f725,f455]) ).
fof(f455,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/tmp/tmp.NfrBOHBrh9/Vampire---4.8_29973',ax57) ).
fof(f725,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil) ),
inference(resolution,[],[f723,f724]) ).
fof(f724,plain,
neq(nil,nil),
inference(trivial_inequality_removal,[],[f721]) ).
fof(f721,plain,
( nil != nil
| neq(nil,nil) ),
inference(backward_demodulation,[],[f707,f716]) ).
fof(f716,plain,
nil = sK20,
inference(resolution,[],[f715,f375]) ).
fof(f375,plain,
ssList(sK20),
inference(cnf_transformation,[],[f253]) ).
fof(f253,plain,
( ( ( segmentP(sK21,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = sK21 ) )
& ( ( ! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f98,f252,f251,f250,f249]) ).
fof(f249,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK18
& nil = X1 ) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f250,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK18
& nil = X1 ) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( segmentP(X3,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X3] :
( ( ( segmentP(X3,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( segmentP(sK21,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = sK21 ) )
& ( ( ! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& 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] :
( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NfrBOHBrh9/Vampire---4.8_29973',co1) ).
fof(f715,plain,
( ~ ssList(sK20)
| nil = sK20 ),
inference(duplicate_literal_removal,[],[f714]) ).
fof(f714,plain,
( nil = sK20
| nil = sK20
| ~ ssList(sK20) ),
inference(resolution,[],[f709,f555]) ).
fof(f555,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f348]) ).
fof(f348,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f176]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.NfrBOHBrh9/Vampire---4.8_29973',ax58) ).
fof(f709,plain,
( segmentP(nil,sK20)
| nil = sK20 ),
inference(backward_demodulation,[],[f610,f705]) ).
fof(f705,plain,
nil = sK19,
inference(resolution,[],[f704,f375]) ).
fof(f704,plain,
( ~ ssList(sK20)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f702]) ).
fof(f702,plain,
( ~ ssList(sK20)
| nil = sK19
| nil = sK19 ),
inference(resolution,[],[f701,f611]) ).
fof(f611,plain,
( segmentP(sK19,sK20)
| nil = sK19 ),
inference(forward_demodulation,[],[f609,f377]) ).
fof(f377,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f253]) ).
fof(f609,plain,
( nil = sK19
| segmentP(sK21,sK20) ),
inference(backward_demodulation,[],[f385,f377]) ).
fof(f385,plain,
( segmentP(sK21,sK20)
| nil = sK21 ),
inference(cnf_transformation,[],[f253]) ).
fof(f701,plain,
( ~ segmentP(sK19,sK20)
| ~ ssList(sK20)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f700]) ).
fof(f700,plain,
( ~ segmentP(sK19,sK20)
| ~ ssList(sK20)
| nil = sK19
| ~ ssList(sK20) ),
inference(resolution,[],[f698,f454]) ).
fof(f454,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/tmp/tmp.NfrBOHBrh9/Vampire---4.8_29973',ax55) ).
fof(f698,plain,
( ~ segmentP(sK20,sK20)
| ~ segmentP(sK19,sK20)
| ~ ssList(sK20)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f696]) ).
fof(f696,plain,
( ~ segmentP(sK19,sK20)
| ~ segmentP(sK20,sK20)
| ~ ssList(sK20)
| nil = sK19
| nil = sK19 ),
inference(resolution,[],[f606,f608]) ).
fof(f608,plain,
( neq(sK20,nil)
| nil = sK19 ),
inference(backward_demodulation,[],[f383,f377]) ).
fof(f383,plain,
( neq(sK20,nil)
| nil = sK21 ),
inference(cnf_transformation,[],[f253]) ).
fof(f606,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK19,X4)
| ~ segmentP(sK20,X4)
| ~ ssList(X4)
| nil = sK19 ),
inference(backward_demodulation,[],[f381,f378]) ).
fof(f378,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f253]) ).
fof(f381,plain,
! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK19 ),
inference(cnf_transformation,[],[f253]) ).
fof(f610,plain,
( segmentP(sK19,sK20)
| nil = sK20 ),
inference(backward_demodulation,[],[f386,f377]) ).
fof(f386,plain,
( segmentP(sK21,sK20)
| nil = sK20 ),
inference(cnf_transformation,[],[f253]) ).
fof(f707,plain,
( nil != sK20
| neq(nil,nil) ),
inference(backward_demodulation,[],[f605,f705]) ).
fof(f605,plain,
( nil != sK20
| neq(sK19,nil) ),
inference(backward_demodulation,[],[f380,f378]) ).
fof(f380,plain,
( neq(sK19,nil)
| nil != sK18 ),
inference(cnf_transformation,[],[f253]) ).
fof(f723,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(nil,X4)
| ~ ssList(X4) ),
inference(trivial_inequality_removal,[],[f722]) ).
fof(f722,plain,
! [X4] :
( nil != nil
| ~ segmentP(nil,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(backward_demodulation,[],[f713,f716]) ).
fof(f713,plain,
! [X4] :
( ~ segmentP(nil,X4)
| nil != sK20
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(duplicate_literal_removal,[],[f708]) ).
fof(f708,plain,
! [X4] :
( ~ segmentP(nil,X4)
| nil != sK20
| ~ segmentP(nil,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(backward_demodulation,[],[f607,f705]) ).
fof(f607,plain,
! [X4] :
( nil != sK20
| ~ segmentP(nil,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(backward_demodulation,[],[f604,f378]) ).
fof(f604,plain,
! [X4] :
( ~ segmentP(nil,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK18 ),
inference(inner_rewriting,[],[f382]) ).
fof(f382,plain,
! [X4] :
( ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK18 ),
inference(cnf_transformation,[],[f253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC060+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 30 17:16:05 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.41 % (30183)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.41 % (30187)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on Vampire---4 for (846ds/0Mi)
% 0.20/0.41 % (30188)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on Vampire---4 for (793ds/0Mi)
% 0.20/0.41 % (30190)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on Vampire---4 for (533ds/0Mi)
% 0.20/0.41 % (30189)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 Vampire---4 for (569ds/0Mi)
% 0.20/0.41 % (30191)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 Vampire---4 for (531ds/0Mi)
% 0.20/0.41 % (30192)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 Vampire---4 for (522ds/0Mi)
% 0.20/0.41 % (30193)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 Vampire---4 for (497ds/0Mi)
% 0.20/0.42 TRYING [1]
% 0.20/0.42 TRYING [1]
% 0.20/0.43 TRYING [2]
% 0.20/0.43 TRYING [2]
% 0.20/0.43 % (30192)First to succeed.
% 0.20/0.43 % (30192)Refutation found. Thanks to Tanya!
% 0.20/0.43 % SZS status Theorem for Vampire---4
% 0.20/0.43 % SZS output start Proof for Vampire---4
% See solution above
% 0.20/0.43 % (30192)------------------------------
% 0.20/0.43 % (30192)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.20/0.43 % (30192)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.20/0.43 % (30192)Termination reason: Refutation
% 0.20/0.43
% 0.20/0.43 % (30192)Memory used [KB]: 1663
% 0.20/0.43 % (30192)Time elapsed: 0.016 s
% 0.20/0.43 % (30192)------------------------------
% 0.20/0.43 % (30192)------------------------------
% 0.20/0.43 % (30183)Success in time 0.078 s
% 0.20/0.43 % Vampire---4.8 exiting
%------------------------------------------------------------------------------