TSTP Solution File: SWC025+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC025+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:24 EDT 2023
% Result : Theorem 11.35s 2.70s
% Output : CNFRefutation 11.35s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f596)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax75) ).
fof(f76,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax76) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ? [X4] :
( ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( memberP(X2,X4)
& ~ memberP(X3,X4) ) )
& ssItem(X4) )
| ~ duplicatefreeP(X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ? [X4] :
( ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( memberP(X2,X4)
& ~ memberP(X3,X4) ) )
& ssItem(X4) )
| ~ duplicatefreeP(X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f123,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f124,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f123]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f186,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f187,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f186]) ).
fof(f188,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f76]) ).
fof(f189,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f188]) ).
fof(f192,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f192]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f317,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK49(X0)) = X0
& ssItem(X2) )
& ssList(sK49(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f318,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK49(X0)) = X0
& ssItem(X2) )
=> ( cons(sK50(X0),sK49(X0)) = X0
& ssItem(sK50(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f319,plain,
! [X0] :
( ( cons(sK50(X0),sK49(X0)) = X0
& ssItem(sK50(X0))
& ssList(sK49(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK49,sK50])],[f124,f318,f317]) ).
fof(f335,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
=> ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
! [X0] :
( ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK51])],[f187,f335]) ).
fof(f337,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
=> ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
! [X0] :
( ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK52])],[f189,f337]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK53 )
| ( nil != sK53
& nil = X1 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK53 )
| ( nil != sK53
& nil = X1 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(sK55,X4) )
& ( ~ memberP(sK55,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(sK55,X4) )
& ( ~ memberP(sK55,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ! [X4] :
( ( ( ~ memberP(sK56,X4)
| memberP(sK55,X4) )
& ( ~ memberP(sK55,X4)
| memberP(sK56,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ! [X4] :
( ( ( ~ memberP(sK56,X4)
| memberP(sK55,X4) )
& ( ~ memberP(sK55,X4)
| memberP(sK56,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(sK55)
& 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(f444,plain,
! [X0] :
( ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f319]) ).
fof(f445,plain,
! [X0] :
( ssItem(sK50(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f319]) ).
fof(f446,plain,
! [X0] :
( cons(sK50(X0),sK49(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f319]) ).
fof(f470,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f520,plain,
! [X0] :
( ssItem(sK51(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f336]) ).
fof(f521,plain,
! [X0] :
( hd(X0) = sK51(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f336]) ).
fof(f522,plain,
! [X0] :
( ssList(sK52(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f338]) ).
fof(f523,plain,
! [X0] :
( tl(X0) = sK52(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f338]) ).
fof(f525,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f193]) ).
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(f554,plain,
! [X4] :
( ~ memberP(sK55,X4)
| memberP(sK56,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
! [X4] :
( ~ memberP(sK56,X4)
| memberP(sK55,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( nil = sK53
| nil = sK54 ),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
( nil != sK54
| nil != sK53 ),
inference(cnf_transformation,[],[f347]) ).
fof(f560,plain,
( nil != sK56
| nil != sK55 ),
inference(definition_unfolding,[],[f559,f551,f552]) ).
fof(f563,plain,
( nil = sK55
| nil = sK56 ),
inference(definition_unfolding,[],[f556,f552,f551]) ).
fof(f564,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f565,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
cnf(c_145,plain,
( ~ ssList(X0)
| cons(sK50(X0),sK49(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f446]) ).
cnf(c_146,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK50(X0)) ),
inference(cnf_transformation,[],[f445]) ).
cnf(c_147,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK49(X0)) ),
inference(cnf_transformation,[],[f444]) ).
cnf(c_169,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| memberP(cons(X0,X1),X0) ),
inference(cnf_transformation,[],[f596]) ).
cnf(c_171,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f470]) ).
cnf(c_219,plain,
( ~ ssList(X0)
| hd(X0) = sK51(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f521]) ).
cnf(c_220,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK51(X0)) ),
inference(cnf_transformation,[],[f520]) ).
cnf(c_221,plain,
( ~ ssList(X0)
| tl(X0) = sK52(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f523]) ).
cnf(c_222,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK52(X0)) ),
inference(cnf_transformation,[],[f522]) ).
cnf(c_224,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f525]) ).
cnf(c_246,negated_conjecture,
( nil != sK56
| nil != sK55 ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_247,negated_conjecture,
( nil = sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_248,negated_conjecture,
( ~ memberP(sK56,X0)
| ~ ssItem(X0)
| memberP(sK55,X0) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_249,negated_conjecture,
( ~ memberP(sK55,X0)
| ~ ssItem(X0)
| memberP(sK56,X0) ),
inference(cnf_transformation,[],[f554]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f564]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f565]) ).
cnf(c_9786,plain,
( X0 != X1
| ~ memberP(X1,X2)
| memberP(X0,X2) ),
theory(equality) ).
cnf(c_15823,plain,
( hd(sK55) = sK51(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_254,c_219]) ).
cnf(c_15997,plain,
( tl(sK55) = sK52(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_254,c_221]) ).
cnf(c_16298,plain,
( ~ ssList(sK55)
| nil = sK55
| ssItem(hd(sK55)) ),
inference(superposition,[status(thm)],[c_15823,c_220]) ).
cnf(c_16299,plain,
( nil = sK55
| ssItem(hd(sK55)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_16298,c_254]) ).
cnf(c_16376,plain,
( ~ ssList(sK55)
| nil = sK55
| ssList(tl(sK55)) ),
inference(superposition,[status(thm)],[c_15997,c_222]) ).
cnf(c_16377,plain,
( nil = sK55
| ssList(tl(sK55)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_16376,c_254]) ).
cnf(c_17094,plain,
( cons(sK50(sK56),sK49(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_253,c_145]) ).
cnf(c_17273,plain,
( cons(hd(sK55),tl(sK55)) = sK55
| nil = sK55 ),
inference(superposition,[status(thm)],[c_254,c_224]) ).
cnf(c_17606,plain,
( ~ ssItem(hd(sK55))
| ~ ssList(tl(sK55))
| nil = sK55
| memberP(sK55,hd(sK55)) ),
inference(superposition,[status(thm)],[c_17273,c_169]) ).
cnf(c_23292,plain,
( ~ memberP(nil,hd(sK55))
| ~ ssItem(hd(sK55)) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_23293,plain,
( ~ memberP(sK55,hd(sK55))
| ~ ssItem(hd(sK55))
| memberP(sK56,hd(sK55)) ),
inference(instantiation,[status(thm)],[c_249]) ).
cnf(c_38309,plain,
( cons(sK50(sK56),sK49(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_253,c_145]) ).
cnf(c_38310,plain,
( cons(sK50(sK55),sK49(sK55)) = sK55
| nil = sK55 ),
inference(superposition,[status(thm)],[c_254,c_145]) ).
cnf(c_38594,plain,
( X0 != sK56
| ~ memberP(sK56,hd(sK55))
| memberP(X0,hd(sK55)) ),
inference(instantiation,[status(thm)],[c_9786]) ).
cnf(c_38595,plain,
( nil != sK56
| ~ memberP(sK56,hd(sK55))
| memberP(nil,hd(sK55)) ),
inference(instantiation,[status(thm)],[c_38594]) ).
cnf(c_40891,plain,
cons(sK50(sK56),sK49(sK56)) = sK56,
inference(global_subsumption_just,[status(thm)],[c_38309,c_246,c_16299,c_16377,c_17094,c_17606,c_23293,c_23292,c_38595]) ).
cnf(c_40899,plain,
( ~ ssItem(sK50(sK56))
| ~ ssList(sK49(sK56))
| memberP(sK56,sK50(sK56)) ),
inference(superposition,[status(thm)],[c_40891,c_169]) ).
cnf(c_41206,plain,
nil = sK55,
inference(global_subsumption_just,[status(thm)],[c_38310,c_247,c_246,c_16299,c_16377,c_17606,c_23293,c_23292,c_38595]) ).
cnf(c_41225,plain,
( ~ memberP(sK56,X0)
| ~ ssItem(X0)
| memberP(nil,X0) ),
inference(demodulation,[status(thm)],[c_248,c_41206]) ).
cnf(c_41226,plain,
( nil != nil
| nil != sK56 ),
inference(demodulation,[status(thm)],[c_246,c_41206]) ).
cnf(c_41230,plain,
nil != sK56,
inference(equality_resolution_simp,[status(thm)],[c_41226]) ).
cnf(c_41249,plain,
( ~ ssItem(X0)
| ~ memberP(sK56,X0) ),
inference(global_subsumption_just,[status(thm)],[c_41225,c_171,c_41225]) ).
cnf(c_41250,plain,
( ~ memberP(sK56,X0)
| ~ ssItem(X0) ),
inference(renaming,[status(thm)],[c_41249]) ).
cnf(c_41488,plain,
( ~ ssItem(sK50(sK56))
| ~ ssList(sK49(sK56)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_40899,c_41250]) ).
cnf(c_41491,plain,
( ~ ssList(sK49(sK56))
| ~ ssList(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_146,c_41488]) ).
cnf(c_41492,plain,
~ ssList(sK49(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_41491,c_41230,c_253]) ).
cnf(c_41493,plain,
( ~ ssList(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_147,c_41492]) ).
cnf(c_41494,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_41493,c_41230,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC025+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.35 % Computer : n017.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon Aug 28 17:20:43 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 11.35/2.70 % SZS status Started for theBenchmark.p
% 11.35/2.70 % SZS status Theorem for theBenchmark.p
% 11.35/2.70
% 11.35/2.70 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 11.35/2.70
% 11.35/2.70 ------ iProver source info
% 11.35/2.70
% 11.35/2.70 git: date: 2023-05-31 18:12:56 +0000
% 11.35/2.70 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 11.35/2.70 git: non_committed_changes: false
% 11.35/2.70 git: last_make_outside_of_git: false
% 11.35/2.70
% 11.35/2.70 ------ Parsing...
% 11.35/2.70 ------ Clausification by vclausify_rel & Parsing by iProver...
% 11.35/2.70
% 11.35/2.70 ------ 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
% 11.35/2.70
% 11.35/2.70 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 11.35/2.70
% 11.35/2.70 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 11.35/2.70 ------ Proving...
% 11.35/2.70 ------ Problem Properties
% 11.35/2.70
% 11.35/2.70
% 11.35/2.70 clauses 187
% 11.35/2.70 conjectures 7
% 11.35/2.70 EPR 56
% 11.35/2.70 Horn 118
% 11.35/2.70 unary 19
% 11.35/2.70 binary 42
% 11.35/2.70 lits 631
% 11.35/2.70 lits eq 82
% 11.35/2.70 fd_pure 0
% 11.35/2.70 fd_pseudo 0
% 11.35/2.70 fd_cond 21
% 11.35/2.70 fd_pseudo_cond 14
% 11.35/2.70 AC symbols 0
% 11.35/2.70
% 11.35/2.70 ------ Schedule dynamic 5 is on
% 11.35/2.70
% 11.35/2.70 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 11.35/2.70
% 11.35/2.70
% 11.35/2.70 ------
% 11.35/2.70 Current options:
% 11.35/2.70 ------
% 11.35/2.70
% 11.35/2.70
% 11.35/2.70
% 11.35/2.70
% 11.35/2.70 ------ Proving...
% 11.35/2.70
% 11.35/2.70
% 11.35/2.70 % SZS status Theorem for theBenchmark.p
% 11.35/2.70
% 11.35/2.70 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.35/2.70
% 11.35/2.71
%------------------------------------------------------------------------------