TSTP Solution File: SWV055+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV055+1 : TPTP v8.1.2. Bugfixed v3.3.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 : Thu Aug 31 22:30:56 EDT 2023
% Result : Theorem 4.16s 1.12s
% Output : CNFRefutation 4.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 30 unt; 0 def)
% Number of atoms : 241 ( 55 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 259 ( 92 ~; 80 |; 71 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 13 con; 0-3 aty)
% Number of variables : 99 ( 2 sgn; 62 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : succ(X0) = plus(X0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_r) ).
fof(f30,axiom,
! [X0] : succ(X0) = plus(n1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_succ) ).
fof(f53,conjecture,
( ( ! [X13,X17] :
( ( leq(X13,minus(pv10,n1))
& leq(n0,X13) )
=> n1 = sum(n0,minus(n5,n1),a_select3(q,X13,X17)) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( ! [X20,X21] :
( ( leq(X20,minus(pv10,n1))
& leq(n0,X20) )
=> n1 = sum(n0,minus(n5,n1),a_select3(q,X20,X21)) )
& ! [X3,X19] :
( ( leq(X3,minus(n0,n1))
& leq(n0,X3) )
=> a_select3(q,pv10,X3) = divide(sqrt(times(minus(a_select3(center,X3,n0),a_select2(x,pv10)),minus(a_select3(center,X3,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X19,n0),a_select2(x,pv10)),minus(a_select3(center,X19,n0),a_select2(x,pv10)))))) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0037) ).
fof(f54,negated_conjecture,
~ ( ( ! [X13,X17] :
( ( leq(X13,minus(pv10,n1))
& leq(n0,X13) )
=> n1 = sum(n0,minus(n5,n1),a_select3(q,X13,X17)) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( ! [X20,X21] :
( ( leq(X20,minus(pv10,n1))
& leq(n0,X20) )
=> n1 = sum(n0,minus(n5,n1),a_select3(q,X20,X21)) )
& ! [X3,X19] :
( ( leq(X3,minus(n0,n1))
& leq(n0,X3) )
=> a_select3(q,pv10,X3) = divide(sqrt(times(minus(a_select3(center,X3,n0),a_select2(x,pv10)),minus(a_select3(center,X3,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X19,n0),a_select2(x,pv10)),minus(a_select3(center,X19,n0),a_select2(x,pv10)))))) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f114,plain,
~ ( ( ! [X0,X1] :
( ( leq(X0,minus(pv10,n1))
& leq(n0,X0) )
=> n1 = sum(n0,minus(n5,n1),a_select3(q,X0,X1)) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( ! [X2,X3] :
( ( leq(X2,minus(pv10,n1))
& leq(n0,X2) )
=> n1 = sum(n0,minus(n5,n1),a_select3(q,X2,X3)) )
& ! [X4,X5] :
( ( leq(X4,minus(n0,n1))
& leq(n0,X4) )
=> a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X5,n0),a_select2(x,pv10)),minus(a_select3(center,X5,n0),a_select2(x,pv10)))))) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) ),
inference(rectify,[],[f54]) ).
fof(f118,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f119,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(flattening,[],[f118]) ).
fof(f156,plain,
( ( ? [X2,X3] :
( n1 != sum(n0,minus(n5,n1),a_select3(q,X2,X3))
& leq(X2,minus(pv10,n1))
& leq(n0,X2) )
| ? [X4,X5] :
( a_select3(q,pv10,X4) != divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X5,n0),a_select2(x,pv10)),minus(a_select3(center,X5,n0),a_select2(x,pv10))))))
& leq(X4,minus(n0,n1))
& leq(n0,X4) )
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ! [X0,X1] :
( n1 = sum(n0,minus(n5,n1),a_select3(q,X0,X1))
| ~ leq(X0,minus(pv10,n1))
| ~ leq(n0,X0) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
inference(ennf_transformation,[],[f114]) ).
fof(f157,plain,
( ( ? [X2,X3] :
( n1 != sum(n0,minus(n5,n1),a_select3(q,X2,X3))
& leq(X2,minus(pv10,n1))
& leq(n0,X2) )
| ? [X4,X5] :
( a_select3(q,pv10,X4) != divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X5,n0),a_select2(x,pv10)),minus(a_select3(center,X5,n0),a_select2(x,pv10))))))
& leq(X4,minus(n0,n1))
& leq(n0,X4) )
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ! [X0,X1] :
( n1 = sum(n0,minus(n5,n1),a_select3(q,X0,X1))
| ~ leq(X0,minus(pv10,n1))
| ~ leq(n0,X0) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
inference(flattening,[],[f156]) ).
fof(f177,plain,
( ? [X4,X5] :
( a_select3(q,pv10,X4) != divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X5,n0),a_select2(x,pv10)),minus(a_select3(center,X5,n0),a_select2(x,pv10))))))
& leq(X4,minus(n0,n1))
& leq(n0,X4) )
| ~ sP4 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f178,plain,
( ( ? [X2,X3] :
( n1 != sum(n0,minus(n5,n1),a_select3(q,X2,X3))
& leq(X2,minus(pv10,n1))
& leq(n0,X2) )
| sP4
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ! [X0,X1] :
( n1 = sum(n0,minus(n5,n1),a_select3(q,X0,X1))
| ~ leq(X0,minus(pv10,n1))
| ~ leq(n0,X0) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
inference(definition_folding,[],[f157,f177]) ).
fof(f180,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f226,plain,
( ? [X4,X5] :
( a_select3(q,pv10,X4) != divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X5,n0),a_select2(x,pv10)),minus(a_select3(center,X5,n0),a_select2(x,pv10))))))
& leq(X4,minus(n0,n1))
& leq(n0,X4) )
| ~ sP4 ),
inference(nnf_transformation,[],[f177]) ).
fof(f227,plain,
( ? [X0,X1] :
( a_select3(q,pv10,X0) != divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10))))))
& leq(X0,minus(n0,n1))
& leq(n0,X0) )
| ~ sP4 ),
inference(rectify,[],[f226]) ).
fof(f228,plain,
( ? [X0,X1] :
( a_select3(q,pv10,X0) != divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10))))))
& leq(X0,minus(n0,n1))
& leq(n0,X0) )
=> ( a_select3(q,pv10,sK32) != divide(sqrt(times(minus(a_select3(center,sK32,n0),a_select2(x,pv10)),minus(a_select3(center,sK32,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,sK33,n0),a_select2(x,pv10)),minus(a_select3(center,sK33,n0),a_select2(x,pv10))))))
& leq(sK32,minus(n0,n1))
& leq(n0,sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f229,plain,
( ( a_select3(q,pv10,sK32) != divide(sqrt(times(minus(a_select3(center,sK32,n0),a_select2(x,pv10)),minus(a_select3(center,sK32,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,sK33,n0),a_select2(x,pv10)),minus(a_select3(center,sK33,n0),a_select2(x,pv10))))))
& leq(sK32,minus(n0,n1))
& leq(n0,sK32) )
| ~ sP4 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK32,sK33])],[f227,f228]) ).
fof(f230,plain,
( ( ? [X0,X1] :
( n1 != sum(n0,minus(n5,n1),a_select3(q,X0,X1))
& leq(X0,minus(pv10,n1))
& leq(n0,X0) )
| sP4
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ! [X2,X3] :
( n1 = sum(n0,minus(n5,n1),a_select3(q,X2,X3))
| ~ leq(X2,minus(pv10,n1))
| ~ leq(n0,X2) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
inference(rectify,[],[f178]) ).
fof(f231,plain,
( ? [X0,X1] :
( n1 != sum(n0,minus(n5,n1),a_select3(q,X0,X1))
& leq(X0,minus(pv10,n1))
& leq(n0,X0) )
=> ( n1 != sum(n0,minus(n5,n1),a_select3(q,sK34,sK35))
& leq(sK34,minus(pv10,n1))
& leq(n0,sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f232,plain,
( ( ( n1 != sum(n0,minus(n5,n1),a_select3(q,sK34,sK35))
& leq(sK34,minus(pv10,n1))
& leq(n0,sK34) )
| sP4
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ! [X2,X3] :
( n1 = sum(n0,minus(n5,n1),a_select3(q,X2,X3))
| ~ leq(X2,minus(pv10,n1))
| ~ leq(n0,X2) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK34,sK35])],[f230,f231]) ).
fof(f235,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f237,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f244,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f180]) ).
fof(f312,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f313,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f314,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f323,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f324,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f343,plain,
( leq(n0,sK32)
| ~ sP4 ),
inference(cnf_transformation,[],[f229]) ).
fof(f344,plain,
( leq(sK32,minus(n0,n1))
| ~ sP4 ),
inference(cnf_transformation,[],[f229]) ).
fof(f346,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f232]) ).
fof(f347,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f232]) ).
fof(f348,plain,
! [X2,X3] :
( n1 = sum(n0,minus(n5,n1),a_select3(q,X2,X3))
| ~ leq(X2,minus(pv10,n1))
| ~ leq(n0,X2) ),
inference(cnf_transformation,[],[f232]) ).
fof(f349,plain,
( leq(n0,sK34)
| sP4
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f232]) ).
fof(f350,plain,
( leq(sK34,minus(pv10,n1))
| sP4
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f232]) ).
fof(f351,plain,
( n1 != sum(n0,minus(n5,n1),a_select3(q,sK34,sK35))
| sP4
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f232]) ).
fof(f396,plain,
! [X0,X1] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f244,f313]) ).
fof(f397,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f312,f313]) ).
fof(f398,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f314,f313]) ).
fof(f407,plain,
! [X0] : minus(plus(X0,n1),n1) = X0,
inference(definition_unfolding,[],[f324,f323,f313]) ).
cnf(c_51,plain,
~ gt(X0,X0),
inference(cnf_transformation,[],[f235]) ).
cnf(c_53,plain,
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f237]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| gt(plus(X1,n1),X0) ),
inference(cnf_transformation,[],[f396]) ).
cnf(c_128,plain,
plus(tptp_minus_1,n1) = n0,
inference(cnf_transformation,[],[f397]) ).
cnf(c_129,plain,
plus(X0,n1) = plus(n1,X0),
inference(cnf_transformation,[],[f398]) ).
cnf(c_138,plain,
minus(plus(X0,n1),n1) = X0,
inference(cnf_transformation,[],[f407]) ).
cnf(c_158,plain,
( ~ sP4
| leq(sK32,minus(n0,n1)) ),
inference(cnf_transformation,[],[f344]) ).
cnf(c_159,plain,
( ~ sP4
| leq(n0,sK32) ),
inference(cnf_transformation,[],[f343]) ).
cnf(c_160,negated_conjecture,
( sum(n0,minus(n5,n1),a_select3(q,sK34,sK35)) != n1
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| sP4 ),
inference(cnf_transformation,[],[f351]) ).
cnf(c_161,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(sK34,minus(pv10,n1))
| sP4 ),
inference(cnf_transformation,[],[f350]) ).
cnf(c_162,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(n0,sK34)
| sP4 ),
inference(cnf_transformation,[],[f349]) ).
cnf(c_163,negated_conjecture,
( ~ leq(X0,minus(pv10,n1))
| ~ leq(n0,X0)
| sum(n0,minus(n5,n1),a_select3(q,X0,X1)) = n1 ),
inference(cnf_transformation,[],[f348]) ).
cnf(c_164,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f347]) ).
cnf(c_165,negated_conjecture,
leq(n0,pv10),
inference(cnf_transformation,[],[f346]) ).
cnf(c_296,negated_conjecture,
( leq(n0,sK34)
| sP4 ),
inference(global_subsumption_just,[status(thm)],[c_162,c_165,c_164,c_162]) ).
cnf(c_298,negated_conjecture,
( leq(sK34,minus(pv10,n1))
| sP4 ),
inference(global_subsumption_just,[status(thm)],[c_161,c_165,c_164,c_161]) ).
cnf(c_300,negated_conjecture,
( sum(n0,minus(n5,n1),a_select3(q,sK34,sK35)) != n1
| sP4 ),
inference(global_subsumption_just,[status(thm)],[c_160,c_165,c_164,c_160]) ).
cnf(c_1707,plain,
plus(n1,tptp_minus_1) = n0,
inference(demodulation,[status(thm)],[c_128,c_129]) ).
cnf(c_9136,plain,
minus(plus(n1,X0),n1) = X0,
inference(superposition,[status(thm)],[c_129,c_138]) ).
cnf(c_9410,plain,
~ leq(plus(X0,n1),X0),
inference(superposition,[status(thm)],[c_61,c_51]) ).
cnf(c_9596,plain,
~ leq(plus(n1,X0),X0),
inference(superposition,[status(thm)],[c_129,c_9410]) ).
cnf(c_9611,plain,
minus(n0,n1) = tptp_minus_1,
inference(superposition,[status(thm)],[c_1707,c_9136]) ).
cnf(c_9621,plain,
( ~ sP4
| leq(sK32,tptp_minus_1) ),
inference(demodulation,[status(thm)],[c_158,c_9611]) ).
cnf(c_9689,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_1707,c_9596]) ).
cnf(c_9791,plain,
( ~ leq(sK34,minus(pv10,n1))
| ~ leq(n0,sK34)
| sum(n0,minus(n5,n1),a_select3(q,sK34,X0)) = n1 ),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_10519,plain,
( ~ leq(X0,sK32)
| ~ sP4
| leq(X0,tptp_minus_1) ),
inference(superposition,[status(thm)],[c_9621,c_53]) ).
cnf(c_10668,plain,
( ~ leq(n0,sK32)
| ~ sP4
| leq(n0,tptp_minus_1) ),
inference(instantiation,[status(thm)],[c_10519]) ).
cnf(c_11272,plain,
( ~ leq(sK34,minus(pv10,n1))
| ~ leq(n0,sK34)
| sum(n0,minus(n5,n1),a_select3(q,sK34,sK35)) = n1 ),
inference(instantiation,[status(thm)],[c_9791]) ).
cnf(c_11699,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11272,c_10668,c_9689,c_300,c_298,c_296,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWV055+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n028.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Aug 29 06:58:40 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.17/0.41 Running first-order theorem proving
% 0.17/0.41 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.16/1.12 % SZS status Started for theBenchmark.p
% 4.16/1.12 % SZS status Theorem for theBenchmark.p
% 4.16/1.12
% 4.16/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.16/1.12
% 4.16/1.12 ------ iProver source info
% 4.16/1.12
% 4.16/1.12 git: date: 2023-05-31 18:12:56 +0000
% 4.16/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.16/1.12 git: non_committed_changes: false
% 4.16/1.12 git: last_make_outside_of_git: false
% 4.16/1.12
% 4.16/1.12 ------ Parsing...
% 4.16/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.16/1.12
% 4.16/1.12 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 4.16/1.12
% 4.16/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.16/1.12
% 4.16/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.16/1.12 ------ Proving...
% 4.16/1.12 ------ Problem Properties
% 4.16/1.12
% 4.16/1.12
% 4.16/1.12 clauses 156
% 4.16/1.12 conjectures 3
% 4.16/1.12 EPR 46
% 4.16/1.12 Horn 104
% 4.16/1.12 unary 55
% 4.16/1.12 binary 40
% 4.16/1.12 lits 503
% 4.16/1.12 lits eq 116
% 4.16/1.12 fd_pure 0
% 4.16/1.12 fd_pseudo 0
% 4.16/1.12 fd_cond 6
% 4.16/1.12 fd_pseudo_cond 4
% 4.16/1.12 AC symbols 0
% 4.16/1.12
% 4.16/1.12 ------ Schedule dynamic 5 is on
% 4.16/1.12
% 4.16/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.16/1.12
% 4.16/1.12
% 4.16/1.12 ------
% 4.16/1.12 Current options:
% 4.16/1.12 ------
% 4.16/1.12
% 4.16/1.12
% 4.16/1.12
% 4.16/1.12
% 4.16/1.12 ------ Proving...
% 4.16/1.12
% 4.16/1.12
% 4.16/1.12 % SZS status Theorem for theBenchmark.p
% 4.16/1.12
% 4.16/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.16/1.12
% 4.16/1.13
%------------------------------------------------------------------------------