TSTP Solution File: SWC068+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC068+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:44 EDT 2023
% Result : Theorem 7.51s 1.72s
% Output : CNFRefutation 7.51s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f592)
% Comments :
%------------------------------------------------------------------------------
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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
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)
=> ( ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3
| app(X3,X3) != X2 ) ) ) ) ),
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 = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3
| app(X3,X3) != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f103,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(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(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f253,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,[],[f103]) ).
fof(f254,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,[],[f253]) ).
fof(f255,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(f256,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(f257,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])],[f254,f256,f255]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f339,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,[],[f200]) ).
fof(f340,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,[],[f339]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != X1 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK53 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != X1 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK53 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK53 = X2
& sK54 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK53 = X2
& sK54 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = X3
& app(X3,X3) = sK55
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = X3
& app(X3,X3) = sK55
& ssList(X3) )
=> ( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = sK56
& sK55 = app(sK56,sK56)
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = sK56
& sK55 = app(sK56,sK56)
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f369,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,[],[f257]) ).
fof(f438,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f452,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f454,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f531,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f340]) ).
fof(f533,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK55 = app(sK56,sK56),
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( nil != sK55
| nil != sK56 ),
inference(definition_unfolding,[],[f555,f553,f552]) ).
fof(f557,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f554,f553,f552]) ).
fof(f558,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f552]) ).
fof(f559,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f553]) ).
fof(f565,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,[],[f369]) ).
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,[],[f565]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f438]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f452]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f454]) ).
cnf(c_229,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(cnf_transformation,[],[f592]) ).
cnf(c_230,plain,
( app(X0,X1) != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = nil ),
inference(cnf_transformation,[],[f531]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_246,negated_conjecture,
( nil != sK55
| nil != sK56 ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_247,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_248,negated_conjecture,
app(sK56,sK56) = sK55,
inference(cnf_transformation,[],[f551]) ).
cnf(c_251,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f558]) ).
cnf(c_252,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f559]) ).
cnf(c_293,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_365,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_229,c_141,c_293]) ).
cnf(c_3218,plain,
( X0 != X1
| X2 != nil
| ~ segmentP(sK55,X1)
| ~ segmentP(sK56,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X0 = X2 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3219,plain,
( ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| X0 = nil ),
inference(unflattening,[status(thm)],[c_3218]) ).
cnf(c_3221,plain,
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| X0 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3219,c_141,c_3219]) ).
cnf(c_3222,plain,
( ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(renaming,[status(thm)],[c_3221]) ).
cnf(c_11996,plain,
app(nil,sK56) = sK56,
inference(superposition,[status(thm)],[c_251,c_155]) ).
cnf(c_12079,plain,
app(sK56,nil) = sK56,
inference(superposition,[status(thm)],[c_251,c_232]) ).
cnf(c_12080,plain,
app(sK55,nil) = sK55,
inference(superposition,[status(thm)],[c_252,c_232]) ).
cnf(c_18125,plain,
( nil != sK55
| ~ ssList(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_248,c_230]) ).
cnf(c_18143,plain,
( nil != sK55
| nil = sK56 ),
inference(forward_subsumption_resolution,[status(thm)],[c_18125,c_251]) ).
cnf(c_18197,plain,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_18143,c_246,c_18143]) ).
cnf(c_26078,plain,
( ~ ssList(app(app(sK56,sK56),X0))
| ~ ssList(X0)
| ~ ssList(sK56)
| segmentP(app(sK55,X0),sK56) ),
inference(superposition,[status(thm)],[c_248,c_67]) ).
cnf(c_26081,plain,
( ~ ssList(app(app(nil,sK56),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK56)
| segmentP(app(sK56,X0),sK56) ),
inference(superposition,[status(thm)],[c_11996,c_67]) ).
cnf(c_26123,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| ~ ssList(sK56)
| segmentP(app(sK55,X0),sK56) ),
inference(light_normalisation,[status(thm)],[c_26078,c_248]) ).
cnf(c_26124,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| segmentP(app(sK55,X0),sK56) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26123,c_251]) ).
cnf(c_26148,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK56)
| segmentP(app(sK56,X0),sK56) ),
inference(light_normalisation,[status(thm)],[c_26081,c_11996]) ).
cnf(c_26149,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(X0)
| segmentP(app(sK56,X0),sK56) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26148,c_251,c_141]) ).
cnf(c_27023,plain,
( ~ ssList(X0)
| ~ ssList(sK55)
| ssList(app(sK55,X0)) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_27239,plain,
( ~ ssList(X0)
| segmentP(app(sK55,X0),sK56) ),
inference(global_subsumption_just,[status(thm)],[c_26124,c_252,c_26124,c_27023]) ).
cnf(c_27246,plain,
( ~ ssList(nil)
| segmentP(sK55,sK56) ),
inference(superposition,[status(thm)],[c_12080,c_27239]) ).
cnf(c_27251,plain,
segmentP(sK55,sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_27246,c_141]) ).
cnf(c_27337,plain,
( ~ ssList(app(sK56,nil))
| ~ ssList(nil)
| segmentP(sK56,sK56) ),
inference(superposition,[status(thm)],[c_12079,c_26149]) ).
cnf(c_27343,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| segmentP(sK56,sK56) ),
inference(light_normalisation,[status(thm)],[c_27337,c_12079]) ).
cnf(c_27344,plain,
segmentP(sK56,sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_27343,c_251,c_141]) ).
cnf(c_27990,plain,
( ~ segmentP(sK56,sK56)
| ~ ssList(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_27251,c_3222]) ).
cnf(c_27991,plain,
nil = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_27990,c_251,c_27344]) ).
cnf(c_28062,plain,
app(nil,nil) = sK55,
inference(demodulation,[status(thm)],[c_248,c_27991]) ).
cnf(c_28066,plain,
nil = sK55,
inference(light_normalisation,[status(thm)],[c_28062,c_365]) ).
cnf(c_28067,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_28066,c_18197]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC068+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.15 % Command : run_iprover %s %d THM
% 0.14/0.37 % Computer : n017.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon Aug 28 16:43:13 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.51/1.72 % SZS status Started for theBenchmark.p
% 7.51/1.72 % SZS status Theorem for theBenchmark.p
% 7.51/1.72
% 7.51/1.72 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.51/1.72
% 7.51/1.72 ------ iProver source info
% 7.51/1.72
% 7.51/1.72 git: date: 2023-05-31 18:12:56 +0000
% 7.51/1.72 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.51/1.72 git: non_committed_changes: false
% 7.51/1.72 git: last_make_outside_of_git: false
% 7.51/1.72
% 7.51/1.72 ------ Parsing...
% 7.51/1.72 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.51/1.72
% 7.51/1.72 ------ 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
% 7.51/1.72
% 7.51/1.72 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.51/1.72
% 7.51/1.72 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.51/1.72 ------ Proving...
% 7.51/1.72 ------ Problem Properties
% 7.51/1.72
% 7.51/1.72
% 7.51/1.72 clauses 185
% 7.51/1.72 conjectures 4
% 7.51/1.72 EPR 53
% 7.51/1.72 Horn 117
% 7.51/1.72 unary 19
% 7.51/1.72 binary 41
% 7.51/1.72 lits 627
% 7.51/1.72 lits eq 82
% 7.51/1.72 fd_pure 0
% 7.51/1.72 fd_pseudo 0
% 7.51/1.72 fd_cond 22
% 7.51/1.72 fd_pseudo_cond 14
% 7.51/1.72 AC symbols 0
% 7.51/1.72
% 7.51/1.72 ------ Schedule dynamic 5 is on
% 7.51/1.72
% 7.51/1.72 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.51/1.72
% 7.51/1.72
% 7.51/1.72 ------
% 7.51/1.72 Current options:
% 7.51/1.72 ------
% 7.51/1.72
% 7.51/1.72
% 7.51/1.72
% 7.51/1.72
% 7.51/1.72 ------ Proving...
% 7.51/1.72
% 7.51/1.72
% 7.51/1.72 % SZS status Theorem for theBenchmark.p
% 7.51/1.72
% 7.51/1.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.51/1.73
% 7.51/1.73
%------------------------------------------------------------------------------