TSTP Solution File: SWC098+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC098+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:40:58 EDT 2023
% Result : Theorem 0.78s 1.18s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 66 ( 14 unt; 0 def)
% Number of atoms : 489 ( 203 equ)
% Maximal formula atoms : 48 ( 7 avg)
% Number of connectives : 640 ( 217 ~; 210 |; 189 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn; 53 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X6] :
( ssItem(X6)
=> ( ? [X7] :
( leq(X6,X7)
& memberP(X3,X7)
& X6 != X7
& ssItem(X7) )
| ~ memberP(X3,X6)
| cons(X6,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( memberP(X1,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X1,X5) ) )
& cons(X4,nil) = X0
& ssItem(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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X6] :
( ssItem(X6)
=> ( ? [X7] :
( leq(X6,X7)
& memberP(X3,X7)
& X6 != X7
& ssItem(X7) )
| ~ memberP(X3,X6)
| cons(X6,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( memberP(X1,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X1,X5) ) )
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ? [X6] :
( memberP(X1,X6)
& ! [X7] :
( ssItem(X7)
=> ( X6 = X7
| ~ leq(X6,X7)
| ~ memberP(X1,X7) ) )
& cons(X6,nil) = X0
& ssItem(X6) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != X0
| ~ ssItem(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != X0
| ~ ssItem(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != X0
| ~ ssItem(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK53
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK53
| ~ ssItem(X6) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK53
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK53
| ~ ssItem(X6) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ! [X6] :
( ~ memberP(sK54,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK54,X7)
& ssItem(X7) )
| cons(X6,nil) != sK53
| ~ ssItem(X6) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ! [X6] :
( ~ memberP(sK54,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK54,X7)
& ssItem(X7) )
| cons(X6,nil) != sK53
| ~ ssItem(X6) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ! [X6] :
( ~ memberP(sK54,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK54,X7)
& ssItem(X7) )
| cons(X6,nil) != sK53
| ~ ssItem(X6) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ! [X6] :
( ~ memberP(sK54,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK54,X7)
& ssItem(X7) )
| cons(X6,nil) != sK53
| ~ ssItem(X6) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( nil = sK55
& nil = sK56 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK56,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ! [X6] :
( ~ memberP(sK54,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK54,X7)
& ssItem(X7) )
| cons(X6,nil) != sK53
| ~ ssItem(X6) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK56,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(sK57,X5)
| ~ memberP(sK56,X5)
| sK57 = X5
| ~ ssItem(X5) )
& memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X6] :
( ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK54,X7)
& ssItem(X7) )
=> ( sK58(X6) != X6
& leq(X6,sK58(X6))
& memberP(sK54,sK58(X6))
& ssItem(sK58(X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ( ( nil = sK55
& nil = sK56 )
| ( ! [X5] :
( ~ leq(sK57,X5)
| ~ memberP(sK56,X5)
| sK57 = X5
| ~ ssItem(X5) )
& memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) )
& ( nil != sK53
| nil != sK54 )
& ! [X6] :
( ~ memberP(sK54,X6)
| ( sK58(X6) != X6
& leq(X6,sK58(X6))
& memberP(sK54,sK58(X6))
& ssItem(sK58(X6)) )
| cons(X6,nil) != sK53
| ~ ssItem(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(f554,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f350]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
! [X6] :
( ~ memberP(sK54,X6)
| ssItem(sK58(X6))
| cons(X6,nil) != sK53
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
! [X6] :
( ~ memberP(sK54,X6)
| memberP(sK54,sK58(X6))
| cons(X6,nil) != sK53
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
! [X6] :
( ~ memberP(sK54,X6)
| leq(X6,sK58(X6))
| cons(X6,nil) != sK53
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f350]) ).
fof(f559,plain,
! [X6] :
( ~ memberP(sK54,X6)
| sK58(X6) != X6
| cons(X6,nil) != sK53
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f350]) ).
fof(f560,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f350]) ).
fof(f561,plain,
( nil = sK56
| ssItem(sK57) ),
inference(cnf_transformation,[],[f350]) ).
fof(f562,plain,
( nil = sK56
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f350]) ).
fof(f563,plain,
( nil = sK56
| memberP(sK56,sK57) ),
inference(cnf_transformation,[],[f350]) ).
fof(f564,plain,
! [X5] :
( nil = sK56
| ~ leq(sK57,X5)
| ~ memberP(sK56,X5)
| sK57 = X5
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f350]) ).
fof(f565,plain,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f350]) ).
fof(f566,plain,
( nil = sK55
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f350]) ).
fof(f567,plain,
( nil = sK55
| memberP(sK56,sK57) ),
inference(cnf_transformation,[],[f350]) ).
fof(f568,plain,
! [X5] :
( nil = sK55
| ~ leq(sK57,X5)
| ~ memberP(sK56,X5)
| sK57 = X5
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f350]) ).
fof(f569,plain,
( nil != sK55
| nil != sK56 ),
inference(definition_unfolding,[],[f560,f555,f554]) ).
fof(f570,plain,
! [X6] :
( ~ memberP(sK56,X6)
| sK58(X6) != X6
| cons(X6,nil) != sK55
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f559,f554,f555]) ).
fof(f571,plain,
! [X6] :
( ~ memberP(sK56,X6)
| leq(X6,sK58(X6))
| cons(X6,nil) != sK55
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f558,f554,f555]) ).
fof(f572,plain,
! [X6] :
( ~ memberP(sK56,X6)
| memberP(sK56,sK58(X6))
| cons(X6,nil) != sK55
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f557,f554,f554,f555]) ).
fof(f573,plain,
! [X6] :
( ~ memberP(sK56,X6)
| ssItem(sK58(X6))
| cons(X6,nil) != sK55
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f556,f554,f555]) ).
cnf(c_246,negated_conjecture,
( ~ memberP(sK56,X0)
| ~ leq(sK57,X0)
| ~ ssItem(X0)
| X0 = sK57
| nil = sK55 ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_247,negated_conjecture,
( nil = sK55
| memberP(sK56,sK57) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_248,negated_conjecture,
( cons(sK57,nil) = sK55
| nil = sK55 ),
inference(cnf_transformation,[],[f566]) ).
cnf(c_249,negated_conjecture,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f565]) ).
cnf(c_250,negated_conjecture,
( ~ memberP(sK56,X0)
| ~ leq(sK57,X0)
| ~ ssItem(X0)
| X0 = sK57
| nil = sK56 ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_251,negated_conjecture,
( nil = sK56
| memberP(sK56,sK57) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_252,negated_conjecture,
( cons(sK57,nil) = sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_253,negated_conjecture,
( nil = sK56
| ssItem(sK57) ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_254,negated_conjecture,
( nil != sK55
| nil != sK56 ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_255,negated_conjecture,
( cons(X0,nil) != sK55
| sK58(X0) != X0
| ~ memberP(sK56,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f570]) ).
cnf(c_256,negated_conjecture,
( cons(X0,nil) != sK55
| ~ memberP(sK56,X0)
| ~ ssItem(X0)
| leq(X0,sK58(X0)) ),
inference(cnf_transformation,[],[f571]) ).
cnf(c_257,negated_conjecture,
( cons(X0,nil) != sK55
| ~ memberP(sK56,X0)
| ~ ssItem(X0)
| memberP(sK56,sK58(X0)) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_258,negated_conjecture,
( cons(X0,nil) != sK55
| ~ memberP(sK56,X0)
| ~ ssItem(X0)
| ssItem(sK58(X0)) ),
inference(cnf_transformation,[],[f573]) ).
cnf(c_375,negated_conjecture,
ssItem(sK57),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_249,c_254]) ).
cnf(c_377,negated_conjecture,
ssItem(sK57),
inference(global_subsumption_just,[status(thm)],[c_249,c_375]) ).
cnf(c_385,negated_conjecture,
memberP(sK56,sK57),
inference(global_subsumption_just,[status(thm)],[c_251,c_251,c_247,c_254]) ).
cnf(c_387,negated_conjecture,
memberP(sK56,sK57),
inference(global_subsumption_just,[status(thm)],[c_247,c_385]) ).
cnf(c_391,negated_conjecture,
cons(sK57,nil) = sK55,
inference(global_subsumption_just,[status(thm)],[c_252,c_254,c_252,c_248]) ).
cnf(c_393,negated_conjecture,
cons(sK57,nil) = sK55,
inference(global_subsumption_just,[status(thm)],[c_248,c_391]) ).
cnf(c_405,plain,
( X0 = sK57
| ~ ssItem(X0)
| ~ leq(sK57,X0)
| ~ memberP(sK56,X0) ),
inference(global_subsumption_just,[status(thm)],[c_250,c_254,c_250,c_246]) ).
cnf(c_406,negated_conjecture,
( ~ memberP(sK56,X0)
| ~ leq(sK57,X0)
| ~ ssItem(X0)
| X0 = sK57 ),
inference(renaming,[status(thm)],[c_405]) ).
cnf(c_408,plain,
( X0 = sK57
| ~ ssItem(X0)
| ~ leq(sK57,X0)
| ~ memberP(sK56,X0) ),
inference(global_subsumption_just,[status(thm)],[c_246,c_406]) ).
cnf(c_409,negated_conjecture,
( ~ memberP(sK56,X0)
| ~ leq(sK57,X0)
| ~ ssItem(X0)
| X0 = sK57 ),
inference(renaming,[status(thm)],[c_408]) ).
cnf(c_11889,plain,
( ~ memberP(sK56,sK57)
| ~ ssItem(sK57)
| ssItem(sK58(sK57)) ),
inference(superposition,[status(thm)],[c_393,c_258]) ).
cnf(c_11890,plain,
ssItem(sK58(sK57)),
inference(forward_subsumption_resolution,[status(thm)],[c_11889,c_377,c_387]) ).
cnf(c_11899,plain,
( ~ memberP(sK56,sK57)
| ~ ssItem(sK57)
| leq(sK57,sK58(sK57)) ),
inference(superposition,[status(thm)],[c_393,c_256]) ).
cnf(c_11900,plain,
leq(sK57,sK58(sK57)),
inference(forward_subsumption_resolution,[status(thm)],[c_11899,c_377,c_387]) ).
cnf(c_11909,plain,
( ~ memberP(sK56,sK57)
| ~ ssItem(sK57)
| memberP(sK56,sK58(sK57)) ),
inference(superposition,[status(thm)],[c_393,c_257]) ).
cnf(c_11910,plain,
memberP(sK56,sK58(sK57)),
inference(forward_subsumption_resolution,[status(thm)],[c_11909,c_377,c_387]) ).
cnf(c_11919,plain,
( sK58(sK57) != sK57
| ~ memberP(sK56,sK57)
| ~ ssItem(sK57) ),
inference(superposition,[status(thm)],[c_393,c_255]) ).
cnf(c_11920,plain,
sK58(sK57) != sK57,
inference(forward_subsumption_resolution,[status(thm)],[c_11919,c_377,c_387]) ).
cnf(c_11921,plain,
( ~ leq(sK57,sK58(sK57))
| ~ ssItem(sK58(sK57))
| sK58(sK57) = sK57 ),
inference(superposition,[status(thm)],[c_11910,c_409]) ).
cnf(c_11922,plain,
sK58(sK57) = sK57,
inference(forward_subsumption_resolution,[status(thm)],[c_11921,c_11890,c_11900]) ).
cnf(c_11926,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11922,c_11920]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC098+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 17:22:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.78/1.18 % SZS status Started for theBenchmark.p
% 0.78/1.18 % SZS status Theorem for theBenchmark.p
% 0.78/1.18
% 0.78/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.78/1.18
% 0.78/1.18 ------ iProver source info
% 0.78/1.18
% 0.78/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.78/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.78/1.18 git: non_committed_changes: false
% 0.78/1.18 git: last_make_outside_of_git: false
% 0.78/1.18
% 0.78/1.18 ------ Parsing...
% 0.78/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.78/1.18
% 0.78/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: 4 0s sf_e pe_s pe_e
% 0.78/1.18
% 0.78/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.78/1.18
% 0.78/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.78/1.18 ------ Proving...
% 0.78/1.18 ------ Problem Properties
% 0.78/1.18
% 0.78/1.18
% 0.78/1.18 clauses 191
% 0.78/1.18 conjectures 11
% 0.78/1.18 EPR 55
% 0.78/1.18 Horn 123
% 0.78/1.18 unary 21
% 0.78/1.18 binary 41
% 0.78/1.18 lits 645
% 0.78/1.18 lits eq 87
% 0.78/1.18 fd_pure 0
% 0.78/1.18 fd_pseudo 0
% 0.78/1.18 fd_cond 22
% 0.78/1.18 fd_pseudo_cond 14
% 0.78/1.18 AC symbols 0
% 0.78/1.18
% 0.78/1.18 ------ Schedule dynamic 5 is on
% 0.78/1.18
% 0.78/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.78/1.18
% 0.78/1.18
% 0.78/1.18 ------
% 0.78/1.18 Current options:
% 0.78/1.18 ------
% 0.78/1.18
% 0.78/1.18
% 0.78/1.18
% 0.78/1.18
% 0.78/1.18 ------ Proving...
% 0.78/1.18
% 0.78/1.18
% 0.78/1.18 % SZS status Theorem for theBenchmark.p
% 0.78/1.18
% 0.78/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.18
% 0.80/1.18
%------------------------------------------------------------------------------