TSTP Solution File: ANA003-4 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : ANA003-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n009.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 : 600s
% DateTime : Thu Jul 14 19:03:32 EDT 2022
% Result : Unsatisfiable 1.81s 2.02s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 24
% Syntax : Number of formulae : 153 ( 20 unt; 0 def)
% Number of atoms : 348 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 350 ( 155 ~; 195 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 229 ( 16 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X3,X1] :
( ~ less_or_equal(X1,half(X2))
| ~ less_or_equal(X3,half(X2))
| less_or_equal(add(X1,X3),X2) ),
file('<stdin>',less_or_equal_sum_of_halves) ).
fof(c_0_1,axiom,
! [X3,X1] :
( less_or_equal(X1,n0)
| less_or_equal(X3,n0)
| ~ less_or_equal(minimum(X1,X3),n0) ),
file('<stdin>',minimum9) ).
fof(c_0_2,axiom,
! [X2,X3,X1] :
( ~ less_or_equal(X2,minimum(X1,X3))
| less_or_equal(X2,X1) ),
file('<stdin>',minimum3) ).
fof(c_0_3,axiom,
! [X2,X3,X1] :
( ~ less_or_equal(X2,minimum(X1,X3))
| less_or_equal(X2,X3) ),
file('<stdin>',minimum7) ).
fof(c_0_4,axiom,
! [X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(half(X1),n0) ),
file('<stdin>',zero_and_half) ).
fof(c_0_5,plain,
! [X2,X3,X1] :
( ~ less_or_equal(X1,half(X2))
| ~ less_or_equal(X3,half(X2))
| less_or_equal(add(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_6,plain,
! [X3,X1] :
( less_or_equal(X1,n0)
| less_or_equal(X3,n0)
| ~ less_or_equal(minimum(X1,X3),n0) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_7,plain,
! [X2,X3,X1] :
( ~ less_or_equal(X2,minimum(X1,X3))
| less_or_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_8,plain,
! [X2,X3,X1] :
( ~ less_or_equal(X2,minimum(X1,X3))
| less_or_equal(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_9,plain,
! [X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(half(X1),n0) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( ~ less_or_equal(X6,half(X4))
| ~ less_or_equal(X5,half(X4))
| less_or_equal(add(X6,X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X4,X5] :
( less_or_equal(X5,n0)
| less_or_equal(X4,n0)
| ~ less_or_equal(minimum(X5,X4),n0) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( ~ less_or_equal(X4,minimum(X6,X5))
| less_or_equal(X4,X6) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ~ less_or_equal(X4,minimum(X6,X5))
| less_or_equal(X4,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_8])])]) ).
fof(c_0_14,plain,
! [X2] :
( less_or_equal(X2,n0)
| ~ less_or_equal(half(X2),n0) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( less_or_equal(add(X1,X2),X3)
| ~ less_or_equal(X2,half(X3))
| ~ less_or_equal(X1,half(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( less_or_equal(X2,n0)
| less_or_equal(X1,n0)
| ~ less_or_equal(minimum(X1,X2),n0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,minimum(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,minimum(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( less_or_equal(X1,n0)
| ~ less_or_equal(half(X1),n0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( less_or_equal(add(X1,X2),X3)
| ~ less_or_equal(X2,half(X3))
| ~ less_or_equal(X1,half(X3)) ),
c_0_15,
[final] ).
cnf(c_0_21,plain,
( less_or_equal(X2,n0)
| less_or_equal(X1,n0)
| ~ less_or_equal(minimum(X1,X2),n0) ),
c_0_16,
[final] ).
cnf(c_0_22,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,minimum(X2,X3)) ),
c_0_17,
[final] ).
cnf(c_0_23,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,minimum(X3,X2)) ),
c_0_18,
[final] ).
cnf(c_0_24,plain,
( less_or_equal(X1,n0)
| ~ less_or_equal(half(X1),n0) ),
c_0_19,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_20_0,axiom,
( less_or_equal(add(X1,X2),X3)
| ~ less_or_equal(X2,half(X3))
| ~ less_or_equal(X1,half(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_1,axiom,
( ~ less_or_equal(X2,half(X3))
| less_or_equal(add(X1,X2),X3)
| ~ less_or_equal(X1,half(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_2,axiom,
( ~ less_or_equal(X1,half(X3))
| ~ less_or_equal(X2,half(X3))
| less_or_equal(add(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_21_0,axiom,
( less_or_equal(X2,n0)
| less_or_equal(X1,n0)
| ~ less_or_equal(minimum(X1,X2),n0) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_1,axiom,
( less_or_equal(X1,n0)
| less_or_equal(X2,n0)
| ~ less_or_equal(minimum(X1,X2),n0) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_2,axiom,
( ~ less_or_equal(minimum(X1,X2),n0)
| less_or_equal(X1,n0)
| less_or_equal(X2,n0) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_22_0,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,minimum(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_1,axiom,
( ~ less_or_equal(X1,minimum(X2,X3))
| less_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_23_0,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,minimum(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_1,axiom,
( ~ less_or_equal(X1,minimum(X3,X2))
| less_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_24_0,axiom,
( less_or_equal(X1,n0)
| ~ less_or_equal(half(X1),n0) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( ~ less_or_equal(half(X1),n0)
| less_or_equal(X1,n0) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
! [X3] :
( less_or_equal(X3,n0)
| ~ less_or_equal(add(absolute(add(f(xs(X3)),negate(f(a_real_number)))),absolute(add(g(xs(X3)),negate(g(a_real_number))))),epsilon_0) ),
file('<stdin>',clause_7_2) ).
fof(c_0_1_002,hypothesis,
! [X2,X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(X1))
| less_or_equal(absolute(add(g(X2),negate(g(a_real_number)))),X1) ),
file('<stdin>',clause_4) ).
fof(c_0_2_003,hypothesis,
! [X2,X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_1(X1))
| less_or_equal(absolute(add(f(X2),negate(f(a_real_number)))),X1) ),
file('<stdin>',clause_3) ).
fof(c_0_3_004,hypothesis,
! [X3] :
( less_or_equal(X3,n0)
| less_or_equal(absolute(add(xs(X3),negate(a_real_number))),X3) ),
file('<stdin>',clause_6) ).
fof(c_0_4_005,hypothesis,
! [X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_2(X1),n0) ),
file('<stdin>',clause_2) ).
fof(c_0_5_006,hypothesis,
! [X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_1(X1),n0) ),
file('<stdin>',clause_1) ).
fof(c_0_6_007,hypothesis,
~ less_or_equal(epsilon_0,n0),
file('<stdin>',clause_5) ).
fof(c_0_7_008,negated_conjecture,
! [X3] :
( less_or_equal(X3,n0)
| ~ less_or_equal(add(absolute(add(f(xs(X3)),negate(f(a_real_number)))),absolute(add(g(xs(X3)),negate(g(a_real_number))))),epsilon_0) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8_009,hypothesis,
! [X2,X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(X1))
| less_or_equal(absolute(add(g(X2),negate(g(a_real_number)))),X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_9_010,hypothesis,
! [X2,X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_1(X1))
| less_or_equal(absolute(add(f(X2),negate(f(a_real_number)))),X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10_011,hypothesis,
! [X3] :
( less_or_equal(X3,n0)
| less_or_equal(absolute(add(xs(X3),negate(a_real_number))),X3) ),
c_0_3 ).
fof(c_0_11_012,hypothesis,
! [X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_2(X1),n0) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_12_013,hypothesis,
! [X1] :
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_1(X1),n0) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_13_014,hypothesis,
~ less_or_equal(epsilon_0,n0),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_14_015,negated_conjecture,
! [X4] :
( less_or_equal(X4,n0)
| ~ less_or_equal(add(absolute(add(f(xs(X4)),negate(f(a_real_number)))),absolute(add(g(xs(X4)),negate(g(a_real_number))))),epsilon_0) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15_016,hypothesis,
! [X3,X4] :
( less_or_equal(X4,n0)
| ~ less_or_equal(absolute(add(X3,negate(a_real_number))),delta_2(X4))
| less_or_equal(absolute(add(g(X3),negate(g(a_real_number)))),X4) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_16_017,hypothesis,
! [X3,X4] :
( less_or_equal(X4,n0)
| ~ less_or_equal(absolute(add(X3,negate(a_real_number))),delta_1(X4))
| less_or_equal(absolute(add(f(X3),negate(f(a_real_number)))),X4) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_17_018,hypothesis,
! [X4] :
( less_or_equal(X4,n0)
| less_or_equal(absolute(add(xs(X4),negate(a_real_number))),X4) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_18_019,hypothesis,
! [X2] :
( less_or_equal(X2,n0)
| ~ less_or_equal(delta_2(X2),n0) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19_020,hypothesis,
! [X2] :
( less_or_equal(X2,n0)
| ~ less_or_equal(delta_1(X2),n0) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20_021,hypothesis,
~ less_or_equal(epsilon_0,n0),
c_0_13 ).
cnf(c_0_21_022,negated_conjecture,
( less_or_equal(X1,n0)
| ~ less_or_equal(add(absolute(add(f(xs(X1)),negate(f(a_real_number)))),absolute(add(g(xs(X1)),negate(g(a_real_number))))),epsilon_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22_023,hypothesis,
( less_or_equal(absolute(add(g(X1),negate(g(a_real_number)))),X2)
| less_or_equal(X2,n0)
| ~ less_or_equal(absolute(add(X1,negate(a_real_number))),delta_2(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23_024,hypothesis,
( less_or_equal(absolute(add(f(X1),negate(f(a_real_number)))),X2)
| less_or_equal(X2,n0)
| ~ less_or_equal(absolute(add(X1,negate(a_real_number))),delta_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24_025,hypothesis,
( less_or_equal(absolute(add(xs(X1),negate(a_real_number))),X1)
| less_or_equal(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_2(X1),n0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_1(X1),n0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
~ less_or_equal(epsilon_0,n0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( less_or_equal(X1,n0)
| ~ less_or_equal(add(absolute(add(f(xs(X1)),negate(f(a_real_number)))),absolute(add(g(xs(X1)),negate(g(a_real_number))))),epsilon_0) ),
c_0_21,
[final] ).
cnf(c_0_29,hypothesis,
( less_or_equal(absolute(add(g(X1),negate(g(a_real_number)))),X2)
| less_or_equal(X2,n0)
| ~ less_or_equal(absolute(add(X1,negate(a_real_number))),delta_2(X2)) ),
c_0_22,
[final] ).
cnf(c_0_30,hypothesis,
( less_or_equal(absolute(add(f(X1),negate(f(a_real_number)))),X2)
| less_or_equal(X2,n0)
| ~ less_or_equal(absolute(add(X1,negate(a_real_number))),delta_1(X2)) ),
c_0_23,
[final] ).
cnf(c_0_31,hypothesis,
( less_or_equal(absolute(add(xs(X1),negate(a_real_number))),X1)
| less_or_equal(X1,n0) ),
c_0_24,
[final] ).
cnf(c_0_32,hypothesis,
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_2(X1),n0) ),
c_0_25,
[final] ).
cnf(c_0_33,hypothesis,
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_1(X1),n0) ),
c_0_26,
[final] ).
cnf(c_0_34,hypothesis,
~ less_or_equal(epsilon_0,n0),
c_0_27,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_14,plain,
( less_or_equal(absolute(add(f(X0),negate(f(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_1(X1))
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_30) ).
cnf(c_31,plain,
( less_or_equal(absolute(add(f(X0),negate(f(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_1(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_47,plain,
( less_or_equal(absolute(add(f(X0),negate(f(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_1(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_56,plain,
( less_or_equal(absolute(add(f(X0),negate(f(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_1(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_64,plain,
( less_or_equal(absolute(add(f(X0),negate(f(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_1(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_119,plain,
( less_or_equal(absolute(add(f(X0),negate(f(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_1(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_2,plain,
( less_or_equal(add(X0,X1),X2)
| ~ less_or_equal(X1,half(X2))
| ~ less_or_equal(X0,half(X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_20_2) ).
cnf(c_89,plain,
( less_or_equal(add(X0,X1),X2)
| ~ less_or_equal(X1,half(X2))
| ~ less_or_equal(X0,half(X2)) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_333,plain,
( less_or_equal(add(absolute(add(f(X0),negate(f(a_real_number)))),X1),X2)
| less_or_equal(half(X2),n0)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_1(half(X2)))
| ~ less_or_equal(X1,half(X2)) ),
inference(resolution,[status(thm)],[c_119,c_89]) ).
cnf(c_334,plain,
( less_or_equal(add(absolute(add(f(X0),negate(f(a_real_number)))),X1),X2)
| less_or_equal(half(X2),n0)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_1(half(X2)))
| ~ less_or_equal(X1,half(X2)) ),
inference(rewriting,[status(thm)],[c_333]) ).
cnf(c_12,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X0,n0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_28) ).
cnf(c_41,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_45,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_58,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_62,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_115,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_829,plain,
( less_or_equal(half(epsilon_0),n0)
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_1(half(epsilon_0)))
| ~ less_or_equal(absolute(add(g(xs(X0)),negate(g(a_real_number)))),half(epsilon_0))
| less_or_equal(X0,n0) ),
inference(resolution,[status(thm)],[c_334,c_115]) ).
cnf(c_830,plain,
( less_or_equal(half(epsilon_0),n0)
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_1(half(epsilon_0)))
| ~ less_or_equal(absolute(add(g(xs(X0)),negate(g(a_real_number)))),half(epsilon_0))
| less_or_equal(X0,n0) ),
inference(rewriting,[status(thm)],[c_829]) ).
cnf(c_18,plain,
~ less_or_equal(epsilon_0,n0),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_34) ).
cnf(c_39,plain,
~ less_or_equal(epsilon_0,n0),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_51,plain,
~ less_or_equal(epsilon_0,n0),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_52,plain,
~ less_or_equal(epsilon_0,n0),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_61,plain,
~ less_or_equal(epsilon_0,n0),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_113,plain,
~ less_or_equal(epsilon_0,n0),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_10,plain,
( ~ less_or_equal(half(X0),n0)
| less_or_equal(X0,n0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_24_0) ).
cnf(c_105,plain,
( ~ less_or_equal(half(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_205,plain,
~ less_or_equal(half(epsilon_0),n0),
inference(resolution,[status(thm)],[c_113,c_105]) ).
cnf(c_208,plain,
~ less_or_equal(half(epsilon_0),n0),
inference(rewriting,[status(thm)],[c_205]) ).
cnf(c_933,plain,
( ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_1(half(epsilon_0)))
| ~ less_or_equal(absolute(add(g(xs(X0)),negate(g(a_real_number)))),half(epsilon_0))
| less_or_equal(X0,n0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_830,c_208]) ).
cnf(c_934,plain,
( ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_1(half(epsilon_0)))
| ~ less_or_equal(absolute(add(g(xs(X0)),negate(g(a_real_number)))),half(epsilon_0))
| less_or_equal(X0,n0) ),
inference(rewriting,[status(thm)],[c_933]) ).
cnf(c_13,plain,
( less_or_equal(absolute(add(g(X0),negate(g(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_2(X1))
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_29) ).
cnf(c_29,plain,
( less_or_equal(absolute(add(g(X0),negate(g(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_2(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_46,plain,
( less_or_equal(absolute(add(g(X0),negate(g(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_2(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_57,plain,
( less_or_equal(absolute(add(g(X0),negate(g(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_2(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_63,plain,
( less_or_equal(absolute(add(g(X0),negate(g(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_2(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_117,plain,
( less_or_equal(absolute(add(g(X0),negate(g(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X0,negate(a_real_number))),delta_2(X1))
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_942,plain,
( less_or_equal(half(epsilon_0),n0)
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_2(half(epsilon_0)))
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_1(half(epsilon_0)))
| less_or_equal(X0,n0) ),
inference(resolution,[status(thm)],[c_934,c_117]) ).
cnf(c_943,plain,
( less_or_equal(half(epsilon_0),n0)
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_2(half(epsilon_0)))
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_1(half(epsilon_0)))
| less_or_equal(X0,n0) ),
inference(rewriting,[status(thm)],[c_942]) ).
cnf(c_1000,plain,
( ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_2(half(epsilon_0)))
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_1(half(epsilon_0)))
| less_or_equal(X0,n0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_943,c_208]) ).
cnf(c_1001,plain,
( ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_2(half(epsilon_0)))
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_1(half(epsilon_0)))
| less_or_equal(X0,n0) ),
inference(rewriting,[status(thm)],[c_1000]) ).
cnf(c_6,plain,
( ~ less_or_equal(X0,minimum(X1,X2))
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_22_0) ).
cnf(c_97,plain,
( ~ less_or_equal(X0,minimum(X1,X2))
| less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_1005,plain,
( ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),minimum(delta_1(half(epsilon_0)),X1))
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_2(half(epsilon_0)))
| less_or_equal(X0,n0) ),
inference(resolution,[status(thm)],[c_1001,c_97]) ).
cnf(c_1006,plain,
( ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),minimum(delta_1(half(epsilon_0)),X1))
| ~ less_or_equal(absolute(add(xs(X0),negate(a_real_number))),delta_2(half(epsilon_0)))
| less_or_equal(X0,n0) ),
inference(rewriting,[status(thm)],[c_1005]) ).
cnf(c_15,plain,
( less_or_equal(absolute(add(xs(X0),negate(a_real_number))),X0)
| less_or_equal(X0,n0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_31) ).
cnf(c_33,plain,
( less_or_equal(absolute(add(xs(X0),negate(a_real_number))),X0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_48,plain,
( less_or_equal(absolute(add(xs(X0),negate(a_real_number))),X0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_55,plain,
( less_or_equal(absolute(add(xs(X0),negate(a_real_number))),X0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_65,plain,
( less_or_equal(absolute(add(xs(X0),negate(a_real_number))),X0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_121,plain,
( less_or_equal(absolute(add(xs(X0),negate(a_real_number))),X0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_1275,plain,
( less_or_equal(minimum(delta_1(half(epsilon_0)),X0),n0)
| ~ less_or_equal(absolute(add(xs(minimum(delta_1(half(epsilon_0)),X0)),negate(a_real_number))),delta_2(half(epsilon_0))) ),
inference(resolution,[status(thm)],[c_1006,c_121]) ).
cnf(c_1276,plain,
( less_or_equal(minimum(delta_1(half(epsilon_0)),X0),n0)
| ~ less_or_equal(absolute(add(xs(minimum(delta_1(half(epsilon_0)),X0)),negate(a_real_number))),delta_2(half(epsilon_0))) ),
inference(rewriting,[status(thm)],[c_1275]) ).
cnf(c_8,plain,
( ~ less_or_equal(X0,minimum(X1,X2))
| less_or_equal(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_23_0) ).
cnf(c_101,plain,
( ~ less_or_equal(X0,minimum(X1,X2))
| less_or_equal(X0,X2) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_2269,plain,
( less_or_equal(minimum(delta_1(half(epsilon_0)),X0),n0)
| ~ less_or_equal(absolute(add(xs(minimum(delta_1(half(epsilon_0)),X0)),negate(a_real_number))),minimum(X1,delta_2(half(epsilon_0)))) ),
inference(resolution,[status(thm)],[c_1276,c_101]) ).
cnf(c_2270,plain,
( less_or_equal(minimum(delta_1(half(epsilon_0)),X0),n0)
| ~ less_or_equal(absolute(add(xs(minimum(delta_1(half(epsilon_0)),X0)),negate(a_real_number))),minimum(X1,delta_2(half(epsilon_0)))) ),
inference(rewriting,[status(thm)],[c_2269]) ).
cnf(c_5803,plain,
less_or_equal(minimum(delta_1(half(epsilon_0)),delta_2(half(epsilon_0))),n0),
inference(resolution,[status(thm)],[c_2270,c_121]) ).
cnf(c_5804,plain,
less_or_equal(minimum(delta_1(half(epsilon_0)),delta_2(half(epsilon_0))),n0),
inference(rewriting,[status(thm)],[c_5803]) ).
cnf(c_16,plain,
( ~ less_or_equal(delta_2(X0),n0)
| less_or_equal(X0,n0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_32) ).
cnf(c_35,plain,
( ~ less_or_equal(delta_2(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_49,plain,
( ~ less_or_equal(delta_2(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_54,plain,
( ~ less_or_equal(delta_2(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_59,plain,
( ~ less_or_equal(delta_2(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_109,plain,
( ~ less_or_equal(delta_2(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_3,plain,
( ~ less_or_equal(minimum(X0,X1),n0)
| less_or_equal(X0,n0)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_21_0) ).
cnf(c_91,plain,
( ~ less_or_equal(minimum(X0,X1),n0)
| less_or_equal(X0,n0)
| less_or_equal(X1,n0) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_223,plain,
( ~ less_or_equal(minimum(X0,delta_2(X1)),n0)
| less_or_equal(X1,n0)
| less_or_equal(X0,n0) ),
inference(resolution,[status(thm)],[c_109,c_91]) ).
cnf(c_224,plain,
( ~ less_or_equal(minimum(X0,delta_2(X1)),n0)
| less_or_equal(X1,n0)
| less_or_equal(X0,n0) ),
inference(rewriting,[status(thm)],[c_223]) ).
cnf(c_17459,plain,
( less_or_equal(half(epsilon_0),n0)
| less_or_equal(delta_1(half(epsilon_0)),n0) ),
inference(resolution,[status(thm)],[c_5804,c_224]) ).
cnf(c_17460,plain,
( less_or_equal(half(epsilon_0),n0)
| less_or_equal(delta_1(half(epsilon_0)),n0) ),
inference(rewriting,[status(thm)],[c_17459]) ).
cnf(c_51761,plain,
less_or_equal(delta_1(half(epsilon_0)),n0),
inference(forward_subsumption_resolution,[status(thm)],[c_17460,c_208]) ).
cnf(c_51762,plain,
less_or_equal(delta_1(half(epsilon_0)),n0),
inference(rewriting,[status(thm)],[c_51761]) ).
cnf(c_17,plain,
( ~ less_or_equal(delta_1(X0),n0)
| less_or_equal(X0,n0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_de48d9.p',c_0_33) ).
cnf(c_37,plain,
( ~ less_or_equal(delta_1(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_50,plain,
( ~ less_or_equal(delta_1(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_53,plain,
( ~ less_or_equal(delta_1(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_60,plain,
( ~ less_or_equal(delta_1(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_111,plain,
( ~ less_or_equal(delta_1(X0),n0)
| less_or_equal(X0,n0) ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_51764,plain,
less_or_equal(half(epsilon_0),n0),
inference(resolution,[status(thm)],[c_51762,c_111]) ).
cnf(c_51765,plain,
less_or_equal(half(epsilon_0),n0),
inference(rewriting,[status(thm)],[c_51764]) ).
cnf(c_51767,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_51765,c_208]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA003-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 03:21:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c73df4.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_de48d9.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_7ddbb5 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c73df4.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 1.81/2.02 % --inst_prop_sim_new false
% 1.81/2.02 % --inst_orphan_elimination true
% 1.81/2.02 % --inst_learning_loop_flag true
% 1.81/2.02 % --inst_learning_start 3000
% 1.81/2.02 % --inst_learning_factor 2
% 1.81/2.02 % --inst_start_prop_sim_after_learn 3
% 1.81/2.02 % --inst_sel_renew solver
% 1.81/2.02 % --inst_lit_activity_flag true
% 1.81/2.02 % --inst_out_proof true
% 1.81/2.02
% 1.81/2.02 % ------ Resolution Options
% 1.81/2.02
% 1.81/2.02 % --resolution_flag true
% 1.81/2.02 % --res_lit_sel kbo_max
% 1.81/2.02 % --res_to_prop_solver none
% 1.81/2.02 % --res_prop_simpl_new false
% 1.81/2.02 % --res_prop_simpl_given false
% 1.81/2.02 % --res_passive_queue_type priority_queues
% 1.81/2.02 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.81/2.02 % --res_passive_queues_freq [15;5]
% 1.81/2.02 % --res_forward_subs full
% 1.81/2.02 % --res_backward_subs full
% 1.81/2.02 % --res_forward_subs_resolution true
% 1.81/2.02 % --res_backward_subs_resolution true
% 1.81/2.02 % --res_orphan_elimination false
% 1.81/2.02 % --res_time_limit 1000.
% 1.81/2.02 % --res_out_proof true
% 1.81/2.02 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c73df4.s
% 1.81/2.02 % --modulo true
% 1.81/2.02
% 1.81/2.02 % ------ Combination Options
% 1.81/2.02
% 1.81/2.02 % --comb_res_mult 1000
% 1.81/2.02 % --comb_inst_mult 300
% 1.81/2.02 % ------
% 1.81/2.02
% 1.81/2.02
% 1.81/2.02
% 1.81/2.02 % ------ Proving...
% 1.81/2.02 %
% 1.81/2.02
% 1.81/2.02
% 1.81/2.02 % Resolution empty clause
% 1.81/2.02
% 1.81/2.02 % ------ Statistics
% 1.81/2.02
% 1.81/2.02 % ------ General
% 1.81/2.02
% 1.81/2.02 % num_of_input_clauses: 19
% 1.81/2.02 % num_of_input_neg_conjectures: 1
% 1.81/2.02 % num_of_splits: 0
% 1.81/2.02 % num_of_split_atoms: 0
% 1.81/2.02 % num_of_sem_filtered_clauses: 0
% 1.81/2.02 % num_of_subtypes: 0
% 1.81/2.02 % monotx_restored_types: 0
% 1.81/2.02 % sat_num_of_epr_types: 0
% 1.81/2.02 % sat_num_of_non_cyclic_types: 0
% 1.81/2.02 % sat_guarded_non_collapsed_types: 0
% 1.81/2.02 % is_epr: 0
% 1.81/2.02 % is_horn: 0
% 1.81/2.02 % has_eq: 0
% 1.81/2.02 % num_pure_diseq_elim: 0
% 1.81/2.02 % simp_replaced_by: 0
% 1.81/2.02 % res_preprocessed: 8
% 1.81/2.02 % prep_upred: 0
% 1.81/2.02 % prep_unflattend: 0
% 1.81/2.02 % pred_elim_cands: 0
% 1.81/2.02 % pred_elim: 0
% 1.81/2.02 % pred_elim_cl: 0
% 1.81/2.02 % pred_elim_cycles: 0
% 1.81/2.02 % forced_gc_time: 0
% 1.81/2.02 % gc_basic_clause_elim: 0
% 1.81/2.02 % parsing_time: 0.001
% 1.81/2.02 % sem_filter_time: 0.
% 1.81/2.02 % pred_elim_time: 0.
% 1.81/2.02 % out_proof_time: 0.001
% 1.81/2.02 % monotx_time: 0.
% 1.81/2.02 % subtype_inf_time: 0.
% 1.81/2.02 % unif_index_cands_time: 0.007
% 1.81/2.02 % unif_index_add_time: 0.013
% 1.81/2.02 % total_time: 1.611
% 1.81/2.02 % num_of_symbols: 39
% 1.81/2.02 % num_of_terms: 58791
% 1.81/2.02
% 1.81/2.02 % ------ Propositional Solver
% 1.81/2.02
% 1.81/2.02 % prop_solver_calls: 15
% 1.81/2.02 % prop_fast_solver_calls: 32
% 1.81/2.02 % prop_num_of_clauses: 5401
% 1.81/2.02 % prop_preprocess_simplified: 4294
% 1.81/2.02 % prop_fo_subsumed: 0
% 1.81/2.02 % prop_solver_time: 0.
% 1.81/2.02 % prop_fast_solver_time: 0.
% 1.81/2.02 % prop_unsat_core_time: 0.
% 1.81/2.02
% 1.81/2.02 % ------ QBF
% 1.81/2.02
% 1.81/2.02 % qbf_q_res: 0
% 1.81/2.02 % qbf_num_tautologies: 0
% 1.81/2.02 % qbf_prep_cycles: 0
% 1.81/2.02
% 1.81/2.02 % ------ BMC1
% 1.81/2.02
% 1.81/2.02 % bmc1_current_bound: -1
% 1.81/2.02 % bmc1_last_solved_bound: -1
% 1.81/2.02 % bmc1_unsat_core_size: -1
% 1.81/2.02 % bmc1_unsat_core_parents_size: -1
% 1.81/2.02 % bmc1_merge_next_fun: 0
% 1.81/2.02 % bmc1_unsat_core_clauses_time: 0.
% 1.81/2.02
% 1.81/2.02 % ------ Instantiation
% 1.81/2.02
% 1.81/2.02 % inst_num_of_clauses: 3523
% 1.81/2.02 % inst_num_in_passive: 1897
% 1.81/2.02 % inst_num_in_active: 872
% 1.81/2.02 % inst_num_in_unprocessed: 754
% 1.81/2.02 % inst_num_of_loops: 900
% 1.81/2.02 % inst_num_of_learning_restarts: 0
% 1.81/2.02 % inst_num_moves_active_passive: 26
% 1.81/2.02 % inst_lit_activity: 937
% 1.81/2.02 % inst_lit_activity_moves: 1
% 1.81/2.02 % inst_num_tautologies: 0
% 1.81/2.02 % inst_num_prop_implied: 0
% 1.81/2.02 % inst_num_existing_simplified: 0
% 1.81/2.02 % inst_num_eq_res_simplified: 0
% 1.81/2.02 % inst_num_child_elim: 0
% 1.81/2.02 % inst_num_of_dismatching_blockings: 1699
% 1.81/2.02 % inst_num_of_non_proper_insts: 2738
% 1.81/2.02 % inst_num_of_duplicates: 1108
% 1.81/2.02 % inst_inst_num_from_inst_to_res: 0
% 1.81/2.02 % inst_dismatching_checking_time: 0.028
% 1.81/2.02
% 1.81/2.02 % ------ Resolution
% 1.81/2.02
% 1.81/2.02 % res_num_of_clauses: 9417
% 1.81/2.02 % res_num_in_passive: 5931
% 1.81/2.02 % res_num_in_active: 3482
% 1.81/2.02 % res_num_of_loops: 3746
% 1.81/2.02 % res_forward_subset_subsumed: 15
% 1.81/2.02 % res_backward_subset_subsumed: 3
% 1.81/2.02 % res_forward_subsumed: 255
% 1.81/2.02 % res_backward_subsumed: 15
% 1.81/2.02 % res_forward_subsumption_resolution: 132
% 1.81/2.02 % res_backward_subsumption_resolution: 0
% 1.81/2.02 % res_clause_to_clause_subsumption: 88182
% 1.81/2.02 % res_orphan_elimination: 0
% 1.81/2.02 % res_tautology_del: 0
% 1.81/2.02 % res_num_eq_res_simplified: 0
% 1.81/2.02 % res_num_sel_changes: 0
% 1.81/2.02 % res_moves_from_active_to_pass: 0
% 1.81/2.02
% 1.81/2.02 % Status Unsatisfiable
% 1.81/2.02 % SZS status Unsatisfiable
% 1.81/2.02 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------