TSTP Solution File: COM017+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : COM017+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:05 EDT 2023
% Result : Theorem 3.45s 1.17s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 73 ( 18 unt; 0 def)
% Number of atoms : 301 ( 2 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 393 ( 165 ~; 154 |; 63 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 119 ( 0 sgn; 68 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( ( aRewritingSystem0(X1)
& aElement0(X0) )
=> ! [X2] :
( aReductOfIn0(X2,X0,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mReduct) ).
fof(f11,axiom,
! [X0] :
( aRewritingSystem0(X0)
=> ( isLocallyConfluent0(X0)
<=> ! [X1,X2,X3] :
( ( aReductOfIn0(X3,X1,X0)
& aReductOfIn0(X2,X1,X0)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mWCRDef) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(f16,axiom,
( isTerminating0(xR)
& isLocallyConfluent0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).
fof(f17,axiom,
( aElement0(xc)
& aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731) ).
fof(f20,axiom,
( sdtmndtasgtdt0(xu,xR,xb)
& aReductOfIn0(xu,xa,xR)
& aElement0(xu) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__755) ).
fof(f21,axiom,
( sdtmndtasgtdt0(xv,xR,xc)
& aReductOfIn0(xv,xa,xR)
& aElement0(xv) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__779) ).
fof(f22,conjecture,
? [X0] :
( sdtmndtasgtdt0(xv,xR,X0)
& sdtmndtasgtdt0(xu,xR,X0)
& aElement0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f23,negated_conjecture,
~ ? [X0] :
( sdtmndtasgtdt0(xv,xR,X0)
& sdtmndtasgtdt0(xu,xR,X0)
& aElement0(X0) ),
inference(negated_conjecture,[],[f22]) ).
fof(f28,plain,
! [X0,X1] :
( ! [X2] :
( aElement0(X2)
| ~ aReductOfIn0(X2,X0,X1) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f29,plain,
! [X0,X1] :
( ! [X2] :
( aElement0(X2)
| ~ aReductOfIn0(X2,X0,X1) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f28]) ).
fof(f40,plain,
! [X0] :
( ( isLocallyConfluent0(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) )
| ~ aReductOfIn0(X3,X1,X0)
| ~ aReductOfIn0(X2,X1,X0)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ) )
| ~ aRewritingSystem0(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f41,plain,
! [X0] :
( ( isLocallyConfluent0(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) )
| ~ aReductOfIn0(X3,X1,X0)
| ~ aReductOfIn0(X2,X1,X0)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ) )
| ~ aRewritingSystem0(X0) ),
inference(flattening,[],[f40]) ).
fof(f50,plain,
! [X0] :
( ~ sdtmndtasgtdt0(xv,xR,X0)
| ~ sdtmndtasgtdt0(xu,xR,X0)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f54,plain,
! [X0] :
( sP2(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) )
| ~ aReductOfIn0(X3,X1,X0)
| ~ aReductOfIn0(X2,X1,X0)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f55,plain,
! [X0] :
( ( isLocallyConfluent0(X0)
<=> sP2(X0) )
| ~ sP3(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f56,plain,
! [X0] :
( sP3(X0)
| ~ aRewritingSystem0(X0) ),
inference(definition_folding,[],[f41,f55,f54]) ).
fof(f70,plain,
! [X0] :
( ( ( isLocallyConfluent0(X0)
| ~ sP2(X0) )
& ( sP2(X0)
| ~ isLocallyConfluent0(X0) ) )
| ~ sP3(X0) ),
inference(nnf_transformation,[],[f55]) ).
fof(f71,plain,
! [X0] :
( ( sP2(X0)
| ? [X1,X2,X3] :
( ! [X4] :
( ~ sdtmndtasgtdt0(X3,X0,X4)
| ~ sdtmndtasgtdt0(X2,X0,X4)
| ~ aElement0(X4) )
& aReductOfIn0(X3,X1,X0)
& aReductOfIn0(X2,X1,X0)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) ) )
& ( ! [X1,X2,X3] :
( ? [X4] :
( sdtmndtasgtdt0(X3,X0,X4)
& sdtmndtasgtdt0(X2,X0,X4)
& aElement0(X4) )
| ~ aReductOfIn0(X3,X1,X0)
| ~ aReductOfIn0(X2,X1,X0)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) )
| ~ sP2(X0) ) ),
inference(nnf_transformation,[],[f54]) ).
fof(f72,plain,
! [X0] :
( ( sP2(X0)
| ? [X1,X2,X3] :
( ! [X4] :
( ~ sdtmndtasgtdt0(X3,X0,X4)
| ~ sdtmndtasgtdt0(X2,X0,X4)
| ~ aElement0(X4) )
& aReductOfIn0(X3,X1,X0)
& aReductOfIn0(X2,X1,X0)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) ) )
& ( ! [X5,X6,X7] :
( ? [X8] :
( sdtmndtasgtdt0(X7,X0,X8)
& sdtmndtasgtdt0(X6,X0,X8)
& aElement0(X8) )
| ~ aReductOfIn0(X7,X5,X0)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aElement0(X7)
| ~ aElement0(X6)
| ~ aElement0(X5) )
| ~ sP2(X0) ) ),
inference(rectify,[],[f71]) ).
fof(f73,plain,
! [X0] :
( ? [X1,X2,X3] :
( ! [X4] :
( ~ sdtmndtasgtdt0(X3,X0,X4)
| ~ sdtmndtasgtdt0(X2,X0,X4)
| ~ aElement0(X4) )
& aReductOfIn0(X3,X1,X0)
& aReductOfIn0(X2,X1,X0)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ( ! [X4] :
( ~ sdtmndtasgtdt0(sK11(X0),X0,X4)
| ~ sdtmndtasgtdt0(sK10(X0),X0,X4)
| ~ aElement0(X4) )
& aReductOfIn0(sK11(X0),sK9(X0),X0)
& aReductOfIn0(sK10(X0),sK9(X0),X0)
& aElement0(sK11(X0))
& aElement0(sK10(X0))
& aElement0(sK9(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f74,plain,
! [X0,X6,X7] :
( ? [X8] :
( sdtmndtasgtdt0(X7,X0,X8)
& sdtmndtasgtdt0(X6,X0,X8)
& aElement0(X8) )
=> ( sdtmndtasgtdt0(X7,X0,sK12(X0,X6,X7))
& sdtmndtasgtdt0(X6,X0,sK12(X0,X6,X7))
& aElement0(sK12(X0,X6,X7)) ) ),
introduced(choice_axiom,[]) ).
fof(f75,plain,
! [X0] :
( ( sP2(X0)
| ( ! [X4] :
( ~ sdtmndtasgtdt0(sK11(X0),X0,X4)
| ~ sdtmndtasgtdt0(sK10(X0),X0,X4)
| ~ aElement0(X4) )
& aReductOfIn0(sK11(X0),sK9(X0),X0)
& aReductOfIn0(sK10(X0),sK9(X0),X0)
& aElement0(sK11(X0))
& aElement0(sK10(X0))
& aElement0(sK9(X0)) ) )
& ( ! [X5,X6,X7] :
( ( sdtmndtasgtdt0(X7,X0,sK12(X0,X6,X7))
& sdtmndtasgtdt0(X6,X0,sK12(X0,X6,X7))
& aElement0(sK12(X0,X6,X7)) )
| ~ aReductOfIn0(X7,X5,X0)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aElement0(X7)
| ~ aElement0(X6)
| ~ aElement0(X5) )
| ~ sP2(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12])],[f72,f74,f73]) ).
fof(f89,plain,
! [X2,X0,X1] :
( aElement0(X2)
| ~ aReductOfIn0(X2,X0,X1)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f112,plain,
! [X0] :
( sP2(X0)
| ~ isLocallyConfluent0(X0)
| ~ sP3(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f114,plain,
! [X0,X6,X7,X5] :
( aElement0(sK12(X0,X6,X7))
| ~ aReductOfIn0(X7,X5,X0)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aElement0(X7)
| ~ aElement0(X6)
| ~ aElement0(X5)
| ~ sP2(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f115,plain,
! [X0,X6,X7,X5] :
( sdtmndtasgtdt0(X6,X0,sK12(X0,X6,X7))
| ~ aReductOfIn0(X7,X5,X0)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aElement0(X7)
| ~ aElement0(X6)
| ~ aElement0(X5)
| ~ sP2(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f116,plain,
! [X0,X6,X7,X5] :
( sdtmndtasgtdt0(X7,X0,sK12(X0,X6,X7))
| ~ aReductOfIn0(X7,X5,X0)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aElement0(X7)
| ~ aElement0(X6)
| ~ aElement0(X5)
| ~ sP2(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f123,plain,
! [X0] :
( sP3(X0)
| ~ aRewritingSystem0(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f134,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f135,plain,
isLocallyConfluent0(xR),
inference(cnf_transformation,[],[f16]) ).
fof(f137,plain,
aElement0(xa),
inference(cnf_transformation,[],[f17]) ).
fof(f145,plain,
aElement0(xu),
inference(cnf_transformation,[],[f20]) ).
fof(f146,plain,
aReductOfIn0(xu,xa,xR),
inference(cnf_transformation,[],[f20]) ).
fof(f148,plain,
aElement0(xv),
inference(cnf_transformation,[],[f21]) ).
fof(f149,plain,
aReductOfIn0(xv,xa,xR),
inference(cnf_transformation,[],[f21]) ).
fof(f151,plain,
! [X0] :
( ~ sdtmndtasgtdt0(xv,xR,X0)
| ~ sdtmndtasgtdt0(xu,xR,X0)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_49,plain,
( ~ aReductOfIn0(X0,X1,X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| aElement0(X0) ),
inference(cnf_transformation,[],[f89]) ).
cnf(c_73,plain,
( ~ isLocallyConfluent0(X0)
| ~ sP3(X0)
| sP2(X0) ),
inference(cnf_transformation,[],[f112]) ).
cnf(c_80,plain,
( ~ aReductOfIn0(X0,X1,X2)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ sP2(X2)
| sdtmndtasgtdt0(X0,X2,sK12(X2,X3,X0)) ),
inference(cnf_transformation,[],[f116]) ).
cnf(c_81,plain,
( ~ aReductOfIn0(X0,X1,X2)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ sP2(X2)
| sdtmndtasgtdt0(X3,X2,sK12(X2,X3,X0)) ),
inference(cnf_transformation,[],[f115]) ).
cnf(c_82,plain,
( ~ aReductOfIn0(X0,X1,X2)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ sP2(X2)
| aElement0(sK12(X2,X3,X0)) ),
inference(cnf_transformation,[],[f114]) ).
cnf(c_83,plain,
( ~ aRewritingSystem0(X0)
| sP3(X0) ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_94,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f134]) ).
cnf(c_96,plain,
isLocallyConfluent0(xR),
inference(cnf_transformation,[],[f135]) ).
cnf(c_99,plain,
aElement0(xa),
inference(cnf_transformation,[],[f137]) ).
cnf(c_106,plain,
aReductOfIn0(xu,xa,xR),
inference(cnf_transformation,[],[f146]) ).
cnf(c_107,plain,
aElement0(xu),
inference(cnf_transformation,[],[f145]) ).
cnf(c_109,plain,
aReductOfIn0(xv,xa,xR),
inference(cnf_transformation,[],[f149]) ).
cnf(c_110,plain,
aElement0(xv),
inference(cnf_transformation,[],[f148]) ).
cnf(c_111,negated_conjecture,
( ~ sdtmndtasgtdt0(xu,xR,X0)
| ~ sdtmndtasgtdt0(xv,xR,X0)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_112,plain,
( ~ aRewritingSystem0(xR)
| sP3(xR) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_122,plain,
( ~ isLocallyConfluent0(xR)
| ~ sP3(xR)
| sP2(xR) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_1032,plain,
( X0 != xR
| ~ sP3(X0)
| sP2(X0) ),
inference(resolution_lifted,[status(thm)],[c_73,c_96]) ).
cnf(c_1033,plain,
( ~ sP3(xR)
| sP2(xR) ),
inference(unflattening,[status(thm)],[c_1032]) ).
cnf(c_1034,plain,
sP2(xR),
inference(global_subsumption_just,[status(thm)],[c_1033,c_96,c_94,c_112,c_122]) ).
cnf(c_1323,plain,
( X0 != xR
| ~ aReductOfIn0(X1,X2,X0)
| ~ aElement0(X2)
| aElement0(X1) ),
inference(resolution_lifted,[status(thm)],[c_49,c_94]) ).
cnf(c_1324,plain,
( ~ aReductOfIn0(X0,X1,xR)
| ~ aElement0(X1)
| aElement0(X0) ),
inference(unflattening,[status(thm)],[c_1323]) ).
cnf(c_5918,plain,
( ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ aElement0(xa)
| ~ aElement0(xv)
| ~ sP2(xR)
| aElement0(sK12(xR,X0,xv)) ),
inference(superposition,[status(thm)],[c_109,c_82]) ).
cnf(c_5919,plain,
( ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| aElement0(sK12(xR,X0,xv)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5918,c_1034,c_110,c_99]) ).
cnf(c_6294,plain,
( ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ aElement0(xa)
| ~ aElement0(xv)
| ~ sP2(xR)
| sdtmndtasgtdt0(xv,xR,sK12(xR,X0,xv)) ),
inference(superposition,[status(thm)],[c_109,c_80]) ).
cnf(c_6295,plain,
( ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| sdtmndtasgtdt0(xv,xR,sK12(xR,X0,xv)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6294,c_1034,c_110,c_99]) ).
cnf(c_6322,plain,
( ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ aElement0(xa)
| ~ aElement0(xv)
| ~ sP2(xR)
| sdtmndtasgtdt0(X0,xR,sK12(xR,X0,xv)) ),
inference(superposition,[status(thm)],[c_109,c_81]) ).
cnf(c_6323,plain,
( ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| sdtmndtasgtdt0(X0,xR,sK12(xR,X0,xv)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6322,c_1034,c_110,c_99]) ).
cnf(c_6763,plain,
( ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(xa)
| aElement0(X0) ),
inference(instantiation,[status(thm)],[c_1324]) ).
cnf(c_6855,plain,
( ~ aReductOfIn0(X0,xa,xR)
| sdtmndtasgtdt0(xv,xR,sK12(xR,X0,xv)) ),
inference(global_subsumption_just,[status(thm)],[c_6295,c_99,c_6295,c_6763]) ).
cnf(c_6976,plain,
( ~ aReductOfIn0(X0,xa,xR)
| sdtmndtasgtdt0(X0,xR,sK12(xR,X0,xv)) ),
inference(global_subsumption_just,[status(thm)],[c_6323,c_99,c_6323,c_6763]) ).
cnf(c_6990,plain,
( ~ sdtmndtasgtdt0(xv,xR,sK12(xR,xu,xv))
| ~ aElement0(sK12(xR,xu,xv))
| ~ aReductOfIn0(xu,xa,xR) ),
inference(superposition,[status(thm)],[c_6976,c_111]) ).
cnf(c_6991,plain,
( ~ sdtmndtasgtdt0(xv,xR,sK12(xR,xu,xv))
| ~ aElement0(sK12(xR,xu,xv)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6990,c_106]) ).
cnf(c_7056,plain,
( ~ aElement0(sK12(xR,xu,xv))
| ~ aReductOfIn0(xu,xa,xR) ),
inference(superposition,[status(thm)],[c_6855,c_6991]) ).
cnf(c_7057,plain,
~ aElement0(sK12(xR,xu,xv)),
inference(forward_subsumption_resolution,[status(thm)],[c_7056,c_106]) ).
cnf(c_7058,plain,
( ~ aReductOfIn0(xu,xa,xR)
| ~ aElement0(xu) ),
inference(superposition,[status(thm)],[c_5919,c_7057]) ).
cnf(c_7059,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7058,c_107,c_106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM017+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 29 13:21:35 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.45/1.17 % SZS status Started for theBenchmark.p
% 3.45/1.17 % SZS status Theorem for theBenchmark.p
% 3.45/1.17
% 3.45/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.45/1.17
% 3.45/1.17 ------ iProver source info
% 3.45/1.17
% 3.45/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.45/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.45/1.17 git: non_committed_changes: false
% 3.45/1.17 git: last_make_outside_of_git: false
% 3.45/1.17
% 3.45/1.17 ------ Parsing...
% 3.45/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.45/1.17
% 3.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:8:0s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e
% 3.45/1.17
% 3.45/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.45/1.17
% 3.45/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.45/1.17 ------ Proving...
% 3.45/1.17 ------ Problem Properties
% 3.45/1.17
% 3.45/1.17
% 3.45/1.17 clauses 49
% 3.45/1.17 conjectures 1
% 3.45/1.17 EPR 21
% 3.45/1.17 Horn 35
% 3.45/1.17 unary 12
% 3.45/1.17 binary 14
% 3.45/1.17 lits 166
% 3.45/1.17 lits eq 1
% 3.45/1.17 fd_pure 0
% 3.45/1.17 fd_pseudo 0
% 3.45/1.17 fd_cond 0
% 3.45/1.17 fd_pseudo_cond 1
% 3.45/1.17 AC symbols 0
% 3.45/1.17
% 3.45/1.17 ------ Schedule dynamic 5 is on
% 3.45/1.17
% 3.45/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.45/1.17
% 3.45/1.17
% 3.45/1.17 ------
% 3.45/1.17 Current options:
% 3.45/1.17 ------
% 3.45/1.17
% 3.45/1.17
% 3.45/1.17
% 3.45/1.17
% 3.45/1.17 ------ Proving...
% 3.45/1.17
% 3.45/1.17
% 3.45/1.17 % SZS status Theorem for theBenchmark.p
% 3.45/1.17
% 3.45/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.45/1.18
% 3.45/1.18
%------------------------------------------------------------------------------