TSTP Solution File: SWC325+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC325+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 : Thu Aug 31 20:42:33 EDT 2023
% Result : Theorem 4.03s 1.18s
% Output : CNFRefutation 4.03s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f597)
% Comments :
%------------------------------------------------------------------------------
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(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| 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)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| 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)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(X7,X6) = X0
& app(X6,X7) = X1
& ssList(X7) )
& ssList(X6) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
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(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& 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)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f317,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = sK55
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK55 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = sK55
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK55 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK56
& app(cons(X4,nil),X5) = sK55
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != sK56
| nil = sK55 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK56
& app(cons(X4,nil),X5) = sK55
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK56 = app(X5,cons(sK57,nil))
& sK55 = app(cons(sK57,nil),X5)
& ssList(X5) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X5] :
( sK56 = app(X5,cons(sK57,nil))
& sK55 = app(cons(sK57,nil),X5)
& ssList(X5) )
=> ( sK56 = app(sK58,cons(sK57,nil))
& sK55 = app(cons(sK57,nil),sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ( ~ neq(sK56,nil)
| ( sK56 = app(sK58,cons(sK57,nil))
& sK55 = app(cons(sK57,nil),sK58)
& ssList(sK58)
& ssItem(sK57) ) )
& ( nil != sK56
| nil = sK55 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58])],[f223,f349,f348,f347,f346,f345,f344]) ).
fof(f441,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f442,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f443,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f536,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f551,plain,
ssList(sK54),
inference(cnf_transformation,[],[f350]) ).
fof(f554,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f350]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
! [X6,X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f350]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f350]) ).
fof(f560,plain,
( ~ neq(sK56,nil)
| sK55 = app(cons(sK57,nil),sK58) ),
inference(cnf_transformation,[],[f350]) ).
fof(f561,plain,
( ~ neq(sK56,nil)
| sK56 = app(sK58,cons(sK57,nil)) ),
inference(cnf_transformation,[],[f350]) ).
fof(f562,plain,
! [X6,X7] :
( app(X7,X6) != sK55
| app(X6,X7) != sK56
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f556,f555,f554]) ).
fof(f563,plain,
ssList(sK56),
inference(definition_unfolding,[],[f551,f554]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f441]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f442]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f443]) ).
cnf(c_229,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(cnf_transformation,[],[f597]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f536]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| app(sK58,cons(sK57,nil)) = sK56 ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| app(cons(sK57,nil),sK58) = sK55 ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_251,negated_conjecture,
( app(X0,X1) != sK55
| app(X1,X0) != sK56
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_254,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f563]) ).
cnf(c_296,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_369,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_229,c_141,c_296]) ).
cnf(c_3252,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| ssItem(sK57) ),
inference(resolution_lifted,[status(thm)],[c_138,c_249]) ).
cnf(c_3253,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| ssItem(sK57) ),
inference(unflattening,[status(thm)],[c_3252]) ).
cnf(c_3254,plain,
( sK56 = nil
| ssItem(sK57) ),
inference(global_subsumption_just,[status(thm)],[c_3253,c_254,c_141,c_3253]) ).
cnf(c_3262,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| ssList(sK58) ),
inference(resolution_lifted,[status(thm)],[c_138,c_248]) ).
cnf(c_3263,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| ssList(sK58) ),
inference(unflattening,[status(thm)],[c_3262]) ).
cnf(c_3264,plain,
( sK56 = nil
| ssList(sK58) ),
inference(global_subsumption_just,[status(thm)],[c_3263,c_254,c_141,c_3263]) ).
cnf(c_3272,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| app(cons(sK57,nil),sK58) = sK55
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3273,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| app(cons(sK57,nil),sK58) = sK55
| sK56 = nil ),
inference(unflattening,[status(thm)],[c_3272]) ).
cnf(c_3274,plain,
( app(cons(sK57,nil),sK58) = sK55
| sK56 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3273,c_254,c_141,c_3273]) ).
cnf(c_3282,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK58,cons(sK57,nil)) = sK56
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).
cnf(c_3283,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| app(sK58,cons(sK57,nil)) = sK56
| sK56 = nil ),
inference(unflattening,[status(thm)],[c_3282]) ).
cnf(c_3284,plain,
( app(sK58,cons(sK57,nil)) = sK56
| sK56 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3283,c_254,c_141,c_3283]) ).
cnf(c_11796,plain,
( app(sK58,cons(sK57,nil)) != sK56
| ~ ssList(cons(sK57,nil))
| ~ ssList(sK58)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_3274,c_251]) ).
cnf(c_11805,plain,
( app(cons(sK57,nil),sK58) != sK56
| sK56 != sK55
| ~ ssList(cons(sK57,nil))
| ~ ssList(sK58)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_3284,c_251]) ).
cnf(c_11811,plain,
( app(nil,nil) != sK56
| nil != sK55
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_369,c_251]) ).
cnf(c_11812,plain,
( nil != sK56
| nil != sK55
| ~ ssList(nil) ),
inference(light_normalisation,[status(thm)],[c_11811,c_369]) ).
cnf(c_11816,plain,
( ~ ssList(sK58)
| ~ ssList(cons(sK57,nil))
| app(sK58,cons(sK57,nil)) != sK56 ),
inference(global_subsumption_just,[status(thm)],[c_11796,c_141,c_250,c_11796,c_11812]) ).
cnf(c_11817,plain,
( app(sK58,cons(sK57,nil)) != sK56
| ~ ssList(cons(sK57,nil))
| ~ ssList(sK58) ),
inference(renaming,[status(thm)],[c_11816]) ).
cnf(c_11824,plain,
( ~ ssList(cons(sK57,nil))
| ~ ssList(sK58)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_3284,c_11817]) ).
cnf(c_11828,plain,
( ~ ssList(sK58)
| ~ ssList(cons(sK57,nil)) ),
inference(global_subsumption_just,[status(thm)],[c_11805,c_141,c_250,c_11812,c_11824]) ).
cnf(c_11829,plain,
( ~ ssList(cons(sK57,nil))
| ~ ssList(sK58) ),
inference(renaming,[status(thm)],[c_11828]) ).
cnf(c_11834,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_11812,c_141,c_250,c_11812]) ).
cnf(c_12536,plain,
( ~ ssItem(sK57)
| ~ ssList(nil)
| ~ ssList(sK58) ),
inference(superposition,[status(thm)],[c_140,c_11829]) ).
cnf(c_12537,plain,
( ~ ssItem(sK57)
| ~ ssList(sK58) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12536,c_141]) ).
cnf(c_12582,plain,
( ~ ssList(sK58)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_3254,c_12537]) ).
cnf(c_12583,plain,
~ ssList(sK58),
inference(forward_subsumption_resolution,[status(thm)],[c_12582,c_11834]) ).
cnf(c_12584,plain,
nil = sK56,
inference(backward_subsumption_resolution,[status(thm)],[c_3264,c_12583]) ).
cnf(c_12585,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12584,c_11834]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC325+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Aug 28 17:56:37 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.03/1.18 % SZS status Started for theBenchmark.p
% 4.03/1.18 % SZS status Theorem for theBenchmark.p
% 4.03/1.18
% 4.03/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.03/1.18
% 4.03/1.18 ------ iProver source info
% 4.03/1.18
% 4.03/1.18 git: date: 2023-05-31 18:12:56 +0000
% 4.03/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.03/1.18 git: non_committed_changes: false
% 4.03/1.18 git: last_make_outside_of_git: false
% 4.03/1.18
% 4.03/1.18 ------ Parsing...
% 4.03/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.03/1.18
% 4.03/1.18 ------ 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
% 4.03/1.18
% 4.03/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.03/1.18
% 4.03/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.03/1.18 ------ Proving...
% 4.03/1.18 ------ Problem Properties
% 4.03/1.18
% 4.03/1.18
% 4.03/1.18 clauses 188
% 4.03/1.18 conjectures 4
% 4.03/1.18 EPR 54
% 4.03/1.18 Horn 116
% 4.03/1.18 unary 18
% 4.03/1.18 binary 45
% 4.03/1.18 lits 634
% 4.03/1.18 lits eq 88
% 4.03/1.18 fd_pure 0
% 4.03/1.18 fd_pseudo 0
% 4.03/1.18 fd_cond 21
% 4.03/1.18 fd_pseudo_cond 14
% 4.03/1.18 AC symbols 0
% 4.03/1.18
% 4.03/1.18 ------ Schedule dynamic 5 is on
% 4.03/1.18
% 4.03/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.03/1.18
% 4.03/1.18
% 4.03/1.18 ------
% 4.03/1.18 Current options:
% 4.03/1.18 ------
% 4.03/1.18
% 4.03/1.18
% 4.03/1.18
% 4.03/1.18
% 4.03/1.18 ------ Proving...
% 4.03/1.18
% 4.03/1.18
% 4.03/1.18 % SZS status Theorem for theBenchmark.p
% 4.03/1.18
% 4.03/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.03/1.18
% 4.03/1.18
%------------------------------------------------------------------------------