TSTP Solution File: SWC106+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC106+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : Fri May 3 03:11:15 EDT 2024
% Result : Theorem 4.12s 1.22s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of formulae : 96 ( 24 unt; 0 def)
% Number of atoms : 422 ( 117 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 493 ( 167 ~; 156 |; 137 &)
% ( 6 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 201 ( 20 sgn 98 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax39) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2 ) ) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2 ) ) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f232,plain,
! [X0,X1,X3,X2] :
( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) )
| ~ sP6(X0,X1,X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f233,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X0,X1,X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f222,f232]) ).
fof(f243,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f244,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f243]) ).
fof(f245,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK11(X0),nil) = X0
& ssItem(sK11(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f246,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK11(X0),nil) = X0
& ssItem(sK11(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f244,f245]) ).
fof(f251,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X2,X1) = X0
& ssList(X2) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f252,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f251]) ).
fof(f253,plain,
! [X0,X1] :
( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
=> ( app(sK13(X0,X1),X1) = X0
& ssList(sK13(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ( app(sK13(X0,X1),X1) = X0
& ssList(sK13(X0,X1)) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f252,f253]) ).
fof(f318,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f345,plain,
! [X0,X1,X3,X2] :
( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) )
| ~ sP6(X0,X1,X3,X2) ),
inference(nnf_transformation,[],[f232]) ).
fof(f346,plain,
! [X0,X1,X2,X3] :
( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& cons(X4,nil) = X3
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(rectify,[],[f345]) ).
fof(f347,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& cons(X4,nil) = X3
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( app(X5,cons(sK54(X2,X3),nil)) = X2
& cons(sK54(X2,X3),nil) = X3
& ssList(X5) )
& ssItem(sK54(X2,X3)) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
! [X2,X3] :
( ? [X5] :
( app(X5,cons(sK54(X2,X3),nil)) = X2
& cons(sK54(X2,X3),nil) = X3
& ssList(X5) )
=> ( app(sK55(X2,X3),cons(sK54(X2,X3),nil)) = X2
& cons(sK54(X2,X3),nil) = X3
& ssList(sK55(X2,X3)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X1,X2,X3] :
( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& app(sK55(X2,X3),cons(sK54(X2,X3),nil)) = X2
& cons(sK54(X2,X3),nil) = X3
& ssList(sK55(X2,X3))
& ssItem(sK54(X2,X3))
& neq(X1,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54,sK55])],[f346,f348,f347]) ).
fof(f350,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X0,X1,X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(sK56,X1,X3,X2) )
& sK56 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(sK56,X1,X3,X2) )
& sK56 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(sK56,sK57,X3,X2) )
& sK56 = X2
& sK57 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(sK56,sK57,X3,X2) )
& sK56 = X2
& sK57 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(sK56,sK57,X3,sK58) )
& sK56 = sK58
& sK57 = X3
& ssList(X3) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(sK56,sK57,X3,sK58) )
& sK56 = sK58
& sK57 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK59,nil)
& neq(sK57,nil) )
| sP6(sK56,sK57,sK59,sK58) )
& sK56 = sK58
& sK57 = sK59
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ( ( ~ neq(sK59,nil)
& neq(sK57,nil) )
| sP6(sK56,sK57,sK59,sK58) )
& sK56 = sK58
& sK57 = sK59
& ssList(sK59)
& ssList(sK58)
& ssList(sK57)
& ssList(sK56) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK56,sK57,sK58,sK59])],[f233,f353,f352,f351,f350]) ).
fof(f366,plain,
! [X0,X1] :
( singletonP(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f246]) ).
fof(f372,plain,
! [X2,X0,X1] :
( rearsegP(X0,X1)
| app(X2,X1) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f254]) ).
fof(f445,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f318]) ).
fof(f447,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f459,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f478,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f555,plain,
! [X2,X3,X0,X1] :
( ssItem(sK54(X2,X3))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
! [X2,X3,X0,X1] :
( ssList(sK55(X2,X3))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
! [X2,X3,X0,X1] :
( cons(sK54(X2,X3),nil) = X3
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
! [X2,X3,X0,X1] :
( app(sK55(X2,X3),cons(sK54(X2,X3),nil)) = X2
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
! [X2,X3,X0,X1] :
( ~ rearsegP(X1,X0)
| ~ neq(X0,nil)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
ssList(sK56),
inference(cnf_transformation,[],[f354]) ).
fof(f564,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f354]) ).
fof(f565,plain,
sK56 = sK58,
inference(cnf_transformation,[],[f354]) ).
fof(f566,plain,
( neq(sK57,nil)
| sP6(sK56,sK57,sK59,sK58) ),
inference(cnf_transformation,[],[f354]) ).
fof(f567,plain,
( ~ neq(sK59,nil)
| sP6(sK56,sK57,sK59,sK58) ),
inference(cnf_transformation,[],[f354]) ).
fof(f568,plain,
( ~ neq(sK59,nil)
| sP6(sK58,sK59,sK59,sK58) ),
inference(definition_unfolding,[],[f567,f565,f564]) ).
fof(f569,plain,
( neq(sK59,nil)
| sP6(sK58,sK59,sK59,sK58) ),
inference(definition_unfolding,[],[f566,f564,f565,f564]) ).
fof(f571,plain,
ssList(sK58),
inference(definition_unfolding,[],[f560,f565]) ).
fof(f574,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f366]) ).
fof(f576,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X2,X1)) ),
inference(equality_resolution,[],[f372]) ).
cnf(c_58,plain,
( ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| singletonP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f574]) ).
cnf(c_64,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| rearsegP(app(X0,X1),X1) ),
inference(cnf_transformation,[],[f576]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f445]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f447]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f459]) ).
cnf(c_172,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f478]) ).
cnf(c_246,plain,
( ~ sP6(X0,X1,X2,X3)
| ~ rearsegP(X1,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_247,plain,
( ~ sP6(X0,X1,X2,X3)
| app(sK55(X2,X3),cons(sK54(X2,X3),nil)) = X2 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_248,plain,
( ~ sP6(X0,X1,X2,X3)
| cons(sK54(X2,X3),nil) = X3 ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1,X2,X3)
| ssList(sK55(X2,X3)) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_250,plain,
( ~ sP6(X0,X1,X2,X3)
| ssItem(sK54(X2,X3)) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_252,negated_conjecture,
( ~ neq(sK59,nil)
| sP6(sK58,sK59,sK59,sK58) ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_253,negated_conjecture,
( sP6(sK58,sK59,sK59,sK58)
| neq(sK59,nil) ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_257,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f571]) ).
cnf(c_376,negated_conjecture,
sP6(sK58,sK59,sK59,sK58),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_252]) ).
cnf(c_378,negated_conjecture,
sP6(sK58,sK59,sK59,sK58),
inference(global_subsumption_just,[status(thm)],[c_252,c_376]) ).
cnf(c_386,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| rearsegP(app(X0,X1),X1) ),
inference(global_subsumption_just,[status(thm)],[c_64,c_153,c_64]) ).
cnf(c_3140,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK59
| X3 != sK58
| ssItem(sK54(X2,X3)) ),
inference(resolution_lifted,[status(thm)],[c_250,c_378]) ).
cnf(c_3141,plain,
ssItem(sK54(sK59,sK58)),
inference(unflattening,[status(thm)],[c_3140]) ).
cnf(c_3145,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK59
| X3 != sK58
| ssList(sK55(X2,X3)) ),
inference(resolution_lifted,[status(thm)],[c_249,c_378]) ).
cnf(c_3146,plain,
ssList(sK55(sK59,sK58)),
inference(unflattening,[status(thm)],[c_3145]) ).
cnf(c_3150,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK59
| X3 != sK58
| cons(sK54(X2,X3),nil) = X3 ),
inference(resolution_lifted,[status(thm)],[c_248,c_378]) ).
cnf(c_3151,plain,
cons(sK54(sK59,sK58),nil) = sK58,
inference(unflattening,[status(thm)],[c_3150]) ).
cnf(c_3155,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK59
| X3 != sK58
| app(sK55(X2,X3),cons(sK54(X2,X3),nil)) = X2 ),
inference(resolution_lifted,[status(thm)],[c_247,c_378]) ).
cnf(c_3156,plain,
app(sK55(sK59,sK58),cons(sK54(sK59,sK58),nil)) = sK59,
inference(unflattening,[status(thm)],[c_3155]) ).
cnf(c_3160,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK59
| X3 != sK58
| ~ rearsegP(X1,X0)
| ~ neq(X0,nil) ),
inference(resolution_lifted,[status(thm)],[c_246,c_378]) ).
cnf(c_3161,plain,
( ~ neq(sK58,nil)
| ~ rearsegP(sK59,sK58) ),
inference(unflattening,[status(thm)],[c_3160]) ).
cnf(c_3302,plain,
( X0 != sK58
| X1 != nil
| ~ rearsegP(sK59,sK58)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_3161]) ).
cnf(c_3303,plain,
( ~ rearsegP(sK59,sK58)
| ~ ssList(nil)
| ~ ssList(sK58)
| sK58 = nil ),
inference(unflattening,[status(thm)],[c_3302]) ).
cnf(c_3304,plain,
( ~ rearsegP(sK59,sK58)
| sK58 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3303,c_257,c_141,c_3303]) ).
cnf(c_6544,plain,
app(sK55(sK59,sK58),sK58) = sK59,
inference(light_normalisation,[status(thm)],[c_3156,c_3151]) ).
cnf(c_8943,negated_conjecture,
ssList(sK58),
inference(demodulation,[status(thm)],[c_257]) ).
cnf(c_11800,plain,
( ~ ssItem(sK54(sK59,sK58))
| ~ ssList(sK58)
| singletonP(cons(sK54(sK59,sK58),nil)) ),
inference(superposition,[status(thm)],[c_3151,c_58]) ).
cnf(c_11801,plain,
( ~ ssItem(sK54(sK59,sK58))
| ~ ssList(sK58)
| singletonP(sK58) ),
inference(light_normalisation,[status(thm)],[c_11800,c_3151]) ).
cnf(c_11802,plain,
singletonP(sK58),
inference(forward_subsumption_resolution,[status(thm)],[c_11801,c_8943,c_3141]) ).
cnf(c_12782,plain,
( ~ ssList(sK55(sK59,sK58))
| ~ ssList(sK58)
| rearsegP(sK59,sK58) ),
inference(superposition,[status(thm)],[c_6544,c_386]) ).
cnf(c_12797,plain,
rearsegP(sK59,sK58),
inference(forward_subsumption_resolution,[status(thm)],[c_12782,c_8943,c_3146]) ).
cnf(c_12813,plain,
nil = sK58,
inference(backward_subsumption_resolution,[status(thm)],[c_3304,c_12797]) ).
cnf(c_12833,plain,
singletonP(nil),
inference(demodulation,[status(thm)],[c_11802,c_12813]) ).
cnf(c_12839,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12833,c_172]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : SWC106+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.16 % Command : run_iprover %s %d THM
% 0.15/0.38 % Computer : n006.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Thu May 2 23:18:34 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.12/1.22 % SZS status Started for theBenchmark.p
% 4.12/1.22 % SZS status Theorem for theBenchmark.p
% 4.12/1.22
% 4.12/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.12/1.22
% 4.12/1.22 ------ iProver source info
% 4.12/1.22
% 4.12/1.22 git: date: 2024-05-02 19:28:25 +0000
% 4.12/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.12/1.22 git: non_committed_changes: false
% 4.12/1.22
% 4.12/1.22 ------ Parsing...
% 4.12/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.12/1.22
% 4.12/1.22 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 1 sf_s rm: 6 0s sf_e pe_s pe_e
% 4.12/1.22
% 4.12/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.12/1.22
% 4.12/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.12/1.22 ------ Proving...
% 4.12/1.22 ------ Problem Properties
% 4.12/1.22
% 4.12/1.22
% 4.12/1.22 clauses 189
% 4.12/1.22 conjectures 2
% 4.12/1.22 EPR 54
% 4.12/1.22 Horn 121
% 4.12/1.22 unary 23
% 4.12/1.22 binary 42
% 4.12/1.22 lits 629
% 4.12/1.22 lits eq 83
% 4.12/1.22 fd_pure 0
% 4.12/1.22 fd_pseudo 0
% 4.12/1.22 fd_cond 21
% 4.12/1.22 fd_pseudo_cond 14
% 4.12/1.22 AC symbols 0
% 4.12/1.22
% 4.12/1.22 ------ Schedule dynamic 5 is on
% 4.12/1.22
% 4.12/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.12/1.22
% 4.12/1.22
% 4.12/1.22 ------
% 4.12/1.22 Current options:
% 4.12/1.22 ------
% 4.12/1.22
% 4.12/1.22
% 4.12/1.22
% 4.12/1.22
% 4.12/1.22 ------ Proving...
% 4.12/1.22
% 4.12/1.22
% 4.12/1.22 % SZS status Theorem for theBenchmark.p
% 4.12/1.22
% 4.12/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.12/1.22
% 4.12/1.23
%------------------------------------------------------------------------------