TSTP Solution File: COM023+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : COM023+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 : Wed Aug 30 18:42:08 EDT 2023
% Result : Theorem 0.45s 1.17s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 69 ( 10 unt; 0 def)
% Number of atoms : 318 ( 1 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 415 ( 166 ~; 171 |; 67 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 122 ( 0 sgn; 72 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aRewritingSystem0(X0)
=> ( isConfluent0(X0)
<=> ! [X1,X2,X3] :
( ( sdtmndtasgtdt0(X1,X0,X3)
& sdtmndtasgtdt0(X1,X0,X2)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCRDef) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656) ).
fof(f17,axiom,
! [X0,X1,X2] :
( ( sdtmndtasgtdt0(X0,xR,X2)
& sdtmndtasgtdt0(X0,xR,X1)
& aElement0(X2)
& aElement0(X1)
& aElement0(X0) )
=> ? [X3] :
( sdtmndtasgtdt0(X2,xR,X3)
& sdtmndtasgtdt0(X1,xR,X3)
& aElement0(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__715) ).
fof(f18,conjecture,
isConfluent0(xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f19,negated_conjecture,
~ isConfluent0(xR),
inference(negated_conjecture,[],[f18]) ).
fof(f24,plain,
~ isConfluent0(xR),
inference(flattening,[],[f19]) ).
fof(f35,plain,
! [X0] :
( ( isConfluent0(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) )
| ~ sdtmndtasgtdt0(X1,X0,X3)
| ~ sdtmndtasgtdt0(X1,X0,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ) )
| ~ aRewritingSystem0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f36,plain,
! [X0] :
( ( isConfluent0(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) )
| ~ sdtmndtasgtdt0(X1,X0,X3)
| ~ sdtmndtasgtdt0(X1,X0,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ) )
| ~ aRewritingSystem0(X0) ),
inference(flattening,[],[f35]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ? [X3] :
( sdtmndtasgtdt0(X2,xR,X3)
& sdtmndtasgtdt0(X1,xR,X3)
& aElement0(X3) )
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ? [X3] :
( sdtmndtasgtdt0(X2,xR,X3)
& sdtmndtasgtdt0(X1,xR,X3)
& aElement0(X3) )
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0] :
( sP0(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) )
| ~ sdtmndtasgtdt0(X1,X0,X3)
| ~ sdtmndtasgtdt0(X1,X0,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f48,plain,
! [X0] :
( ( isConfluent0(X0)
<=> sP0(X0) )
| ~ sP1(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f49,plain,
! [X0] :
( sP1(X0)
| ~ aRewritingSystem0(X0) ),
inference(definition_folding,[],[f36,f48,f47]) ).
fof(f60,plain,
! [X0] :
( ( ( isConfluent0(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ isConfluent0(X0) ) )
| ~ sP1(X0) ),
inference(nnf_transformation,[],[f48]) ).
fof(f61,plain,
! [X0] :
( ( sP0(X0)
| ? [X1,X2,X3] :
( ! [X4] :
( ~ sdtmndtasgtdt0(X3,X0,X4)
| ~ sdtmndtasgtdt0(X2,X0,X4)
| ~ aElement0(X4) )
& sdtmndtasgtdt0(X1,X0,X3)
& sdtmndtasgtdt0(X1,X0,X2)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) ) )
& ( ! [X1,X2,X3] :
( ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) )
| ~ sdtmndtasgtdt0(X1,X0,X3)
| ~ sdtmndtasgtdt0(X1,X0,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f62,plain,
! [X0] :
( ( sP0(X0)
| ? [X1,X2,X3] :
( ! [X4] :
( ~ sdtmndtasgtdt0(X3,X0,X4)
| ~ sdtmndtasgtdt0(X2,X0,X4)
| ~ aElement0(X4) )
& sdtmndtasgtdt0(X1,X0,X3)
& sdtmndtasgtdt0(X1,X0,X2)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) ) )
& ( ! [X5,X6,X7] :
( ? [X8] :
( sdtmndtasgtdt0(X7,X0,X8)
& sdtmndtasgtdt0(X6,X0,X8)
& aElement0(X8) )
| ~ sdtmndtasgtdt0(X5,X0,X7)
| ~ sdtmndtasgtdt0(X5,X0,X6)
| ~ aElement0(X7)
| ~ aElement0(X6)
| ~ aElement0(X5) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
! [X0] :
( ? [X1,X2,X3] :
( ! [X4] :
( ~ sdtmndtasgtdt0(X3,X0,X4)
| ~ sdtmndtasgtdt0(X2,X0,X4)
| ~ aElement0(X4) )
& sdtmndtasgtdt0(X1,X0,X3)
& sdtmndtasgtdt0(X1,X0,X2)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ( ! [X4] :
( ~ sdtmndtasgtdt0(sK7(X0),X0,X4)
| ~ sdtmndtasgtdt0(sK6(X0),X0,X4)
| ~ aElement0(X4) )
& sdtmndtasgtdt0(sK5(X0),X0,sK7(X0))
& sdtmndtasgtdt0(sK5(X0),X0,sK6(X0))
& aElement0(sK7(X0))
& aElement0(sK6(X0))
& aElement0(sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f64,plain,
! [X0,X6,X7] :
( ? [X8] :
( sdtmndtasgtdt0(X7,X0,X8)
& sdtmndtasgtdt0(X6,X0,X8)
& aElement0(X8) )
=> ( sdtmndtasgtdt0(X7,X0,sK8(X0,X6,X7))
& sdtmndtasgtdt0(X6,X0,sK8(X0,X6,X7))
& aElement0(sK8(X0,X6,X7)) ) ),
introduced(choice_axiom,[]) ).
fof(f65,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X4] :
( ~ sdtmndtasgtdt0(sK7(X0),X0,X4)
| ~ sdtmndtasgtdt0(sK6(X0),X0,X4)
| ~ aElement0(X4) )
& sdtmndtasgtdt0(sK5(X0),X0,sK7(X0))
& sdtmndtasgtdt0(sK5(X0),X0,sK6(X0))
& aElement0(sK7(X0))
& aElement0(sK6(X0))
& aElement0(sK5(X0)) ) )
& ( ! [X5,X6,X7] :
( ( sdtmndtasgtdt0(X7,X0,sK8(X0,X6,X7))
& sdtmndtasgtdt0(X6,X0,sK8(X0,X6,X7))
& aElement0(sK8(X0,X6,X7)) )
| ~ sdtmndtasgtdt0(X5,X0,X7)
| ~ sdtmndtasgtdt0(X5,X0,X6)
| ~ aElement0(X7)
| ~ aElement0(X6)
| ~ aElement0(X5) )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8])],[f62,f64,f63]) ).
fof(f83,plain,
! [X1,X2] :
( ? [X3] :
( sdtmndtasgtdt0(X2,xR,X3)
& sdtmndtasgtdt0(X1,xR,X3)
& aElement0(X3) )
=> ( sdtmndtasgtdt0(X2,xR,sK17(X1,X2))
& sdtmndtasgtdt0(X1,xR,sK17(X1,X2))
& aElement0(sK17(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ( sdtmndtasgtdt0(X2,xR,sK17(X1,X2))
& sdtmndtasgtdt0(X1,xR,sK17(X1,X2))
& aElement0(sK17(X1,X2)) )
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17])],[f46,f83]) ).
fof(f97,plain,
! [X0] :
( isConfluent0(X0)
| ~ sP0(X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f101,plain,
! [X0] :
( sP0(X0)
| aElement0(sK5(X0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f102,plain,
! [X0] :
( sP0(X0)
| aElement0(sK6(X0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f103,plain,
! [X0] :
( sP0(X0)
| aElement0(sK7(X0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f104,plain,
! [X0] :
( sP0(X0)
| sdtmndtasgtdt0(sK5(X0),X0,sK6(X0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f105,plain,
! [X0] :
( sP0(X0)
| sdtmndtasgtdt0(sK5(X0),X0,sK7(X0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f106,plain,
! [X0,X4] :
( sP0(X0)
| ~ sdtmndtasgtdt0(sK7(X0),X0,X4)
| ~ sdtmndtasgtdt0(sK6(X0),X0,X4)
| ~ aElement0(X4) ),
inference(cnf_transformation,[],[f65]) ).
fof(f107,plain,
! [X0] :
( sP1(X0)
| ~ aRewritingSystem0(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f130,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f133,plain,
! [X2,X0,X1] :
( aElement0(sK17(X1,X2))
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f134,plain,
! [X2,X0,X1] :
( sdtmndtasgtdt0(X1,xR,sK17(X1,X2))
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f135,plain,
! [X2,X0,X1] :
( sdtmndtasgtdt0(X2,xR,sK17(X1,X2))
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f136,plain,
~ isConfluent0(xR),
inference(cnf_transformation,[],[f24]) ).
cnf(c_60,plain,
( ~ sP0(X0)
| ~ sP1(X0)
| isConfluent0(X0) ),
inference(cnf_transformation,[],[f97]) ).
cnf(c_62,plain,
( ~ sdtmndtasgtdt0(sK7(X0),X0,X1)
| ~ sdtmndtasgtdt0(sK6(X0),X0,X1)
| ~ aElement0(X1)
| sP0(X0) ),
inference(cnf_transformation,[],[f106]) ).
cnf(c_63,plain,
( sdtmndtasgtdt0(sK5(X0),X0,sK7(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f105]) ).
cnf(c_64,plain,
( sdtmndtasgtdt0(sK5(X0),X0,sK6(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f104]) ).
cnf(c_65,plain,
( aElement0(sK7(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f103]) ).
cnf(c_66,plain,
( aElement0(sK6(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f102]) ).
cnf(c_67,plain,
( aElement0(sK5(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f101]) ).
cnf(c_71,plain,
( ~ aRewritingSystem0(X0)
| sP1(X0) ),
inference(cnf_transformation,[],[f107]) ).
cnf(c_94,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f130]) ).
cnf(c_97,plain,
( ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| sdtmndtasgtdt0(X1,xR,sK17(X2,X1)) ),
inference(cnf_transformation,[],[f135]) ).
cnf(c_98,plain,
( ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| sdtmndtasgtdt0(X2,xR,sK17(X2,X1)) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_99,plain,
( ~ sdtmndtasgtdt0(X0,xR,X1)
| ~ sdtmndtasgtdt0(X0,xR,X2)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| aElement0(sK17(X2,X1)) ),
inference(cnf_transformation,[],[f133]) ).
cnf(c_100,negated_conjecture,
~ isConfluent0(xR),
inference(cnf_transformation,[],[f136]) ).
cnf(c_105,plain,
( ~ aRewritingSystem0(xR)
| sP1(xR) ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_106,plain,
( aElement0(sK5(xR))
| sP0(xR) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_107,plain,
( aElement0(sK6(xR))
| sP0(xR) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_108,plain,
( aElement0(sK7(xR))
| sP0(xR) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_112,plain,
( sdtmndtasgtdt0(sK5(xR),xR,sK6(xR))
| sP0(xR) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_114,plain,
( ~ sP0(xR)
| ~ sP1(xR)
| isConfluent0(xR) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_974,plain,
( X0 != xR
| ~ sP0(X0)
| ~ sP1(X0) ),
inference(resolution_lifted,[status(thm)],[c_60,c_100]) ).
cnf(c_975,plain,
( ~ sP0(xR)
| ~ sP1(xR) ),
inference(unflattening,[status(thm)],[c_974]) ).
cnf(c_976,plain,
~ sP0(xR),
inference(global_subsumption_just,[status(thm)],[c_975,c_94,c_100,c_105,c_114]) ).
cnf(c_5285,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(sK7(xR))
| ~ aElement0(sK5(xR))
| ~ aElement0(X0)
| sdtmndtasgtdt0(sK7(xR),xR,sK17(X0,sK7(xR)))
| sP0(xR) ),
inference(superposition,[status(thm)],[c_63,c_97]) ).
cnf(c_5286,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(sK7(xR))
| ~ aElement0(sK5(xR))
| ~ aElement0(X0)
| sdtmndtasgtdt0(sK7(xR),xR,sK17(X0,sK7(xR))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5285,c_976]) ).
cnf(c_5325,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(X0)
| sdtmndtasgtdt0(sK7(xR),xR,sK17(X0,sK7(xR))) ),
inference(global_subsumption_just,[status(thm)],[c_5286,c_94,c_100,c_105,c_106,c_108,c_114,c_5286]) ).
cnf(c_5571,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(sK7(xR))
| ~ aElement0(sK5(xR))
| ~ aElement0(X0)
| sdtmndtasgtdt0(X0,xR,sK17(X0,sK7(xR)))
| sP0(xR) ),
inference(superposition,[status(thm)],[c_63,c_98]) ).
cnf(c_5587,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(sK7(xR))
| ~ aElement0(sK5(xR))
| ~ aElement0(X0)
| sdtmndtasgtdt0(X0,xR,sK17(X0,sK7(xR))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5571,c_976]) ).
cnf(c_5814,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(X0)
| sdtmndtasgtdt0(X0,xR,sK17(X0,sK7(xR))) ),
inference(global_subsumption_just,[status(thm)],[c_5587,c_94,c_100,c_105,c_106,c_108,c_114,c_5587]) ).
cnf(c_6068,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(sK7(xR))
| ~ aElement0(sK5(xR))
| ~ aElement0(X0)
| aElement0(sK17(X0,sK7(xR)))
| sP0(xR) ),
inference(superposition,[status(thm)],[c_63,c_99]) ).
cnf(c_6098,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(sK7(xR))
| ~ aElement0(sK5(xR))
| ~ aElement0(X0)
| aElement0(sK17(X0,sK7(xR))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6068,c_976]) ).
cnf(c_6321,plain,
( ~ sdtmndtasgtdt0(sK6(xR),xR,sK17(X0,sK7(xR)))
| ~ aElement0(sK17(X0,sK7(xR)))
| ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(X0)
| sP0(xR) ),
inference(superposition,[status(thm)],[c_5325,c_62]) ).
cnf(c_6332,plain,
( ~ sdtmndtasgtdt0(sK6(xR),xR,sK17(X0,sK7(xR)))
| ~ aElement0(sK17(X0,sK7(xR)))
| ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6321,c_976]) ).
cnf(c_7239,plain,
( ~ sdtmndtasgtdt0(sK6(xR),xR,sK17(X0,sK7(xR)))
| ~ sdtmndtasgtdt0(sK5(xR),xR,X0)
| ~ aElement0(X0) ),
inference(global_subsumption_just,[status(thm)],[c_6332,c_94,c_100,c_105,c_106,c_108,c_114,c_6098,c_6332]) ).
cnf(c_7248,plain,
( ~ sdtmndtasgtdt0(sK5(xR),xR,sK6(xR))
| ~ aElement0(sK6(xR)) ),
inference(superposition,[status(thm)],[c_5814,c_7239]) ).
cnf(c_7251,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7248,c_114,c_112,c_107,c_105,c_100,c_94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM023+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 13:30:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.45/1.17 % SZS status Started for theBenchmark.p
% 0.45/1.17 % SZS status Theorem for theBenchmark.p
% 0.45/1.17
% 0.45/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.17
% 0.45/1.17 ------ iProver source info
% 0.45/1.17
% 0.45/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.17 git: non_committed_changes: false
% 0.45/1.17 git: last_make_outside_of_git: false
% 0.45/1.17
% 0.45/1.17 ------ Parsing...
% 0.45/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.17
% 0.45/1.17 ------ 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
% 0.45/1.17
% 0.45/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.17
% 0.45/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.17 ------ Proving...
% 0.45/1.17 ------ Problem Properties
% 0.45/1.17
% 0.45/1.17
% 0.45/1.17 clauses 44
% 0.45/1.17 conjectures 0
% 0.45/1.17 EPR 12
% 0.45/1.17 Horn 27
% 0.45/1.17 unary 4
% 0.45/1.17 binary 10
% 0.45/1.17 lits 184
% 0.45/1.17 lits eq 1
% 0.45/1.17 fd_pure 0
% 0.45/1.17 fd_pseudo 0
% 0.45/1.17 fd_cond 0
% 0.45/1.17 fd_pseudo_cond 1
% 0.45/1.17 AC symbols 0
% 0.45/1.17
% 0.45/1.17 ------ Schedule dynamic 5 is on
% 0.45/1.17
% 0.45/1.17 ------ no conjectures: strip conj schedule
% 0.45/1.17
% 0.45/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.45/1.17
% 0.45/1.17
% 0.45/1.17 ------
% 0.45/1.17 Current options:
% 0.45/1.17 ------
% 0.45/1.17
% 0.45/1.17
% 0.45/1.17
% 0.45/1.17
% 0.45/1.17 ------ Proving...
% 0.45/1.17
% 0.45/1.17
% 0.45/1.17 % SZS status Theorem for theBenchmark.p
% 0.45/1.17
% 0.45/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.17
% 0.45/1.17
%------------------------------------------------------------------------------