TSTP Solution File: SWC085+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC085+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:10 EDT 2024
% Result : Theorem 9.92s 2.21s
% Output : CNFRefutation 9.92s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f592)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
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)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ? [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)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
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(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(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] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f245]) ).
fof(f247,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f246,f247]) ).
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(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( frontsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( frontsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( frontsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( frontsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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])],[f222,f346,f345,f344,f343]) ).
fof(f360,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f361,plain,
! [X0,X1] :
( app(X1,sK11(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
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(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f454,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
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,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
neq(sK54,nil),
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,
( neq(sK55,nil)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( frontsegP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f554,f552,f551]) ).
fof(f560,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f553,f551]) ).
fof(f561,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f562,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
fof(f568,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_62,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK11(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f361]) ).
cnf(c_63,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK11(X0,X1)) ),
inference(cnf_transformation,[],[f360]) ).
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,[],[f568]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f592]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f454]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_247,negated_conjecture,
( nil = sK56
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_250,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_251,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f560]) ).
cnf(c_254,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f561]) ).
cnf(c_255,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f562]) ).
cnf(c_3285,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_251]) ).
cnf(c_3286,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3285]) ).
cnf(c_3287,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3286,c_141,c_3286]) ).
cnf(c_3295,plain,
( X0 != sK55
| nil != nil
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0)
| nil = sK56 ),
inference(resolution_lifted,[status(thm)],[c_249,c_250]) ).
cnf(c_3296,plain,
( ~ segmentP(sK56,sK55)
| ~ segmentP(sK55,sK55)
| ~ ssList(sK55)
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_3295]) ).
cnf(c_3297,plain,
( ~ segmentP(sK56,sK55)
| ~ segmentP(sK55,sK55) ),
inference(global_subsumption_just,[status(thm)],[c_3296,c_255,c_141,c_3286,c_3296]) ).
cnf(c_3322,plain,
frontsegP(sK56,sK55),
inference(backward_subsumption_resolution,[status(thm)],[c_247,c_3287]) ).
cnf(c_8942,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_255]) ).
cnf(c_8943,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_12109,plain,
app(nil,sK55) = sK55,
inference(superposition,[status(thm)],[c_8942,c_155]) ).
cnf(c_12191,plain,
app(sK55,nil) = sK55,
inference(superposition,[status(thm)],[c_8942,c_232]) ).
cnf(c_17138,plain,
( ~ ssList(sK56)
| ~ ssList(sK55)
| app(sK55,sK11(sK56,sK55)) = sK56 ),
inference(superposition,[status(thm)],[c_3322,c_62]) ).
cnf(c_17150,plain,
app(sK55,sK11(sK56,sK55)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_17138,c_8942,c_8943]) ).
cnf(c_24702,plain,
( ~ ssList(app(app(nil,sK55),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(superposition,[status(thm)],[c_12109,c_67]) ).
cnf(c_24766,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(light_normalisation,[status(thm)],[c_24702,c_12109]) ).
cnf(c_24767,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| segmentP(app(sK55,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_24766,c_8942,c_141]) ).
cnf(c_25276,plain,
( ~ ssList(app(sK55,nil))
| ~ ssList(nil)
| segmentP(sK55,sK55) ),
inference(superposition,[status(thm)],[c_12191,c_24767]) ).
cnf(c_25277,plain,
( ~ ssList(app(sK55,sK11(sK56,sK55)))
| ~ ssList(sK11(sK56,sK55))
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_17150,c_24767]) ).
cnf(c_25282,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(sK55,sK55) ),
inference(light_normalisation,[status(thm)],[c_25276,c_12191]) ).
cnf(c_25283,plain,
segmentP(sK55,sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_25282,c_8942,c_141]) ).
cnf(c_25284,plain,
( ~ ssList(sK11(sK56,sK55))
| ~ ssList(sK56)
| segmentP(sK56,sK55) ),
inference(light_normalisation,[status(thm)],[c_25277,c_17150]) ).
cnf(c_25285,plain,
( ~ ssList(sK11(sK56,sK55))
| segmentP(sK56,sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_25284,c_8943]) ).
cnf(c_25303,plain,
~ segmentP(sK56,sK55),
inference(backward_subsumption_resolution,[status(thm)],[c_3297,c_25283]) ).
cnf(c_25304,plain,
~ ssList(sK11(sK56,sK55)),
inference(backward_subsumption_resolution,[status(thm)],[c_25285,c_25303]) ).
cnf(c_26258,plain,
( ~ frontsegP(sK56,sK55)
| ~ ssList(sK56)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_63,c_25304]) ).
cnf(c_26259,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_26258,c_8942,c_8943,c_3322]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC085+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:32:49 EDT 2024
% 0.13/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
% 9.92/2.21 % SZS status Started for theBenchmark.p
% 9.92/2.21 % SZS status Theorem for theBenchmark.p
% 9.92/2.21
% 9.92/2.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 9.92/2.21
% 9.92/2.21 ------ iProver source info
% 9.92/2.21
% 9.92/2.21 git: date: 2024-05-02 19:28:25 +0000
% 9.92/2.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 9.92/2.21 git: non_committed_changes: false
% 9.92/2.21
% 9.92/2.21 ------ Parsing...
% 9.92/2.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 9.92/2.21
% 9.92/2.21 ------ 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
% 9.92/2.21
% 9.92/2.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.92/2.21
% 9.92/2.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.92/2.21 ------ Proving...
% 9.92/2.21 ------ Problem Properties
% 9.92/2.21
% 9.92/2.21
% 9.92/2.21 clauses 188
% 9.92/2.21 conjectures 2
% 9.92/2.21 EPR 57
% 9.92/2.21 Horn 120
% 9.92/2.21 unary 21
% 9.92/2.21 binary 42
% 9.92/2.21 lits 631
% 9.92/2.21 lits eq 81
% 9.92/2.21 fd_pure 0
% 9.92/2.21 fd_pseudo 0
% 9.92/2.21 fd_cond 22
% 9.92/2.21 fd_pseudo_cond 14
% 9.92/2.21 AC symbols 0
% 9.92/2.21
% 9.92/2.21 ------ Schedule dynamic 5 is on
% 9.92/2.21
% 9.92/2.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 9.92/2.21
% 9.92/2.21
% 9.92/2.21 ------
% 9.92/2.21 Current options:
% 9.92/2.21 ------
% 9.92/2.21
% 9.92/2.21
% 9.92/2.21
% 9.92/2.21
% 9.92/2.21 ------ Proving...
% 9.92/2.21
% 9.92/2.21
% 9.92/2.21 % SZS status Theorem for theBenchmark.p
% 9.92/2.21
% 9.92/2.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.92/2.21
% 9.92/2.21
%------------------------------------------------------------------------------