TSTP Solution File: SWC218+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC218+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 : n002.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:46:09 EDT 2023
% Result : Theorem 2.13s 0.78s
% Output : Refutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 19
% Syntax : Number of formulae : 89 ( 24 unt; 0 def)
% Number of atoms : 416 ( 142 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 477 ( 150 ~; 130 |; 152 &)
% ( 8 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 157 (; 82 !; 75 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7559,plain,
$false,
inference(resolution,[],[f7558,f397]) ).
fof(f397,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax17) ).
fof(f7558,plain,
~ ssList(nil),
inference(resolution,[],[f7557,f386]) ).
fof(f386,plain,
ssItem(sK24),
inference(cnf_transformation,[],[f257]) ).
fof(f257,plain,
( ~ neq(sK18,nil)
& sK20 = app(app(sK22,cons(sK24,nil)),sK23)
& ssItem(sK24)
& sK21 = app(sK22,sK23)
& ssList(sK23)
& ssList(sK22)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22,sK23,sK24])],[f99,f256,f255,f254,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK18,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK18,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ neq(sK18,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ~ neq(sK18,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ neq(sK18,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = sK20
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ~ neq(sK18,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = sK20
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ~ neq(sK18,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = sK20
& ssItem(X6) )
& app(X4,X5) = sK21
& ssList(X5) )
& ssList(X4) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = sK20
& ssItem(X6) )
& app(X4,X5) = sK21
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ? [X6] :
( sK20 = app(app(sK22,cons(X6,nil)),X5)
& ssItem(X6) )
& sK21 = app(sK22,X5)
& ssList(X5) )
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X5] :
( ? [X6] :
( sK20 = app(app(sK22,cons(X6,nil)),X5)
& ssItem(X6) )
& sK21 = app(sK22,X5)
& ssList(X5) )
=> ( ? [X6] :
( sK20 = app(app(sK22,cons(X6,nil)),sK23)
& ssItem(X6) )
& sK21 = app(sK22,sK23)
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
( ? [X6] :
( sK20 = app(app(sK22,cons(X6,nil)),sK23)
& ssItem(X6) )
=> ( sK20 = app(app(sK22,cons(sK24,nil)),sK23)
& ssItem(sK24) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& 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] :
( ssList(X3)
=> ( neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ! [X6] :
( ssItem(X6)
=> app(app(X4,cons(X6,nil)),X5) != X2 )
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ! [X6] :
( ssItem(X6)
=> app(app(X4,cons(X6,nil)),X5) != X2 )
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',co1) ).
fof(f7557,plain,
( ~ ssItem(sK24)
| ~ ssList(nil) ),
inference(trivial_inequality_removal,[],[f7548]) ).
fof(f7548,plain,
( nil != nil
| ~ ssItem(sK24)
| ~ ssList(nil) ),
inference(superposition,[],[f560,f5077]) ).
fof(f5077,plain,
nil = cons(sK24,nil),
inference(resolution,[],[f5076,f397]) ).
fof(f5076,plain,
( ~ ssList(nil)
| nil = cons(sK24,nil) ),
inference(resolution,[],[f5075,f380]) ).
fof(f380,plain,
ssList(sK21),
inference(cnf_transformation,[],[f257]) ).
fof(f5075,plain,
( ~ ssList(sK21)
| nil = cons(sK24,nil)
| ~ ssList(nil) ),
inference(resolution,[],[f5074,f386]) ).
fof(f5074,plain,
( ~ ssItem(sK24)
| ~ ssList(nil)
| nil = cons(sK24,nil)
| ~ ssList(sK21) ),
inference(duplicate_literal_removal,[],[f5073]) ).
fof(f5073,plain,
( ~ ssList(sK21)
| ~ ssList(nil)
| nil = cons(sK24,nil)
| ~ ssItem(sK24)
| ~ ssList(nil) ),
inference(resolution,[],[f5012,f559]) ).
fof(f559,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f178]) ).
fof(f178,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax16) ).
fof(f5012,plain,
( ~ ssList(cons(sK24,nil))
| ~ ssList(sK21)
| ~ ssList(nil)
| nil = cons(sK24,nil) ),
inference(duplicate_literal_removal,[],[f5007]) ).
fof(f5007,plain,
( ~ ssList(nil)
| ~ ssList(sK21)
| ~ ssList(cons(sK24,nil))
| nil = cons(sK24,nil)
| ~ ssList(cons(sK24,nil)) ),
inference(resolution,[],[f5006,f553]) ).
fof(f553,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f350]) ).
fof(f350,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f175]) ).
fof(f175,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/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax58) ).
fof(f5006,plain,
( segmentP(nil,cons(sK24,nil))
| ~ ssList(nil)
| ~ ssList(sK21)
| ~ ssList(cons(sK24,nil)) ),
inference(duplicate_literal_removal,[],[f5005]) ).
fof(f5005,plain,
( segmentP(nil,cons(sK24,nil))
| ~ ssList(nil)
| ~ ssList(sK21)
| ~ ssList(cons(sK24,nil))
| ~ ssList(nil) ),
inference(equality_resolution,[],[f3326]) ).
fof(f3326,plain,
! [X0] :
( nil != X0
| segmentP(X0,cons(sK24,nil))
| ~ ssList(nil)
| ~ ssList(sK21)
| ~ ssList(cons(sK24,nil))
| ~ ssList(X0) ),
inference(superposition,[],[f584,f1356]) ).
fof(f1356,plain,
nil = app(app(sK21,cons(sK24,nil)),nil),
inference(forward_demodulation,[],[f1287,f1297]) ).
fof(f1297,plain,
sK21 = sK22,
inference(backward_demodulation,[],[f614,f1280]) ).
fof(f1280,plain,
sK21 = app(sK22,nil),
inference(backward_demodulation,[],[f385,f1278]) ).
fof(f1278,plain,
nil = sK23,
inference(resolution,[],[f1277,f397]) ).
fof(f1277,plain,
( ~ ssList(nil)
| nil = sK23 ),
inference(resolution,[],[f1276,f383]) ).
fof(f383,plain,
ssList(sK22),
inference(cnf_transformation,[],[f257]) ).
fof(f1276,plain,
( ~ ssList(sK22)
| nil = sK23
| ~ ssList(nil) ),
inference(resolution,[],[f1275,f384]) ).
fof(f384,plain,
ssList(sK23),
inference(cnf_transformation,[],[f257]) ).
fof(f1275,plain,
( ~ ssList(sK23)
| ~ ssList(sK22)
| nil = sK23
| ~ ssList(nil) ),
inference(resolution,[],[f1274,f386]) ).
fof(f1274,plain,
( ~ ssItem(sK24)
| ~ ssList(sK23)
| ~ ssList(sK22)
| nil = sK23
| ~ ssList(nil) ),
inference(resolution,[],[f1273,f559]) ).
fof(f1273,plain,
( ~ ssList(cons(sK24,nil))
| nil = sK23
| ~ ssList(sK23)
| ~ ssList(sK22) ),
inference(resolution,[],[f1272,f569]) ).
fof(f569,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f185]) ).
fof(f185,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax26) ).
fof(f1272,plain,
( ~ ssList(app(sK22,cons(sK24,nil)))
| ~ ssList(sK23)
| nil = sK23 ),
inference(trivial_inequality_removal,[],[f1271]) ).
fof(f1271,plain,
( nil != nil
| nil = sK23
| ~ ssList(sK23)
| ~ ssList(app(sK22,cons(sK24,nil))) ),
inference(superposition,[],[f588,f939]) ).
fof(f939,plain,
nil = app(app(sK22,cons(sK24,nil)),sK23),
inference(backward_demodulation,[],[f606,f936]) ).
fof(f936,plain,
nil = sK18,
inference(resolution,[],[f935,f397]) ).
fof(f935,plain,
( ~ ssList(nil)
| nil = sK18 ),
inference(resolution,[],[f930,f607]) ).
fof(f607,plain,
ssList(sK18),
inference(forward_demodulation,[],[f379,f382]) ).
fof(f382,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f257]) ).
fof(f379,plain,
ssList(sK20),
inference(cnf_transformation,[],[f257]) ).
fof(f930,plain,
( ~ ssList(sK18)
| ~ ssList(nil)
| nil = sK18 ),
inference(resolution,[],[f577,f388]) ).
fof(f388,plain,
~ neq(sK18,nil),
inference(cnf_transformation,[],[f257]) ).
fof(f577,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f358]) ).
fof(f358,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f198]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax15) ).
fof(f606,plain,
sK18 = app(app(sK22,cons(sK24,nil)),sK23),
inference(backward_demodulation,[],[f387,f382]) ).
fof(f387,plain,
sK20 = app(app(sK22,cons(sK24,nil)),sK23),
inference(cnf_transformation,[],[f257]) ).
fof(f588,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f373]) ).
fof(f373,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f372]) ).
fof(f372,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f202]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax83) ).
fof(f385,plain,
sK21 = app(sK22,sK23),
inference(cnf_transformation,[],[f257]) ).
fof(f614,plain,
sK22 = app(sK22,nil),
inference(resolution,[],[f459,f383]) ).
fof(f459,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax84) ).
fof(f1287,plain,
nil = app(app(sK22,cons(sK24,nil)),nil),
inference(backward_demodulation,[],[f939,f1278]) ).
fof(f584,plain,
! [X2,X3,X0,X1] :
( app(app(X2,X1),X3) != X0
| segmentP(X0,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f367]) ).
fof(f367,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK67(X0,X1),X1),sK68(X0,X1)) = X0
& ssList(sK68(X0,X1))
& ssList(sK67(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK67,sK68])],[f364,f366,f365]) ).
fof(f365,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK67(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK67(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f366,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK67(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK67(X0,X1),X1),sK68(X0,X1)) = X0
& ssList(sK68(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f364,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f363]) ).
fof(f363,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f200]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax7) ).
fof(f560,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f179]) ).
fof(f179,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E1qu5JbJ6x/Vampire---4.8_9834',ax21) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC218+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.16 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.37 % Computer : n002.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Wed Aug 30 17:35:51 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.44 % (10004)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.45 % (10005)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on Vampire---4 for (846ds/0Mi)
% 0.23/0.45 % (10007)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.23/0.45 % (10009)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.23/0.45 % (10010)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.23/0.45 % (10011)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.23/0.45 % (10006)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on Vampire---4 for (793ds/0Mi)
% 0.23/0.45 TRYING [1]
% 0.23/0.45 TRYING [2]
% 0.23/0.46 % (10008)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on Vampire---4 for (533ds/0Mi)
% 0.23/0.47 TRYING [3]
% 0.23/0.47 TRYING [1]
% 0.23/0.47 TRYING [2]
% 0.23/0.48 TRYING [3]
% 0.23/0.49 TRYING [4]
% 0.23/0.51 TRYING [4]
% 0.23/0.54 TRYING [5]
% 0.23/0.60 TRYING [5]
% 2.13/0.77 % (10010)First to succeed.
% 2.13/0.78 % (10010)Refutation found. Thanks to Tanya!
% 2.13/0.78 % SZS status Theorem for Vampire---4
% 2.13/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 2.13/0.78 % (10010)------------------------------
% 2.13/0.78 % (10010)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 2.13/0.78 % (10010)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 2.13/0.78 % (10010)Termination reason: Refutation
% 2.13/0.78
% 2.13/0.78 % (10010)Memory used [KB]: 9083
% 2.13/0.78 % (10010)Time elapsed: 0.331 s
% 2.13/0.78 % (10010)------------------------------
% 2.13/0.78 % (10010)------------------------------
% 2.13/0.78 % (10004)Success in time 0.4 s
% 2.13/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------