TSTP Solution File: ANA004-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : ANA004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n025.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.36s 1.59s
% Output : CNFRefutation 1.36s
% 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(axiom_8,axiom,
minus(add(X,Y)) = add(minus(X),minus(Y)),
input ).
fof(axiom_8_0,plain,
! [X,Y] :
( minus(add(X,Y)) = add(minus(X),minus(Y))
| $false ),
inference(orientation,[status(thm)],[axiom_8]) ).
cnf(axiom_6_1,axiom,
add(X,Y) = add(Y,X),
input ).
fof(axiom_6_1_0,plain,
! [X,Y] :
( add(X,Y) = add(Y,X)
| $false ),
inference(orientation,[status(thm)],[axiom_6_1]) ).
cnf(axiom_5,axiom,
add(add(X,Y),Z) = add(X,add(Y,Z)),
input ).
fof(axiom_5_0,plain,
! [X,Y,Z] :
( add(add(X,Y),Z) = add(X,add(Y,Z))
| $false ),
inference(orientation,[status(thm)],[axiom_5]) ).
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,
add(n0,X) = X,
input ).
fof(left_identity_0,plain,
! [X] :
( add(n0,X) = X
| $false ),
inference(orientation,[status(thm)],[left_identity]) ).
cnf(right_identity,axiom,
add(X,n0) = X,
input ).
fof(right_identity_0,plain,
! [X] :
( add(X,n0) = X
| $false ),
inference(orientation,[status(thm)],[right_identity]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> 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)
<=> 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]) ).
fof(def_lhs_atom4,axiom,
! [Z,Y,X] :
( lhs_atom4(Z,Y,X)
<=> add(add(X,Y),Z) = add(X,add(Y,Z)) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [X,Y,Z] :
( lhs_atom4(Z,Y,X)
| $false ),
inference(fold_definition,[status(thm)],[axiom_5_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [Y,X] :
( lhs_atom5(Y,X)
<=> add(X,Y) = add(Y,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [X,Y] :
( lhs_atom5(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[axiom_6_1_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [Y,X] :
( lhs_atom6(Y,X)
<=> minus(add(X,Y)) = add(minus(X),minus(Y)) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [X,Y] :
( lhs_atom6(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[axiom_8_0,def_lhs_atom6]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X3,X1] :
( lhs_atom4(X2,X3,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_1,axiom,
! [X3,X1] :
( lhs_atom6(X3,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_2,axiom,
! [X3,X1] :
( lhs_atom5(X3,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_3,axiom,
! [X1] :
( lhs_atom3(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_4,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_5,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_6,plain,
! [X2,X3,X1] : lhs_atom4(X2,X3,X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_7,plain,
! [X3,X1] : lhs_atom6(X3,X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_8,plain,
! [X3,X1] : lhs_atom5(X3,X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_9,plain,
! [X1] : lhs_atom3(X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_10,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X4,X5,X6] : lhs_atom4(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X4,X5] : lhs_atom6(X4,X5),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X4,X5] : lhs_atom5(X4,X5),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X2] : lhs_atom3(X2),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
lhs_atom4(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
lhs_atom6(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
lhs_atom5(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
lhs_atom4(X1,X2,X3),
c_0_18,
[final] ).
cnf(c_0_25,plain,
lhs_atom6(X1,X2),
c_0_19,
[final] ).
cnf(c_0_26,plain,
lhs_atom5(X1,X2),
c_0_20,
[final] ).
cnf(c_0_27,plain,
lhs_atom3(X1),
c_0_21,
[final] ).
cnf(c_0_28,plain,
lhs_atom2(X1),
c_0_22,
[final] ).
cnf(c_0_29,plain,
lhs_atom1(X1),
c_0_23,
[final] ).
% End CNF derivation
cnf(c_0_24_0,axiom,
add(add(X3,X2),X1) = add(X3,add(X2,X1)),
inference(unfold_definition,[status(thm)],[c_0_24,def_lhs_atom4]) ).
cnf(c_0_25_0,axiom,
minus(add(X2,X1)) = add(minus(X2),minus(X1)),
inference(unfold_definition,[status(thm)],[c_0_25,def_lhs_atom6]) ).
cnf(c_0_26_0,axiom,
add(X2,X1) = add(X1,X2),
inference(unfold_definition,[status(thm)],[c_0_26,def_lhs_atom5]) ).
cnf(c_0_27_0,axiom,
~ less_than(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_27,def_lhs_atom3]) ).
cnf(c_0_28_0,axiom,
add(n0,X1) = X1,
inference(unfold_definition,[status(thm)],[c_0_28,def_lhs_atom2]) ).
cnf(c_0_29_0,axiom,
add(X1,n0) = X1,
inference(unfold_definition,[status(thm)],[c_0_29,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_6_2) ).
fof(c_0_7_008,axiom,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
file('<stdin>',axiom_7) ).
fof(c_0_8_009,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_9_010,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_10_011,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_11_012,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_12_013,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_13_014,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_14_015,plain,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_15_016,plain,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_16_017,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_8]) ).
fof(c_0_17_018,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_9]) ).
fof(c_0_18_019,plain,
! [X4,X5] :
( ~ less_than(n0,X5)
| ~ less_than(n0,X4)
| less_than(minimum(X5,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_19_020,plain,
! [X4,X5] :
( ~ less_than(n0,X5)
| ~ less_than(n0,X4)
| less_than(minimum(X5,X4),X4) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_20_021,plain,
! [X4,X5] :
( ~ less_than(n0,X5)
| ~ less_than(n0,X4)
| less_than(n0,minimum(X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_21_022,plain,
! [X5,X6,X7] :
( ~ less_than(X7,X6)
| ~ less_than(X6,X5)
| less_than(X7,X5) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_22_023,plain,
! [X2] :
( ~ less_than(n0,X2)
| less_than(n0,half(X2)) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_23_024,plain,
! [X2] :
( ~ less_than(n0,X2)
| less_than(n0,half(X2)) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
cnf(c_0_24_025,plain,
( less_than(absolute(add(X1,X2)),X3)
| ~ less_than(add(absolute(X1),absolute(X2)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25_026,plain,
( less_than(add(X1,X2),X3)
| ~ less_than(X2,half(X3))
| ~ less_than(X1,half(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26_027,plain,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27_028,plain,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28_029,plain,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29_030,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( less_than(absolute(add(X1,X2)),X3)
| ~ less_than(add(absolute(X1),absolute(X2)),X3) ),
c_0_24,
[final] ).
cnf(c_0_33,plain,
( less_than(add(X1,X2),X3)
| ~ less_than(X2,half(X3))
| ~ less_than(X1,half(X3)) ),
c_0_25,
[final] ).
cnf(c_0_34,plain,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
c_0_26,
[final] ).
cnf(c_0_35,plain,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
c_0_27,
[final] ).
cnf(c_0_36,plain,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
c_0_28,
[final] ).
cnf(c_0_37,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
c_0_29,
[final] ).
cnf(c_0_38,plain,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
c_0_30,
[final] ).
cnf(c_0_39,plain,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
c_0_31,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_32_0,axiom,
( less_than(absolute(add(X1,X2)),X3)
| ~ less_than(add(absolute(X1),absolute(X2)),X3) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( ~ less_than(add(absolute(X1),absolute(X2)),X3)
| less_than(absolute(add(X1,X2)),X3) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_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_33]) ).
cnf(c_0_33_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_33]) ).
cnf(c_0_33_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_33]) ).
cnf(c_0_34_0,axiom,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( ~ less_than(n0,X2)
| less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_2,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| less_than(minimum(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_35_0,axiom,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_1,axiom,
( ~ less_than(n0,X2)
| less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_2,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| less_than(minimum(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_36_0,axiom,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_1,axiom,
( ~ less_than(n0,X2)
| less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_2,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| less_than(n0,minimum(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_37_0,axiom,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_1,axiom,
( ~ less_than(X3,X2)
| less_than(X1,X2)
| ~ less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_2,axiom,
( ~ less_than(X1,X3)
| ~ less_than(X3,X2)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_38_0,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_1,axiom,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_39_0,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_1,axiom,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_031,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(add(f(fp33(X1)),minus(l1)),add(g(fp33(X1)),minus(l2)))),b) ),
file('<stdin>',c_16) ).
fof(c_0_1_032,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_033,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_034,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
file('<stdin>',c_15) ).
fof(c_0_4_035,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
file('<stdin>',c_12) ).
fof(c_0_5_036,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
file('<stdin>',c_10) ).
fof(c_0_6_037,negated_conjecture,
less_than(n0,b),
file('<stdin>',c_14) ).
fof(c_0_7_038,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(add(f(fp33(X1)),minus(l1)),add(g(fp33(X1)),minus(l2)))),b) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8_039,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_040,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_041,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_042,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_12_043,negated_conjecture,
! [X1] :
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_13_044,negated_conjecture,
less_than(n0,b),
c_0_6 ).
fof(c_0_14_045,negated_conjecture,
! [X2] :
( ~ less_than(n0,X2)
| ~ less_than(absolute(add(add(f(fp33(X2)),minus(l1)),add(g(fp33(X2)),minus(l2)))),b) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15_046,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_047,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_048,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_049,negated_conjecture,
! [X2] :
( ~ less_than(n0,X2)
| less_than(n0,fp32(X2)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19_050,negated_conjecture,
! [X2] :
( ~ less_than(n0,X2)
| less_than(n0,fp31(X2)) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20_051,negated_conjecture,
less_than(n0,b),
c_0_13 ).
cnf(c_0_21_052,negated_conjecture,
( ~ less_than(absolute(add(add(f(fp33(X1)),minus(l1)),add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22_053,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_054,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_055,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_056,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26_057,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27_058,negated_conjecture,
less_than(n0,b),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28_059,negated_conjecture,
( ~ less_than(absolute(add(add(f(fp33(X1)),minus(l1)),add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
c_0_21,
[final] ).
cnf(c_0_29_060,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_061,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_062,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
c_0_24,
[final] ).
cnf(c_0_32_063,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
c_0_25,
[final] ).
cnf(c_0_33_064,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
c_0_26,
[final] ).
cnf(c_0_34_065,negated_conjecture,
less_than(n0,b),
c_0_27,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_29,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_bf6d57.p',c_0_30) ).
cnf(c_51,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_29]) ).
cnf(c_77,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_51]) ).
cnf(c_86,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_77]) ).
cnf(c_91,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_86]) ).
cnf(c_184,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_91]) ).
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_bf6d57.p',c_0_33_2) ).
cnf(c_138,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_272,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_184,c_138]) ).
cnf(c_273,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_272]) ).
cnf(c_27,negated_conjecture,
( ~ less_than(absolute(add(add(f(fp33(X0)),minus(l1)),add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p',c_0_28) ).
cnf(c_47,negated_conjecture,
( ~ less_than(absolute(add(add(f(fp33(X0)),minus(l1)),add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_75,negated_conjecture,
( ~ less_than(absolute(add(add(f(fp33(X0)),minus(l1)),add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_88,negated_conjecture,
( ~ less_than(absolute(add(add(f(fp33(X0)),minus(l1)),add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_89,negated_conjecture,
( ~ less_than(absolute(add(add(f(fp33(X0)),minus(l1)),add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_180,negated_conjecture,
( ~ less_than(absolute(add(add(f(fp33(X0)),minus(l1)),add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_0,plain,
( ~ less_than(add(absolute(X0),absolute(X1)),X2)
| less_than(absolute(add(X0,X1)),X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p',c_0_32_0) ).
cnf(c_130,plain,
( ~ less_than(add(absolute(X0),absolute(X1)),X2)
| less_than(absolute(add(X0,X1)),X2) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_248,plain,
( ~ less_than(add(absolute(add(f(fp33(X0)),minus(l1))),absolute(add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(resolution,[status(thm)],[c_180,c_130]) ).
cnf(c_249,plain,
( ~ less_than(add(absolute(add(f(fp33(X0)),minus(l1))),absolute(add(g(fp33(X0)),minus(l2)))),b)
| ~ less_than(n0,X0) ),
inference(rewriting,[status(thm)],[c_248]) ).
cnf(c_860,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_273,c_249]) ).
cnf(c_861,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_860]) ).
cnf(c_28,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_bf6d57.p',c_0_29) ).
cnf(c_49,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_28]) ).
cnf(c_76,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_49]) ).
cnf(c_87,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_76]) ).
cnf(c_90,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_87]) ).
cnf(c_182,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_90]) ).
cnf(c_19625,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_861,c_182]) ).
cnf(c_19626,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_19625]) ).
cnf(c_30,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p',c_0_31) ).
cnf(c_53,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_78,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_85,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_92,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_186,negated_conjecture,
( less_than(absolute(add(fp33(X0),minus(a))),X0)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_92]) ).
cnf(c_16,plain,
( less_than(X0,X1)
| ~ less_than(X2,X1)
| ~ less_than(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p',c_0_37_2) ).
cnf(c_162,plain,
( less_than(X0,X1)
| ~ less_than(X2,X1)
| ~ less_than(X0,X2) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_240,plain,
( less_than(absolute(add(fp33(X0),minus(a))),X1)
| ~ less_than(n0,X0)
| ~ less_than(X0,X1) ),
inference(resolution,[status(thm)],[c_186,c_162]) ).
cnf(c_241,plain,
( less_than(absolute(add(fp33(X0),minus(a))),X1)
| ~ less_than(n0,X0)
| ~ less_than(X0,X1) ),
inference(rewriting,[status(thm)],[c_240]) ).
cnf(c_19688,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_19626,c_241]) ).
cnf(c_19689,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_19688]) ).
cnf(c_19943,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_19689,c_241]) ).
cnf(c_19944,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_19943]) ).
cnf(c_32,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p',c_0_33) ).
cnf(c_57,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_80,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_83,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_94,negated_conjecture,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_190,plain,
( less_than(n0,fp31(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_94]) ).
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_bf6d57.p',c_0_34_2) ).
cnf(c_144,plain,
( less_than(minimum(X0,X1),X0)
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_226,plain,
( less_than(minimum(fp31(X0),X1),fp31(X0))
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(resolution,[status(thm)],[c_190,c_144]) ).
cnf(c_227,plain,
( less_than(minimum(fp31(X0),X1),fp31(X0))
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(rewriting,[status(thm)],[c_226]) ).
cnf(c_20017,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_19944,c_227]) ).
cnf(c_20018,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_20017]) ).
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_bf6d57.p',c_0_36_2) ).
cnf(c_156,plain,
( less_than(n0,minimum(X0,X1))
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_224,plain,
( less_than(n0,minimum(fp31(X0),X1))
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(resolution,[status(thm)],[c_190,c_156]) ).
cnf(c_229,plain,
( less_than(n0,minimum(fp31(X0),X1))
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(rewriting,[status(thm)],[c_224]) ).
cnf(c_24943,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_20018,c_229]) ).
cnf(c_24944,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_24943]) ).
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_bf6d57.p',c_0_35_2) ).
cnf(c_150,plain,
( less_than(minimum(X0,X1),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_225,plain,
( less_than(minimum(fp31(X0),X1),X1)
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(resolution,[status(thm)],[c_190,c_150]) ).
cnf(c_228,plain,
( less_than(minimum(fp31(X0),X1),X1)
| ~ less_than(n0,X0)
| ~ less_than(n0,X1) ),
inference(rewriting,[status(thm)],[c_225]) ).
cnf(c_24954,plain,
( ~ less_than(n0,half(b))
| ~ less_than(n0,fp32(half(b))) ),
inference(resolution,[status(thm)],[c_24944,c_228]) ).
cnf(c_24955,plain,
( ~ less_than(n0,half(b))
| ~ less_than(n0,fp32(half(b))) ),
inference(rewriting,[status(thm)],[c_24954]) ).
cnf(c_31,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p',c_0_32) ).
cnf(c_55,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_79,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_84,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_93,negated_conjecture,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_188,plain,
( less_than(n0,fp32(X0))
| ~ less_than(n0,X0) ),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_24974,plain,
~ less_than(n0,half(b)),
inference(forward_subsumption_resolution,[status(thm)],[c_24955,c_188]) ).
cnf(c_24975,plain,
~ less_than(n0,half(b)),
inference(rewriting,[status(thm)],[c_24974]) ).
cnf(c_17,plain,
( ~ less_than(n0,X0)
| less_than(n0,half(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p',c_0_38_0) ).
cnf(c_164,plain,
( ~ less_than(n0,X0)
| less_than(n0,half(X0)) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_165,plain,
( less_than(n0,half(X0))
| ~ less_than(n0,X0) ),
inference(rewriting,[status(thm)],[c_164]) ).
cnf(c_24979,plain,
~ less_than(n0,b),
inference(resolution,[status(thm)],[c_24975,c_165]) ).
cnf(c_24980,plain,
~ less_than(n0,b),
inference(rewriting,[status(thm)],[c_24979]) ).
cnf(c_33,negated_conjecture,
less_than(n0,b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p',c_0_34) ).
cnf(c_59,negated_conjecture,
less_than(n0,b),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_81,negated_conjecture,
less_than(n0,b),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_82,negated_conjecture,
less_than(n0,b),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_95,negated_conjecture,
less_than(n0,b),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_192,plain,
less_than(n0,b),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_25816,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_24980,c_192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n025.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 06:22:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % Orientation found
% 0.20/0.41 % 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_04b955.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_bf6d57.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_dc7562 | 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.40/0.63 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.63 % --bmc1_dump_file -
% 0.40/0.63 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.63 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.63 % --bmc1_ucm_extend_mode 1
% 0.40/0.63 % --bmc1_ucm_init_mode 2
% 0.40/0.63 % --bmc1_ucm_cone_mode none
% 0.40/0.63 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.63 % --bmc1_ucm_relax_model 4
% 0.40/0.63 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.63 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.63 % --bmc1_ucm_layered_model none
% 0.40/0.63 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.63
% 0.40/0.63 % ------ AIG Options
% 0.40/0.63
% 0.40/0.63 % --aig_mode false
% 0.40/0.63
% 0.40/0.63 % ------ Instantiation Options
% 0.40/0.63
% 0.40/0.63 % --instantiation_flag true
% 0.40/0.63 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.63 % --inst_solver_per_active 750
% 0.40/0.63 % --inst_solver_calls_frac 0.5
% 0.40/0.63 % --inst_passive_queue_type priority_queues
% 0.40/0.63 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.63 % --inst_passive_queues_freq [25;2]
% 0.40/0.63 % --inst_dismatching true
% 0.40/0.63 % --inst_eager_unprocessed_to_passive true
% 0.40/0.63 % --inst_prop_sim_given true
% 0.40/0.63 % --inst_prop_sim_new false
% 0.40/0.63 % --inst_orphan_elimination true
% 0.40/0.63 % --inst_learning_loop_flag true
% 0.40/0.63 % --inst_learning_start 3000
% 0.40/0.63 % --inst_learning_factor 2
% 0.40/0.63 % --inst_start_prop_sim_after_learn 3
% 0.40/0.63 % --inst_sel_renew solver
% 0.40/0.63 % --inst_lit_activity_flag true
% 0.40/0.63 % --inst_out_proof true
% 0.40/0.63
% 0.40/0.63 % ------ Resolution Options
% 0.40/0.63
% 0.40/0.63 % --resolution_flag true
% 0.40/0.63 % --res_lit_sel kbo_max
% 0.40/0.63 % --res_to_prop_solver none
% 0.40/0.63 % --res_prop_simpl_new false
% 0.40/0.63 % --res_prop_simpl_given false
% 0.40/0.63 % --res_passive_queue_type priority_queues
% 0.40/0.63 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.40/0.63 % --res_passive_queues_freq [15;5]
% 0.40/0.63 % --res_forward_subs full
% 0.40/0.63 % --res_backward_subs full
% 0.40/0.63 % --res_forward_subs_resolution true
% 0.40/0.63 % --res_backward_subs_resolution true
% 0.40/0.63 % --res_orphan_elimination false
% 0.40/0.63 % --res_time_limit 1000.
% 0.40/0.63 % --res_out_proof true
% 0.40/0.63 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_04b955.s
% 0.40/0.63 % --modulo true
% 0.40/0.63
% 0.40/0.63 % ------ Combination Options
% 0.40/0.63
% 0.40/0.63 % --comb_res_mult 1000
% 0.40/0.63 % --comb_inst_mult 300
% 0.40/0.63 % ------
% 0.40/0.63
% 0.40/0.63 % ------ Parsing...% successful
% 0.40/0.63
% 0.40/0.63 % ------ 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.40/0.63
% 0.40/0.63 % ------ Proving...
% 0.40/0.63 % ------ Problem Properties
% 0.40/0.63
% 0.40/0.63 %
% 0.40/0.63 % EPR false
% 0.40/0.63 % Horn true
% 0.40/0.63 % Has equality true
% 0.40/0.63
% 0.40/0.63 % % ------ Input Options Time Limit: Unbounded
% 0.40/0.63
% 0.40/0.63
% 0.40/0.63 Compiling...
% 0.40/0.63 Loading plugin: done.
% 0.40/0.63 Compiling...
% 0.40/0.63 Loading plugin: done.
% 0.40/0.63 % % ------ Current options:
% 0.40/0.63
% 0.40/0.63 % ------ Input Options
% 0.40/0.63
% 0.40/0.63 % --out_options all
% 0.40/0.63 % --tptp_safe_out true
% 0.40/0.63 % --problem_path ""
% 0.40/0.63 % --include_path ""
% 0.40/0.63 % --clausifier .//eprover
% 0.40/0.63 % --clausifier_options --tstp-format
% 0.40/0.63 % --stdin false
% 0.40/0.63 % --dbg_backtrace false
% 0.40/0.63 % --dbg_dump_prop_clauses false
% 0.40/0.63 % --dbg_dump_prop_clauses_file -
% 0.40/0.63 % --dbg_out_stat false
% 0.40/0.63
% 0.40/0.63 % ------ General Options
% 0.40/0.63
% 0.40/0.63 % --fof false
% 0.40/0.63 % --time_out_real 150.
% 0.40/0.63 % --time_out_prep_mult 0.2
% 0.40/0.63 % --time_out_virtual -1.
% 0.40/0.63 % --schedule none
% 0.40/0.63 % --ground_splitting input
% 0.40/0.63 % --splitting_nvd 16
% 0.40/0.63 % --non_eq_to_eq false
% 0.40/0.63 % --prep_gs_sim true
% 0.40/0.63 % --prep_unflatten false
% 0.40/0.63 % --prep_res_sim true
% 0.40/0.63 % --prep_upred true
% 0.40/0.63 % --res_sim_input true
% 0.40/0.63 % --clause_weak_htbl true
% 0.40/0.63 % --gc_record_bc_elim false
% 0.40/0.63 % --symbol_type_check false
% 0.40/0.63 % --clausify_out false
% 0.40/0.63 % --large_theory_mode false
% 0.40/0.63 % --prep_sem_filter none
% 0.40/0.63 % --prep_sem_filter_out false
% 0.40/0.63 % --preprocessed_out false
% 0.40/0.63 % --sub_typing false
% 0.40/0.63 % --brand_transform false
% 0.40/0.63 % --pure_diseq_elim true
% 0.40/0.63 % --min_unsat_core false
% 0.40/0.63 % --pred_elim true
% 0.40/0.63 % --add_important_lit false
% 0.40/0.63 % --soft_assumptions false
% 0.40/0.63 % --reset_solvers false
% 0.40/0.63 % --bc_imp_inh []
% 0.40/0.63 % --conj_cone_tolerance 1.5
% 0.40/0.63 % --prolific_symb_bound 500
% 0.40/0.63 % --lt_threshold 2000
% 0.40/0.63
% 0.40/0.63 % ------ SAT Options
% 0.40/0.63
% 0.40/0.63 % --sat_mode false
% 0.40/0.63 % --sat_fm_restart_options ""
% 0.40/0.63 % --sat_gr_def false
% 0.40/0.63 % --sat_epr_types true
% 0.40/0.63 % --sat_non_cyclic_types false
% 0.40/0.63 % --sat_finite_models false
% 0.40/0.63 % --sat_fm_lemmas false
% 0.40/0.63 % --sat_fm_prep false
% 0.40/0.63 % --sat_fm_uc_incr true
% 0.40/0.63 % --sat_out_model small
% 0.40/0.63 % --sat_out_clauses false
% 0.40/0.63
% 0.40/0.63 % ------ QBF Options
% 0.40/0.63
% 0.40/0.63 % --qbf_mode false
% 0.40/0.63 % --qbf_elim_univ true
% 0.40/0.63 % --qbf_sk_in true
% 0.40/0.63 % --qbf_pred_elim true
% 0.40/0.63 % --qbf_split 32
% 0.40/0.63
% 0.40/0.63 % ------ BMC1 Options
% 0.40/0.63
% 0.40/0.63 % --bmc1_incremental false
% 0.40/0.63 % --bmc1_axioms reachable_all
% 0.40/0.63 % --bmc1_min_bound 0
% 0.40/0.63 % --bmc1_max_bound -1
% 0.40/0.63 % --bmc1_max_bound_default -1
% 0.40/0.63 % --bmc1_symbol_reachability true
% 0.40/0.63 % --bmc1_property_lemmas false
% 0.40/0.63 % --bmc1_k_induction false
% 0.40/0.63 % --bmc1_non_equiv_states false
% 0.40/0.63 % --bmc1_deadlock false
% 0.40/0.63 % --bmc1_ucm false
% 0.40/0.63 % --bmc1_add_unsat_core none
% 0.40/0.63 % --bmc1_unsat_core_children false
% 0.40/0.63 % --bmc1_unsat_core_extrapolate_axioms false
% 0.40/0.63 % --bmc1_out_stat full
% 0.40/0.63 % --bmc1_ground_init false
% 0.40/0.63 % --bmc1_pre_inst_next_state false
% 0.40/0.63 % --bmc1_pre_inst_state false
% 0.40/0.63 % --bmc1_pre_inst_reach_state false
% 0.40/0.63 % --bmc1_out_unsat_core false
% 0.40/0.63 % --bmc1_aig_witness_out false
% 0.40/0.63 % --bmc1_verbose false
% 0.40/0.63 % --bmc1_dump_clauses_tptp false
% 0.40/0.63 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.63 % --bmc1_dump_file -
% 0.40/0.63 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.63 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.63 % --bmc1_ucm_extend_mode 1
% 0.40/0.63 % --bmc1_ucm_init_mode 2
% 0.40/0.63 % --bmc1_ucm_cone_mode none
% 0.40/0.63 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.63 % --bmc1_ucm_relax_model 4
% 0.40/0.63 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.63 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.63 % --bmc1_ucm_layered_model none
% 0.40/0.63 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.63
% 0.40/0.63 % ------ AIG Options
% 0.40/0.63
% 0.40/0.63 % --aig_mode false
% 0.40/0.63
% 0.40/0.63 % ------ Instantiation Options
% 0.40/0.63
% 0.40/0.63 % --instantiation_flag true
% 0.40/0.63 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.63 % --inst_solver_per_active 750
% 0.40/0.63 % --inst_solver_calls_frac 0.5
% 0.40/0.63 % --inst_passive_queue_type priority_queues
% 0.40/0.63 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.63 % --inst_passive_queues_freq [25;2]
% 0.40/0.63 % --inst_dismatching true
% 1.36/1.59 % --inst_eager_unprocessed_to_passive true
% 1.36/1.59 % --inst_prop_sim_given true
% 1.36/1.59 % --inst_prop_sim_new false
% 1.36/1.59 % --inst_orphan_elimination true
% 1.36/1.59 % --inst_learning_loop_flag true
% 1.36/1.59 % --inst_learning_start 3000
% 1.36/1.59 % --inst_learning_factor 2
% 1.36/1.59 % --inst_start_prop_sim_after_learn 3
% 1.36/1.59 % --inst_sel_renew solver
% 1.36/1.59 % --inst_lit_activity_flag true
% 1.36/1.59 % --inst_out_proof true
% 1.36/1.59
% 1.36/1.59 % ------ Resolution Options
% 1.36/1.59
% 1.36/1.59 % --resolution_flag true
% 1.36/1.59 % --res_lit_sel kbo_max
% 1.36/1.59 % --res_to_prop_solver none
% 1.36/1.59 % --res_prop_simpl_new false
% 1.36/1.59 % --res_prop_simpl_given false
% 1.36/1.59 % --res_passive_queue_type priority_queues
% 1.36/1.59 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.36/1.59 % --res_passive_queues_freq [15;5]
% 1.36/1.59 % --res_forward_subs full
% 1.36/1.59 % --res_backward_subs full
% 1.36/1.59 % --res_forward_subs_resolution true
% 1.36/1.59 % --res_backward_subs_resolution true
% 1.36/1.59 % --res_orphan_elimination false
% 1.36/1.59 % --res_time_limit 1000.
% 1.36/1.59 % --res_out_proof true
% 1.36/1.59 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_04b955.s
% 1.36/1.59 % --modulo true
% 1.36/1.59
% 1.36/1.59 % ------ Combination Options
% 1.36/1.59
% 1.36/1.59 % --comb_res_mult 1000
% 1.36/1.59 % --comb_inst_mult 300
% 1.36/1.59 % ------
% 1.36/1.59
% 1.36/1.59
% 1.36/1.59
% 1.36/1.59 % ------ Proving...
% 1.36/1.59 %
% 1.36/1.59
% 1.36/1.59
% 1.36/1.59 % Resolution empty clause
% 1.36/1.59
% 1.36/1.59 % ------ Statistics
% 1.36/1.59
% 1.36/1.59 % ------ General
% 1.36/1.59
% 1.36/1.59 % num_of_input_clauses: 34
% 1.36/1.59 % num_of_input_neg_conjectures: 7
% 1.36/1.59 % num_of_splits: 0
% 1.36/1.59 % num_of_split_atoms: 0
% 1.36/1.59 % num_of_sem_filtered_clauses: 0
% 1.36/1.59 % num_of_subtypes: 0
% 1.36/1.59 % monotx_restored_types: 0
% 1.36/1.59 % sat_num_of_epr_types: 0
% 1.36/1.59 % sat_num_of_non_cyclic_types: 0
% 1.36/1.59 % sat_guarded_non_collapsed_types: 0
% 1.36/1.59 % is_epr: 0
% 1.36/1.59 % is_horn: 1
% 1.36/1.59 % has_eq: 1
% 1.36/1.59 % num_pure_diseq_elim: 0
% 1.36/1.59 % simp_replaced_by: 0
% 1.36/1.59 % res_preprocessed: 14
% 1.36/1.59 % prep_upred: 0
% 1.36/1.59 % prep_unflattend: 0
% 1.36/1.59 % pred_elim_cands: 0
% 1.36/1.59 % pred_elim: 0
% 1.36/1.59 % pred_elim_cl: 0
% 1.36/1.59 % pred_elim_cycles: 0
% 1.36/1.59 % forced_gc_time: 0
% 1.36/1.59 % gc_basic_clause_elim: 0
% 1.36/1.59 % parsing_time: 0.001
% 1.36/1.59 % sem_filter_time: 0.
% 1.36/1.59 % pred_elim_time: 0.
% 1.36/1.59 % out_proof_time: 0.001
% 1.36/1.59 % monotx_time: 0.
% 1.36/1.59 % subtype_inf_time: 0.
% 1.36/1.59 % unif_index_cands_time: 0.004
% 1.36/1.59 % unif_index_add_time: 0.001
% 1.36/1.59 % total_time: 1.171
% 1.36/1.59 % num_of_symbols: 41
% 1.36/1.59 % num_of_terms: 26596
% 1.36/1.59
% 1.36/1.59 % ------ Propositional Solver
% 1.36/1.59
% 1.36/1.59 % prop_solver_calls: 1
% 1.36/1.59 % prop_fast_solver_calls: 45
% 1.36/1.59 % prop_num_of_clauses: 35
% 1.36/1.59 % prop_preprocess_simplified: 203
% 1.36/1.59 % prop_fo_subsumed: 0
% 1.36/1.59 % prop_solver_time: 0.
% 1.36/1.59 % prop_fast_solver_time: 0.
% 1.36/1.59 % prop_unsat_core_time: 0.
% 1.36/1.59
% 1.36/1.59 % ------ QBF
% 1.36/1.59
% 1.36/1.59 % qbf_q_res: 0
% 1.36/1.59 % qbf_num_tautologies: 0
% 1.36/1.59 % qbf_prep_cycles: 0
% 1.36/1.59
% 1.36/1.59 % ------ BMC1
% 1.36/1.59
% 1.36/1.59 % bmc1_current_bound: -1
% 1.36/1.59 % bmc1_last_solved_bound: -1
% 1.36/1.59 % bmc1_unsat_core_size: -1
% 1.36/1.59 % bmc1_unsat_core_parents_size: -1
% 1.36/1.59 % bmc1_merge_next_fun: 0
% 1.36/1.59 % bmc1_unsat_core_clauses_time: 0.
% 1.36/1.59
% 1.36/1.59 % ------ Instantiation
% 1.36/1.59
% 1.36/1.59 % inst_num_of_clauses: 32
% 1.36/1.59 % inst_num_in_passive: 0
% 1.36/1.59 % inst_num_in_active: 0
% 1.36/1.59 % inst_num_in_unprocessed: 34
% 1.36/1.59 % inst_num_of_loops: 0
% 1.36/1.59 % inst_num_of_learning_restarts: 0
% 1.36/1.59 % inst_num_moves_active_passive: 0
% 1.36/1.59 % inst_lit_activity: 0
% 1.36/1.59 % inst_lit_activity_moves: 0
% 1.36/1.59 % inst_num_tautologies: 0
% 1.36/1.59 % inst_num_prop_implied: 0
% 1.36/1.59 % inst_num_existing_simplified: 0
% 1.36/1.59 % inst_num_eq_res_simplified: 0
% 1.36/1.59 % inst_num_child_elim: 0
% 1.36/1.59 % inst_num_of_dismatching_blockings: 0
% 1.36/1.59 % inst_num_of_non_proper_insts: 0
% 1.36/1.59 % inst_num_of_duplicates: 0
% 1.36/1.59 % inst_inst_num_from_inst_to_res: 0
% 1.36/1.59 % inst_dismatching_checking_time: 0.
% 1.36/1.59
% 1.36/1.59 % ------ Resolution
% 1.36/1.59
% 1.36/1.59 % res_num_of_clauses: 9238
% 1.36/1.59 % res_num_in_passive: 9426
% 1.36/1.59 % res_num_in_active: 322
% 1.36/1.59 % res_num_of_loops: 554
% 1.36/1.59 % res_forward_subset_subsumed: 841
% 1.36/1.59 % res_backward_subset_subsumed: 580
% 1.36/1.59 % res_forward_subsumed: 134
% 1.36/1.59 % res_backward_subsumed: 53
% 1.36/1.59 % res_forward_subsumption_resolution: 115
% 1.36/1.59 % res_backward_subsumption_resolution: 0
% 1.36/1.59 % res_clause_to_clause_subsumption: 20546
% 1.36/1.59 % res_orphan_elimination: 0
% 1.36/1.59 % res_tautology_del: 262
% 1.36/1.59 % res_num_eq_res_simplified: 0
% 1.36/1.59 % res_num_sel_changes: 0
% 1.36/1.59 % res_moves_from_active_to_pass: 0
% 1.36/1.59
% 1.36/1.59 % Status Unsatisfiable
% 1.36/1.59 % SZS status Unsatisfiable
% 1.36/1.59 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------