TSTP Solution File: SWC079+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC079+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:08 EDT 2024
% Result : Theorem 17.17s 3.17s
% Output : CNFRefutation 17.17s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f600)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
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/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax75) ).
fof(f76,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& hd(X3) = X6
& cons(X6,nil) = X5
& ssItem(X6) )
& X2 != X5
& ssList(X5) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/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) )
& ( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& hd(X3) = X6
& cons(X6,nil) = X5
& ssItem(X6) )
& X2 != X5
& ssList(X5) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X4] :
( ? [X5] :
( neq(nil,X3)
& hd(X3) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X2 != X4
& ssList(X4) )
| ? [X6] :
( segmentP(X0,X6)
& segmentP(X1,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f101,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f104,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(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f126,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f128,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f127]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f173,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f177,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f187,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f188,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f187]) ).
fof(f189,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f76]) ).
fof(f190,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f189]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f194,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f193]) ).
fof(f199,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(X0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(X0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f242,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,[],[f101]) ).
fof(f243,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f242]) ).
fof(f244,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK10(X0),nil) = X0
& ssItem(sK10(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f245,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK10(X0),nil) = X0
& ssItem(sK10(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f243,f244]) ).
fof(f254,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,[],[f104]) ).
fof(f255,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,[],[f254]) ).
fof(f256,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK13(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f258,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1))
& ssList(sK13(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f255,f257,f256]) ).
fof(f317,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f331,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f177]) ).
fof(f336,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
=> ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
! [X0] :
( ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK51])],[f188,f336]) ).
fof(f338,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
=> ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f339,plain,
! [X0] :
( ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK52])],[f190,f338]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(X0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK55 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK55 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK55 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK55 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f223,f347,f346,f345,f344]) ).
fof(f359,plain,
! [X0] :
( cons(sK10(X0),nil) = X0
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f360,plain,
! [X0,X1] :
( singletonP(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f370,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f258]) ).
fof(f439,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f440,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f442,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f448,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f449,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f455,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f492,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f495,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f331]) ).
fof(f496,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f331]) ).
fof(f521,plain,
! [X0] :
( ssItem(sK51(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f522,plain,
! [X0] :
( hd(X0) = sK51(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f523,plain,
! [X0] :
( ssList(sK52(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f524,plain,
! [X0] :
( tl(X0) = sK52(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f526,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f529,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
! [X4,X5] :
( neq(sK54,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK55 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
! [X6] :
( ~ neq(sK56,nil)
| ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
! [X4,X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK55 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
! [X6] :
( ~ neq(sK56,nil)
| ~ segmentP(sK55,X6)
| ~ segmentP(sK56,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f558,f553,f552]) ).
fof(f562,plain,
! [X4,X5] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK55 = X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f556,f552]) ).
fof(f565,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f552]) ).
fof(f566,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
fof(f569,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f360]) ).
fof(f572,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f370]) ).
fof(f586,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f496]) ).
fof(f594,plain,
! [X4] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| cons(hd(sK56),nil) != X4
| ~ ssItem(hd(sK56))
| sK55 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f559]) ).
fof(f595,plain,
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| sK55 = cons(hd(sK56),nil)
| ~ ssList(cons(hd(sK56),nil)) ),
inference(equality_resolution,[],[f594]) ).
fof(f596,plain,
! [X4] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| cons(hd(sK56),nil) != X4
| ~ ssItem(hd(sK56))
| sK55 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f562]) ).
fof(f597,plain,
( neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| sK55 = cons(hd(sK56),nil)
| ~ ssList(cons(hd(sK56),nil)) ),
inference(equality_resolution,[],[f596]) ).
cnf(c_58,plain,
( ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| singletonP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_59,plain,
( ~ ssList(X0)
| ~ singletonP(X0)
| cons(sK10(X0),nil) = X0 ),
inference(cnf_transformation,[],[f359]) ).
cnf(c_67,plain,
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f439]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f600]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f440]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_142,plain,
( cons(X0,X1) != X1
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f442]) ).
cnf(c_148,plain,
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f448]) ).
cnf(c_149,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
inference(cnf_transformation,[],[f449]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f455]) ).
cnf(c_192,plain,
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f492]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f586]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f495]) ).
cnf(c_219,plain,
( ~ ssList(X0)
| hd(X0) = sK51(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f522]) ).
cnf(c_220,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK51(X0)) ),
inference(cnf_transformation,[],[f521]) ).
cnf(c_221,plain,
( ~ ssList(X0)
| tl(X0) = sK52(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f524]) ).
cnf(c_222,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK52(X0)) ),
inference(cnf_transformation,[],[f523]) ).
cnf(c_224,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f526]) ).
cnf(c_227,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
inference(cnf_transformation,[],[f529]) ).
cnf(c_246,negated_conjecture,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ neq(sK56,nil)
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(cnf_transformation,[],[f595]) ).
cnf(c_247,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ neq(sK56,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f597]) ).
cnf(c_250,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f605]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f565]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f566]) ).
cnf(c_304,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_382,plain,
( ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_247,c_250,c_247]) ).
cnf(c_383,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0) ),
inference(renaming,[status(thm)],[c_382]) ).
cnf(c_384,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_248,c_250]) ).
cnf(c_386,plain,
( ~ neq(nil,sK56)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(global_subsumption_just,[status(thm)],[c_246,c_250,c_246]) ).
cnf(c_387,negated_conjecture,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(renaming,[status(thm)],[c_386]) ).
cnf(c_3237,plain,
( X0 != nil
| X1 != sK56
| ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| ~ ssList(X0)
| ~ ssList(X1)
| cons(hd(sK56),nil) = sK55
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_387]) ).
cnf(c_3238,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ~ ssList(sK56)
| cons(hd(sK56),nil) = sK55
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_3237]) ).
cnf(c_3239,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55
| nil = sK56 ),
inference(global_subsumption_just,[status(thm)],[c_3238,c_253,c_141,c_3238]) ).
cnf(c_3257,plain,
( X0 != X1
| X2 != nil
| ~ segmentP(sK56,X1)
| ~ segmentP(sK55,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X0 = X2 ),
inference(resolution_lifted,[status(thm)],[c_138,c_383]) ).
cnf(c_3258,plain,
( ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| X0 = nil ),
inference(unflattening,[status(thm)],[c_3257]) ).
cnf(c_3260,plain,
( ~ ssList(X0)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| X0 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3258,c_141,c_3258]) ).
cnf(c_3261,plain,
( ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(renaming,[status(thm)],[c_3260]) ).
cnf(c_3279,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_384]) ).
cnf(c_3280,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3279]) ).
cnf(c_3281,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3280,c_141,c_3280]) ).
cnf(c_3286,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(backward_subsumption_resolution,[status(thm)],[c_3239,c_3281]) ).
cnf(c_8923,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8924,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_253]) ).
cnf(c_8927,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_11869,plain,
( ~ segmentP(sK56,sK55)
| ~ ssList(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_192,c_3261]) ).
cnf(c_11872,plain,
( ~ segmentP(sK56,sK55)
| nil = sK55 ),
inference(forward_subsumption_resolution,[status(thm)],[c_11869,c_8923]) ).
cnf(c_12101,plain,
app(nil,sK55) = sK55,
inference(superposition,[status(thm)],[c_8923,c_155]) ).
cnf(c_12248,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| cons(hd(sK56),nil) = sK55 ),
inference(superposition,[status(thm)],[c_140,c_3286]) ).
cnf(c_12249,plain,
( ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(forward_subsumption_resolution,[status(thm)],[c_12248,c_141]) ).
cnf(c_12378,plain,
( ~ ssList(sK56)
| cons(hd(sK56),nil) = sK55
| nil = sK56 ),
inference(superposition,[status(thm)],[c_149,c_12249]) ).
cnf(c_12379,plain,
cons(hd(sK56),nil) = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_12378,c_3281,c_8924]) ).
cnf(c_13299,plain,
( ~ ssItem(X0)
| ~ ssList(nil)
| singletonP(cons(X0,nil)) ),
inference(superposition,[status(thm)],[c_140,c_58]) ).
cnf(c_13301,plain,
( ~ ssItem(X0)
| singletonP(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13299,c_141]) ).
cnf(c_13543,plain,
( nil != sK55
| ~ ssItem(hd(sK56))
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_12379,c_142]) ).
cnf(c_13544,plain,
( nil != sK55
| ~ ssItem(hd(sK56)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13543,c_141]) ).
cnf(c_13672,plain,
( nil != X0
| sK56 != X0
| nil = sK56 ),
inference(instantiation,[status(thm)],[c_8927]) ).
cnf(c_13673,plain,
( nil != nil
| sK56 != nil
| nil = sK56 ),
inference(instantiation,[status(thm)],[c_13672]) ).
cnf(c_13680,plain,
( ~ ssItem(hd(sK56))
| singletonP(sK55) ),
inference(superposition,[status(thm)],[c_12379,c_13301]) ).
cnf(c_13691,plain,
( ~ ssList(sK56)
| nil = sK56
| singletonP(sK55) ),
inference(superposition,[status(thm)],[c_149,c_13680]) ).
cnf(c_13692,plain,
singletonP(sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_13691,c_3281,c_8924]) ).
cnf(c_13697,plain,
( ~ ssList(sK55)
| cons(sK10(sK55),nil) = sK55 ),
inference(superposition,[status(thm)],[c_13692,c_59]) ).
cnf(c_13698,plain,
cons(sK10(sK55),nil) = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_13697,c_8923]) ).
cnf(c_13706,plain,
( nil != sK55
| ~ ssItem(sK10(sK55))
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_13698,c_148]) ).
cnf(c_13713,plain,
( nil != sK55
| ~ ssItem(sK10(sK55)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13706,c_141]) ).
cnf(c_14450,plain,
( ~ ssList(sK56)
| sK56 = nil
| ssItem(hd(sK56)) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_14831,plain,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_13713,c_253,c_141,c_195,c_304,c_3280,c_13544,c_13673,c_14450]) ).
cnf(c_14835,plain,
~ segmentP(sK56,sK55),
inference(backward_subsumption_resolution,[status(thm)],[c_11872,c_14831]) ).
cnf(c_14877,plain,
( hd(sK56) = sK51(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8924,c_219]) ).
cnf(c_14880,plain,
hd(sK56) = sK51(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_14877,c_3281]) ).
cnf(c_15040,plain,
( tl(sK56) = sK52(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8924,c_221]) ).
cnf(c_15043,plain,
tl(sK56) = sK52(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_15040,c_3281]) ).
cnf(c_15255,plain,
( ~ ssList(sK56)
| nil = sK56
| ssItem(hd(sK56)) ),
inference(superposition,[status(thm)],[c_14880,c_220]) ).
cnf(c_15256,plain,
ssItem(hd(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_15255,c_3281,c_8924]) ).
cnf(c_15315,plain,
( ~ ssList(sK56)
| nil = sK56
| ssList(tl(sK56)) ),
inference(superposition,[status(thm)],[c_15043,c_222]) ).
cnf(c_15316,plain,
ssList(tl(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_15315,c_3281,c_8924]) ).
cnf(c_17204,plain,
( cons(hd(sK56),tl(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8924,c_224]) ).
cnf(c_17209,plain,
cons(hd(sK56),tl(sK56)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_17204,c_3281]) ).
cnf(c_17450,plain,
( ~ ssList(X0)
| app(cons(hd(sK56),nil),X0) = cons(hd(sK56),X0) ),
inference(superposition,[status(thm)],[c_15256,c_227]) ).
cnf(c_17459,plain,
( ~ ssList(X0)
| cons(hd(sK56),X0) = app(sK55,X0) ),
inference(light_normalisation,[status(thm)],[c_17450,c_12379]) ).
cnf(c_28527,plain,
( ~ ssList(app(app(nil,sK55),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(superposition,[status(thm)],[c_12101,c_67]) ).
cnf(c_28596,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(light_normalisation,[status(thm)],[c_28527,c_12101]) ).
cnf(c_28597,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| segmentP(app(sK55,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_28596,c_8923,c_141]) ).
cnf(c_43189,plain,
cons(hd(sK56),tl(sK56)) = app(sK55,tl(sK56)),
inference(superposition,[status(thm)],[c_15316,c_17459]) ).
cnf(c_43200,plain,
app(sK55,tl(sK56)) = sK56,
inference(light_normalisation,[status(thm)],[c_43189,c_17209]) ).
cnf(c_43494,plain,
( ~ ssList(app(sK55,tl(sK56)))
| ~ ssList(tl(sK56))
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_43200,c_28597]) ).
cnf(c_43499,plain,
( ~ ssList(tl(sK56))
| ~ ssList(sK56)
| segmentP(sK56,sK55) ),
inference(light_normalisation,[status(thm)],[c_43494,c_43200]) ).
cnf(c_43500,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_43499,c_14835,c_8924,c_15316]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC079+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n021.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 : Thu May 2 23:42:43 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 17.17/3.17 % SZS status Started for theBenchmark.p
% 17.17/3.17 % SZS status Theorem for theBenchmark.p
% 17.17/3.17
% 17.17/3.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 17.17/3.17
% 17.17/3.17 ------ iProver source info
% 17.17/3.17
% 17.17/3.17 git: date: 2024-05-02 19:28:25 +0000
% 17.17/3.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 17.17/3.17 git: non_committed_changes: false
% 17.17/3.17
% 17.17/3.17 ------ Parsing...
% 17.17/3.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 17.17/3.17
% 17.17/3.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 17.17/3.17
% 17.17/3.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 17.17/3.17
% 17.17/3.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.17/3.17 ------ Proving...
% 17.17/3.17 ------ Problem Properties
% 17.17/3.17
% 17.17/3.17
% 17.17/3.17 clauses 186
% 17.17/3.17 conjectures 2
% 17.17/3.17 EPR 54
% 17.17/3.17 Horn 118
% 17.17/3.17 unary 19
% 17.17/3.17 binary 41
% 17.17/3.17 lits 630
% 17.17/3.17 lits eq 81
% 17.17/3.17 fd_pure 0
% 17.17/3.17 fd_pseudo 0
% 17.17/3.17 fd_cond 22
% 17.17/3.17 fd_pseudo_cond 14
% 17.17/3.17 AC symbols 0
% 17.17/3.17
% 17.17/3.17 ------ Schedule dynamic 5 is on
% 17.17/3.17
% 17.17/3.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 17.17/3.17
% 17.17/3.17
% 17.17/3.17 ------
% 17.17/3.17 Current options:
% 17.17/3.17 ------
% 17.17/3.17
% 17.17/3.17
% 17.17/3.17
% 17.17/3.17
% 17.17/3.17 ------ Proving...
% 17.17/3.17
% 17.17/3.17
% 17.17/3.17 % SZS status Theorem for theBenchmark.p
% 17.17/3.17
% 17.17/3.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.17/3.17
% 17.17/3.18
%------------------------------------------------------------------------------