TSTP Solution File: ANA003-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : ANA003-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n021.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:31 EDT 2022
% Result : Unsatisfiable 1.06s 1.31s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(reflexivity_of_less_than,axiom,
~ less_than(X,X),
input ).
fof(reflexivity_of_less_than_0,plain,
! [X] :
( ~ less_than(X,X)
| $false ),
inference(orientation,[status(thm)],[reflexivity_of_less_than]) ).
cnf(left_identity,axiom,
equalish(add(n0,X),X),
input ).
fof(left_identity_0,plain,
! [X] :
( equalish(add(n0,X),X)
| $false ),
inference(orientation,[status(thm)],[left_identity]) ).
cnf(right_identity,axiom,
equalish(add(X,n0),X),
input ).
fof(right_identity_0,plain,
! [X] :
( equalish(add(X,n0),X)
| $false ),
inference(orientation,[status(thm)],[right_identity]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> equalish(add(X,n0),X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[right_identity_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X] :
( lhs_atom2(X)
<=> equalish(add(n0,X),X) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X] :
( lhs_atom2(X)
| $false ),
inference(fold_definition,[status(thm)],[left_identity_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [X] :
( lhs_atom3(X)
<=> ~ less_than(X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [X] :
( lhs_atom3(X)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_of_less_than_0,def_lhs_atom3]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom3(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_2,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_3,plain,
! [X1] : lhs_atom3(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_5,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_6,plain,
! [X2] : lhs_atom3(X2),
inference(variable_rename,[status(thm)],[c_0_3]) ).
fof(c_0_7,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
lhs_atom3(X1),
c_0_9,
[final] ).
cnf(c_0_13,plain,
lhs_atom2(X1),
c_0_10,
[final] ).
cnf(c_0_14,plain,
lhs_atom1(X1),
c_0_11,
[final] ).
% End CNF derivation
cnf(c_0_12_0,axiom,
~ less_than(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_12,def_lhs_atom3]) ).
cnf(c_0_13_0,axiom,
equalish(add(n0,X1),X1),
inference(unfold_definition,[status(thm)],[c_0_13,def_lhs_atom2]) ).
cnf(c_0_14_0,axiom,
equalish(add(X1,n0),X1),
inference(unfold_definition,[status(thm)],[c_0_14,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X2,X1,X3] :
( ~ less_than(add(absolute(X3),absolute(X2)),X1)
| less_than(absolute(add(X3,X2)),X1) ),
file('<stdin>',c_17) ).
fof(c_0_1_002,axiom,
! [X2,X1,X3] :
( ~ less_than(X3,half(X1))
| ~ less_than(X2,half(X1))
| less_than(add(X3,X2),X1) ),
file('<stdin>',axiom_3) ).
fof(c_0_2_003,axiom,
! [X2,X3] :
( ~ less_than(n0,X3)
| ~ less_than(n0,X2)
| less_than(minimum(X3,X2),X3) ),
file('<stdin>',axiom_2_2) ).
fof(c_0_3_004,axiom,
! [X2,X3] :
( ~ less_than(n0,X3)
| ~ less_than(n0,X2)
| less_than(minimum(X3,X2),X2) ),
file('<stdin>',axiom_2_3) ).
fof(c_0_4_005,axiom,
! [X2,X3] :
( ~ less_than(n0,X3)
| ~ less_than(n0,X2)
| less_than(n0,minimum(X3,X2)) ),
file('<stdin>',axiom_2_1) ).
fof(c_0_5_006,axiom,
! [X4,X2,X3] :
( ~ less_than(X3,X2)
| ~ less_than(X2,X4)
| less_than(X3,X4) ),
file('<stdin>',transitivity_of_less_than) ).
fof(c_0_6_007,axiom,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
file('<stdin>',axiom_7) ).
fof(c_0_7_008,plain,
! [X2,X1,X3] :
( ~ less_than(add(absolute(X3),absolute(X2)),X1)
| less_than(absolute(add(X3,X2)),X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8_009,plain,
! [X2,X1,X3] :
( ~ less_than(X3,half(X1))
| ~ less_than(X2,half(X1))
| less_than(add(X3,X2),X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_9_010,plain,
! [X2,X3] :
( ~ less_than(n0,X3)
| ~ less_than(n0,X2)
| less_than(minimum(X3,X2),X3) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10_011,plain,
! [X2,X3] :
( ~ less_than(n0,X3)
| ~ less_than(n0,X2)
| less_than(minimum(X3,X2),X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_11_012,plain,
! [X2,X3] :
( ~ less_than(n0,X3)
| ~ less_than(n0,X2)
| less_than(n0,minimum(X3,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_12_013,plain,
! [X4,X2,X3] :
( ~ less_than(X3,X2)
| ~ less_than(X2,X4)
| less_than(X3,X4) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_13_014,plain,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_14_015,plain,
! [X4,X5,X6] :
( ~ less_than(add(absolute(X6),absolute(X4)),X5)
| less_than(absolute(add(X6,X4)),X5) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ~ less_than(X6,half(X5))
| ~ less_than(X4,half(X5))
| less_than(add(X6,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X4,X5] :
( ~ less_than(n0,X5)
| ~ less_than(n0,X4)
| less_than(minimum(X5,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X4,X5] :
( ~ less_than(n0,X5)
| ~ less_than(n0,X4)
| less_than(minimum(X5,X4),X4) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X4,X5] :
( ~ less_than(n0,X5)
| ~ less_than(n0,X4)
| less_than(n0,minimum(X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X5,X6,X7] :
( ~ less_than(X7,X6)
| ~ less_than(X6,X5)
| less_than(X7,X5) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X2] :
( ~ less_than(n0,X2)
| less_than(n0,half(X2)) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( less_than(absolute(add(X1,X2)),X3)
| ~ less_than(add(absolute(X1),absolute(X2)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( less_than(add(X1,X2),X3)
| ~ less_than(X2,half(X3))
| ~ less_than(X1,half(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( less_than(absolute(add(X1,X2)),X3)
| ~ less_than(add(absolute(X1),absolute(X2)),X3) ),
c_0_21,
[final] ).
cnf(c_0_29,plain,
( less_than(add(X1,X2),X3)
| ~ less_than(X2,half(X3))
| ~ less_than(X1,half(X3)) ),
c_0_22,
[final] ).
cnf(c_0_30,plain,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
c_0_23,
[final] ).
cnf(c_0_31,plain,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
c_0_24,
[final] ).
cnf(c_0_32,plain,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
c_0_25,
[final] ).
cnf(c_0_33,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
c_0_26,
[final] ).
cnf(c_0_34,plain,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
c_0_27,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_28_0,axiom,
( less_than(absolute(add(X1,X2)),X3)
| ~ less_than(add(absolute(X1),absolute(X2)),X3) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( ~ less_than(add(absolute(X1),absolute(X2)),X3)
| less_than(absolute(add(X1,X2)),X3) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( less_than(add(X1,X2),X3)
| ~ less_than(X2,half(X3))
| ~ less_than(X1,half(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( ~ less_than(X2,half(X3))
| less_than(add(X1,X2),X3)
| ~ less_than(X1,half(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_2,axiom,
( ~ less_than(X1,half(X3))
| ~ less_than(X2,half(X3))
| less_than(add(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_30_0,axiom,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( ~ less_than(n0,X2)
| less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_2,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| less_than(minimum(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_31_0,axiom,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_1,axiom,
( ~ less_than(n0,X2)
| less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_2,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| less_than(minimum(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_32_0,axiom,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( ~ less_than(n0,X2)
| less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_2,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| less_than(n0,minimum(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( ~ less_than(X3,X2)
| less_than(X1,X2)
| ~ less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_2,axiom,
( ~ less_than(X1,X3)
| ~ less_than(X3,X2)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_016,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b) ),
file('<stdin>',c_16) ).
fof(c_0_1_017,negated_conjecture,
! [X2,X1] :
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp32(X1))
| less_than(absolute(add(g(X2),minus(l2))),X1) ),
file('<stdin>',c_13) ).
fof(c_0_2_018,negated_conjecture,
! [X2,X1] :
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp31(X1))
| less_than(absolute(add(f(X2),minus(l1))),X1) ),
file('<stdin>',c_11) ).
fof(c_0_3_019,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
file('<stdin>',c_15) ).
fof(c_0_4_020,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
file('<stdin>',c_12) ).
fof(c_0_5_021,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
file('<stdin>',c_10) ).
fof(c_0_6_022,negated_conjecture,
less_than(n0,b),
file('<stdin>',c_14) ).
fof(c_0_7_023,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8_024,negated_conjecture,
! [X2,X1] :
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp32(X1))
| less_than(absolute(add(g(X2),minus(l2))),X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_9_025,negated_conjecture,
! [X2,X1] :
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp31(X1))
| less_than(absolute(add(f(X2),minus(l1))),X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10_026,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_11_027,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_12_028,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_13_029,negated_conjecture,
less_than(n0,b),
c_0_6 ).
fof(c_0_14_030,negated_conjecture,
! [X2] :
( ~ less_than(n0,X2)
| ~ less_than(add(absolute(add(f(fp33(X2)),minus(l1))),absolute(add(g(fp33(X2)),minus(l2)))),b) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15_031,negated_conjecture,
! [X3,X4] :
( ~ less_than(n0,X4)
| ~ less_than(absolute(add(X3,minus(a))),fp32(X4))
| less_than(absolute(add(g(X3),minus(l2))),X4) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_16_032,negated_conjecture,
! [X3,X4] :
( ~ less_than(n0,X4)
| ~ less_than(absolute(add(X3,minus(a))),fp31(X4))
| less_than(absolute(add(f(X3),minus(l1))),X4) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_17_033,negated_conjecture,
! [X2] :
( ~ less_than(n0,X2)
| less_than(absolute(add(fp33(X2),minus(a))),X2) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_18_034,negated_conjecture,
! [X2] :
( ~ less_than(n0,X2)
| less_than(n0,fp32(X2)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19_035,negated_conjecture,
! [X2] :
( ~ less_than(n0,X2)
| less_than(n0,fp31(X2)) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20_036,negated_conjecture,
less_than(n0,b),
c_0_13 ).
cnf(c_0_21_037,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22_038,negated_conjecture,
( less_than(absolute(add(g(X1),minus(l2))),X2)
| ~ less_than(absolute(add(X1,minus(a))),fp32(X2))
| ~ less_than(n0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23_039,negated_conjecture,
( less_than(absolute(add(f(X1),minus(l1))),X2)
| ~ less_than(absolute(add(X1,minus(a))),fp31(X2))
| ~ less_than(n0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24_040,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25_041,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26_042,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27_043,negated_conjecture,
less_than(n0,b),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28_044,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
c_0_21,
[final] ).
cnf(c_0_29_045,negated_conjecture,
( less_than(absolute(add(g(X1),minus(l2))),X2)
| ~ less_than(absolute(add(X1,minus(a))),fp32(X2))
| ~ less_than(n0,X2) ),
c_0_22,
[final] ).
cnf(c_0_30_046,negated_conjecture,
( less_than(absolute(add(f(X1),minus(l1))),X2)
| ~ less_than(absolute(add(X1,minus(a))),fp31(X2))
| ~ less_than(n0,X2) ),
c_0_23,
[final] ).
cnf(c_0_31_047,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
c_0_24,
[final] ).
cnf(c_0_32_048,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
c_0_25,
[final] ).
cnf(c_0_33_049,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
c_0_26,
[final] ).
cnf(c_0_34_050,negated_conjecture,
less_than(n0,b),
c_0_27,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_24,negated_conjecture,
( less_than(absolute(add(f(X0),minus(l1))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp31(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_30) ).
cnf(c_43,negated_conjecture,
( less_than(absolute(add(f(X0),minus(l1))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp31(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_69,negated_conjecture,
( less_than(absolute(add(f(X0),minus(l1))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp31(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_78,negated_conjecture,
( less_than(absolute(add(f(X0),minus(l1))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp31(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_83,negated_conjecture,
( less_than(absolute(add(f(X0),minus(l1))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp31(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_165,negated_conjecture,
( less_than(absolute(add(f(X0),minus(l1))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp31(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_4,plain,
( less_than(add(X0,X1),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(X0,half(X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_29_2) ).
cnf(c_125,plain,
( less_than(add(X0,X1),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(X0,half(X2)) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_245,plain,
( less_than(add(absolute(add(f(X0),minus(l1))),X1),X2)
| ~ less_than(absolute(add(X0,minus(a))),fp31(half(X2)))
| ~ less_than(n0,half(X2))
| ~ less_than(X1,half(X2)) ),
inference(resolution,[status(thm)],[c_165,c_125]) ).
cnf(c_246,plain,
( less_than(add(absolute(add(f(X0),minus(l1))),X1),X2)
| ~ less_than(absolute(add(X0,minus(a))),fp31(half(X2)))
| ~ less_than(n0,half(X2))
| ~ less_than(X1,half(X2)) ),
inference(rewriting,[status(thm)],[c_245]) ).
cnf(c_22,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X0)),minus(l1))),absolute(add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_28) ).
cnf(c_39,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X0)),minus(l1))),absolute(add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_67,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X0)),minus(l1))),absolute(add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_80,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X0)),minus(l1))),absolute(add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_81,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X0)),minus(l1))),absolute(add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_161,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X0)),minus(l1))),absolute(add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_829,plain,
( ~ less_than(absolute(add(fp33(X0),minus(a))),fp31(half(b)))
| ~ less_than(absolute(add(g(fp33(X0)),minus(l2))),half(b))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X0) ),
inference(resolution,[status(thm)],[c_246,c_161]) ).
cnf(c_830,plain,
( ~ less_than(absolute(add(fp33(X0),minus(a))),fp31(half(b)))
| ~ less_than(absolute(add(g(fp33(X0)),minus(l2))),half(b))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X0) ),
inference(rewriting,[status(thm)],[c_829]) ).
cnf(c_23,negated_conjecture,
( less_than(absolute(add(g(X0),minus(l2))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp32(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_29) ).
cnf(c_41,negated_conjecture,
( less_than(absolute(add(g(X0),minus(l2))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp32(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_68,negated_conjecture,
( less_than(absolute(add(g(X0),minus(l2))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp32(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_79,negated_conjecture,
( less_than(absolute(add(g(X0),minus(l2))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp32(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_82,negated_conjecture,
( less_than(absolute(add(g(X0),minus(l2))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp32(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_163,negated_conjecture,
( less_than(absolute(add(g(X0),minus(l2))),X1)
| ~ less_than(absolute(add(X0,minus(a))),fp32(X1))
| ~ less_than(n0,X1) ),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_869,plain,
( ~ less_than(absolute(add(fp33(X0),minus(a))),fp32(half(b)))
| ~ less_than(absolute(add(fp33(X0),minus(a))),fp31(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X0) ),
inference(resolution,[status(thm)],[c_830,c_163]) ).
cnf(c_870,plain,
( ~ less_than(absolute(add(fp33(X0),minus(a))),fp32(half(b)))
| ~ less_than(absolute(add(fp33(X0),minus(a))),fp31(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X0) ),
inference(rewriting,[status(thm)],[c_869]) ).
cnf(c_25,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_31) ).
cnf(c_45,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_70,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_77,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_84,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_167,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_16,plain,
( less_than(X0,X1)
| ~ less_than(X2,X1)
| ~ less_than(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_33_2) ).
cnf(c_149,plain,
( less_than(X0,X1)
| ~ less_than(X2,X1)
| ~ less_than(X0,X2) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_221,plain,
( less_than(absolute(add(fp33(X0),minus(a))),X1)
| ~ less_than(n0,X0)
| ~ less_than(X0,X1) ),
inference(resolution,[status(thm)],[c_167,c_149]) ).
cnf(c_222,plain,
( less_than(absolute(add(fp33(X0),minus(a))),X1)
| ~ less_than(n0,X0)
| ~ less_than(X0,X1) ),
inference(rewriting,[status(thm)],[c_221]) ).
cnf(c_887,plain,
( ~ less_than(absolute(add(fp33(X0),minus(a))),fp32(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X0)
| ~ less_than(X0,fp31(half(b))) ),
inference(resolution,[status(thm)],[c_870,c_222]) ).
cnf(c_888,plain,
( ~ less_than(absolute(add(fp33(X0),minus(a))),fp32(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X0)
| ~ less_than(X0,fp31(half(b))) ),
inference(rewriting,[status(thm)],[c_887]) ).
cnf(c_13099,plain,
( ~ less_than(n0,half(b))
| ~ less_than(n0,X0)
| ~ less_than(X0,fp32(half(b)))
| ~ less_than(X0,fp31(half(b))) ),
inference(resolution,[status(thm)],[c_888,c_222]) ).
cnf(c_13100,plain,
( ~ less_than(n0,half(b))
| ~ less_than(n0,X0)
| ~ less_than(X0,fp32(half(b)))
| ~ less_than(X0,fp31(half(b))) ),
inference(rewriting,[status(thm)],[c_13099]) ).
cnf(c_27,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_33) ).
cnf(c_49,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_72,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_75,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_86,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_171,plain,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_7,plain,
( less_than(minimum(X0,X1),X0)
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_30_2) ).
cnf(c_131,plain,
( less_than(minimum(X0,X1),X0)
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_207,plain,
( less_than(minimum(fp31(X0),X1),fp31(X0))
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(resolution,[status(thm)],[c_171,c_131]) ).
cnf(c_208,plain,
( less_than(minimum(fp31(X0),X1),fp31(X0))
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(rewriting,[status(thm)],[c_207]) ).
cnf(c_13169,plain,
( ~ less_than(minimum(fp31(half(b)),X0),fp32(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,minimum(fp31(half(b)),X0))
| ~ less_than(n0,X0) ),
inference(resolution,[status(thm)],[c_13100,c_208]) ).
cnf(c_13170,plain,
( ~ less_than(minimum(fp31(half(b)),X0),fp32(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,minimum(fp31(half(b)),X0))
| ~ less_than(n0,X0) ),
inference(rewriting,[status(thm)],[c_13169]) ).
cnf(c_13,plain,
( less_than(n0,minimum(X0,X1))
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_32_2) ).
cnf(c_143,plain,
( less_than(n0,minimum(X0,X1))
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_205,plain,
( less_than(n0,minimum(fp31(X0),X1))
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(resolution,[status(thm)],[c_171,c_143]) ).
cnf(c_210,plain,
( less_than(n0,minimum(fp31(X0),X1))
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(rewriting,[status(thm)],[c_205]) ).
cnf(c_23366,plain,
( ~ less_than(minimum(fp31(half(b)),X0),fp32(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13170,c_210]) ).
cnf(c_23367,plain,
( ~ less_than(minimum(fp31(half(b)),X0),fp32(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X0) ),
inference(rewriting,[status(thm)],[c_23366]) ).
cnf(c_10,plain,
( less_than(minimum(X0,X1),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_31_2) ).
cnf(c_137,plain,
( less_than(minimum(X0,X1),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_206,plain,
( less_than(minimum(fp31(X0),X1),X1)
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(resolution,[status(thm)],[c_171,c_137]) ).
cnf(c_209,plain,
( less_than(minimum(fp31(X0),X1),X1)
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(rewriting,[status(thm)],[c_206]) ).
cnf(c_23377,plain,
( ~ less_than(n0,half(b))
| ~ less_than(n0,fp32(half(b))) ),
inference(resolution,[status(thm)],[c_23367,c_209]) ).
cnf(c_23378,plain,
( ~ less_than(n0,half(b))
| ~ less_than(n0,fp32(half(b))) ),
inference(rewriting,[status(thm)],[c_23377]) ).
cnf(c_26,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_32) ).
cnf(c_47,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_71,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_76,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_85,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_169,plain,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_23397,plain,
~ less_than(n0,half(b)),
inference(forward_subsumption_resolution,[status(thm)],[c_23378,c_169]) ).
cnf(c_23398,plain,
~ less_than(n0,half(b)),
inference(rewriting,[status(thm)],[c_23397]) ).
cnf(c_17,plain,
( ~ less_than(n0,X0)
| less_than(n0,half(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_34_0) ).
cnf(c_151,plain,
( ~ less_than(n0,X0)
| less_than(n0,half(X0)) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_152,plain,
( less_than(n0,half(X0))
| ~ less_than(n0,X0) ),
inference(rewriting,[status(thm)],[c_151]) ).
cnf(c_23402,plain,
~ less_than(n0,b),
inference(resolution,[status(thm)],[c_23398,c_152]) ).
cnf(c_23403,plain,
~ less_than(n0,b),
inference(rewriting,[status(thm)],[c_23402]) ).
cnf(c_28,negated_conjecture,
less_than(n0,b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p',c_0_34) ).
cnf(c_51,negated_conjecture,
less_than(n0,b),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_73,negated_conjecture,
less_than(n0,b),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_74,negated_conjecture,
less_than(n0,b),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_87,negated_conjecture,
less_than(n0,b),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_173,plain,
less_than(n0,b),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_24149,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_23403,c_173]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ANA003-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 06:28:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % Orientation found
% 0.12/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/sandbox2/tmp/iprover_proof_da1a20.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_d14e3d.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_6a2d0d | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --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/sandbox2/tmp/iprover_proof_da1a20.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 true
% 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.06/1.30 % --inst_prop_sim_new false
% 1.06/1.30 % --inst_orphan_elimination true
% 1.06/1.30 % --inst_learning_loop_flag true
% 1.06/1.30 % --inst_learning_start 3000
% 1.06/1.30 % --inst_learning_factor 2
% 1.06/1.30 % --inst_start_prop_sim_after_learn 3
% 1.06/1.30 % --inst_sel_renew solver
% 1.06/1.30 % --inst_lit_activity_flag true
% 1.06/1.30 % --inst_out_proof true
% 1.06/1.30
% 1.06/1.30 % ------ Resolution Options
% 1.06/1.30
% 1.06/1.30 % --resolution_flag true
% 1.06/1.30 % --res_lit_sel kbo_max
% 1.06/1.30 % --res_to_prop_solver none
% 1.06/1.30 % --res_prop_simpl_new false
% 1.06/1.30 % --res_prop_simpl_given false
% 1.06/1.30 % --res_passive_queue_type priority_queues
% 1.06/1.30 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.06/1.30 % --res_passive_queues_freq [15;5]
% 1.06/1.30 % --res_forward_subs full
% 1.06/1.30 % --res_backward_subs full
% 1.06/1.30 % --res_forward_subs_resolution true
% 1.06/1.30 % --res_backward_subs_resolution true
% 1.06/1.30 % --res_orphan_elimination false
% 1.06/1.30 % --res_time_limit 1000.
% 1.06/1.30 % --res_out_proof true
% 1.06/1.30 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_da1a20.s
% 1.06/1.30 % --modulo true
% 1.06/1.30
% 1.06/1.30 % ------ Combination Options
% 1.06/1.30
% 1.06/1.30 % --comb_res_mult 1000
% 1.06/1.30 % --comb_inst_mult 300
% 1.06/1.30 % ------
% 1.06/1.30
% 1.06/1.30
% 1.06/1.30
% 1.06/1.30 % ------ Proving...
% 1.06/1.30 %
% 1.06/1.30
% 1.06/1.30
% 1.06/1.30 % Resolution empty clause
% 1.06/1.30
% 1.06/1.30 % ------ Statistics
% 1.06/1.30
% 1.06/1.30 % ------ General
% 1.06/1.30
% 1.06/1.30 % num_of_input_clauses: 29
% 1.06/1.30 % num_of_input_neg_conjectures: 7
% 1.06/1.30 % num_of_splits: 0
% 1.06/1.30 % num_of_split_atoms: 0
% 1.06/1.30 % num_of_sem_filtered_clauses: 0
% 1.06/1.30 % num_of_subtypes: 0
% 1.06/1.30 % monotx_restored_types: 0
% 1.06/1.30 % sat_num_of_epr_types: 0
% 1.06/1.30 % sat_num_of_non_cyclic_types: 0
% 1.06/1.30 % sat_guarded_non_collapsed_types: 0
% 1.06/1.30 % is_epr: 0
% 1.06/1.30 % is_horn: 1
% 1.06/1.30 % has_eq: 0
% 1.06/1.30 % num_pure_diseq_elim: 0
% 1.06/1.30 % simp_replaced_by: 0
% 1.06/1.30 % res_preprocessed: 14
% 1.06/1.30 % prep_upred: 0
% 1.06/1.30 % prep_unflattend: 0
% 1.06/1.30 % pred_elim_cands: 0
% 1.06/1.30 % pred_elim: 0
% 1.06/1.30 % pred_elim_cl: 0
% 1.06/1.30 % pred_elim_cycles: 0
% 1.06/1.30 % forced_gc_time: 0
% 1.06/1.30 % gc_basic_clause_elim: 0
% 1.06/1.30 % parsing_time: 0.001
% 1.06/1.30 % sem_filter_time: 0.
% 1.06/1.30 % pred_elim_time: 0.
% 1.06/1.30 % out_proof_time: 0.001
% 1.06/1.30 % monotx_time: 0.
% 1.06/1.30 % subtype_inf_time: 0.
% 1.06/1.30 % unif_index_cands_time: 0.004
% 1.06/1.30 % unif_index_add_time: 0.001
% 1.06/1.30 % total_time: 0.899
% 1.06/1.30 % num_of_symbols: 42
% 1.06/1.30 % num_of_terms: 23739
% 1.06/1.30
% 1.06/1.30 % ------ Propositional Solver
% 1.06/1.30
% 1.06/1.30 % prop_solver_calls: 1
% 1.06/1.30 % prop_fast_solver_calls: 45
% 1.06/1.30 % prop_num_of_clauses: 29
% 1.06/1.30 % prop_preprocess_simplified: 189
% 1.06/1.30 % prop_fo_subsumed: 0
% 1.06/1.30 % prop_solver_time: 0.
% 1.06/1.30 % prop_fast_solver_time: 0.
% 1.06/1.30 % prop_unsat_core_time: 0.
% 1.06/1.30
% 1.06/1.30 % ------ QBF
% 1.06/1.30
% 1.06/1.30 % qbf_q_res: 0
% 1.06/1.30 % qbf_num_tautologies: 0
% 1.06/1.30 % qbf_prep_cycles: 0
% 1.06/1.30
% 1.06/1.30 % ------ BMC1
% 1.06/1.30
% 1.06/1.30 % bmc1_current_bound: -1
% 1.06/1.30 % bmc1_last_solved_bound: -1
% 1.06/1.30 % bmc1_unsat_core_size: -1
% 1.06/1.30 % bmc1_unsat_core_parents_size: -1
% 1.06/1.30 % bmc1_merge_next_fun: 0
% 1.06/1.30 % bmc1_unsat_core_clauses_time: 0.
% 1.06/1.30
% 1.06/1.30 % ------ Instantiation
% 1.06/1.30
% 1.06/1.30 % inst_num_of_clauses: 29
% 1.06/1.30 % inst_num_in_passive: 0
% 1.06/1.30 % inst_num_in_active: 0
% 1.06/1.30 % inst_num_in_unprocessed: 29
% 1.06/1.30 % inst_num_of_loops: 0
% 1.06/1.30 % inst_num_of_learning_restarts: 0
% 1.06/1.30 % inst_num_moves_active_passive: 0
% 1.06/1.30 % inst_lit_activity: 0
% 1.06/1.30 % inst_lit_activity_moves: 0
% 1.06/1.30 % inst_num_tautologies: 0
% 1.06/1.30 % inst_num_prop_implied: 0
% 1.06/1.30 % inst_num_existing_simplified: 0
% 1.06/1.30 % inst_num_eq_res_simplified: 0
% 1.06/1.30 % inst_num_child_elim: 0
% 1.06/1.30 % inst_num_of_dismatching_blockings: 0
% 1.06/1.30 % inst_num_of_non_proper_insts: 0
% 1.06/1.30 % inst_num_of_duplicates: 0
% 1.06/1.30 % inst_inst_num_from_inst_to_res: 0
% 1.06/1.30 % inst_dismatching_checking_time: 0.
% 1.06/1.30
% 1.06/1.30 % ------ Resolution
% 1.06/1.30
% 1.06/1.30 % res_num_of_clauses: 8429
% 1.06/1.30 % res_num_in_passive: 8681
% 1.06/1.30 % res_num_in_active: 308
% 1.06/1.30 % res_num_of_loops: 552
% 1.06/1.30 % res_forward_subset_subsumed: 819
% 1.06/1.30 % res_backward_subset_subsumed: 631
% 1.06/1.30 % res_forward_subsumed: 141
% 1.06/1.30 % res_backward_subsumed: 56
% 1.06/1.30 % res_forward_subsumption_resolution: 112
% 1.06/1.30 % res_backward_subsumption_resolution: 0
% 1.06/1.30 % res_clause_to_clause_subsumption: 20587
% 1.06/1.30 % res_orphan_elimination: 0
% 1.06/1.30 % res_tautology_del: 234
% 1.06/1.30 % res_num_eq_res_simplified: 0
% 1.06/1.30 % res_num_sel_changes: 0
% 1.06/1.30 % res_moves_from_active_to_pass: 0
% 1.06/1.30
% 1.06/1.31 % Status Unsatisfiable
% 1.06/1.31 % SZS status Unsatisfiable
% 1.06/1.31 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------