TSTP Solution File: NUM002-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NUM002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n010.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 : Mon Jul 18 10:53:43 EDT 2022
% Result : Unsatisfiable 101.30s 101.52s
% Output : CNFRefutation 101.30s
% 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(commutativity2,axiom,
equalish(subtract(add(A,B),C),add(subtract(A,C),B)),
input ).
fof(commutativity2_0,plain,
! [A,B,C] :
( equalish(subtract(add(A,B),C),add(subtract(A,C),B))
| $false ),
inference(orientation,[status(thm)],[commutativity2]) ).
cnf(commutativity1,axiom,
equalish(add(subtract(A,B),C),subtract(add(A,C),B)),
input ).
fof(commutativity1_0,plain,
! [A,B,C] :
( equalish(add(subtract(A,B),C),subtract(add(A,C),B))
| $false ),
inference(orientation,[status(thm)],[commutativity1]) ).
cnf(addition_inverts_subtraction2,axiom,
equalish(A,subtract(add(A,B),B)),
input ).
fof(addition_inverts_subtraction2_0,plain,
! [A,B] :
( equalish(A,subtract(add(A,B),B))
| $false ),
inference(orientation,[status(thm)],[addition_inverts_subtraction2]) ).
cnf(addition_inverts_subtraction1,axiom,
equalish(subtract(add(A,B),B),A),
input ).
fof(addition_inverts_subtraction1_0,plain,
! [A,B] :
( equalish(subtract(add(A,B),B),A)
| $false ),
inference(orientation,[status(thm)],[addition_inverts_subtraction1]) ).
cnf(associativity_of_addition,axiom,
equalish(add(A,add(B,C)),add(add(A,B),C)),
input ).
fof(associativity_of_addition_0,plain,
! [A,B,C] :
( equalish(add(A,add(B,C)),add(add(A,B),C))
| $false ),
inference(orientation,[status(thm)],[associativity_of_addition]) ).
cnf(commutativity_of_addition,axiom,
equalish(add(A,B),add(B,A)),
input ).
fof(commutativity_of_addition_0,plain,
! [A,B] :
( equalish(add(A,B),add(B,A))
| $false ),
inference(orientation,[status(thm)],[commutativity_of_addition]) ).
cnf(reflexivity,axiom,
equalish(A,A),
input ).
fof(reflexivity_0,plain,
! [A] :
( equalish(A,A)
| $false ),
inference(orientation,[status(thm)],[reflexivity]) ).
fof(def_lhs_atom1,axiom,
! [A] :
( lhs_atom1(A)
<=> equalish(A,A) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [A] :
( lhs_atom1(A)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [B,A] :
( lhs_atom2(B,A)
<=> equalish(add(A,B),add(B,A)) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [A,B] :
( lhs_atom2(B,A)
| $false ),
inference(fold_definition,[status(thm)],[commutativity_of_addition_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [C,B,A] :
( lhs_atom3(C,B,A)
<=> equalish(add(A,add(B,C)),add(add(A,B),C)) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [A,B,C] :
( lhs_atom3(C,B,A)
| $false ),
inference(fold_definition,[status(thm)],[associativity_of_addition_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [B,A] :
( lhs_atom4(B,A)
<=> equalish(subtract(add(A,B),B),A) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [A,B] :
( lhs_atom4(B,A)
| $false ),
inference(fold_definition,[status(thm)],[addition_inverts_subtraction1_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [B,A] :
( lhs_atom5(B,A)
<=> equalish(A,subtract(add(A,B),B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [A,B] :
( lhs_atom5(B,A)
| $false ),
inference(fold_definition,[status(thm)],[addition_inverts_subtraction2_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [C,B,A] :
( lhs_atom6(C,B,A)
<=> equalish(add(subtract(A,B),C),subtract(add(A,C),B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [A,B,C] :
( lhs_atom6(C,B,A)
| $false ),
inference(fold_definition,[status(thm)],[commutativity1_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [C,B,A] :
( lhs_atom7(C,B,A)
<=> equalish(subtract(add(A,B),C),add(subtract(A,C),B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [A,B,C] :
( lhs_atom7(C,B,A)
| $false ),
inference(fold_definition,[status(thm)],[commutativity2_0,def_lhs_atom7]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X2,X1] :
( lhs_atom7(X3,X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_1,axiom,
! [X3,X2,X1] :
( lhs_atom6(X3,X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_2,axiom,
! [X3,X2,X1] :
( lhs_atom3(X3,X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_3,axiom,
! [X2,X1] :
( lhs_atom5(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_4,axiom,
! [X2,X1] :
( lhs_atom4(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_5,axiom,
! [X2,X1] :
( lhs_atom2(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_6,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_7,plain,
! [X3,X2,X1] : lhs_atom7(X3,X2,X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8,plain,
! [X3,X2,X1] : lhs_atom6(X3,X2,X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_9,plain,
! [X3,X2,X1] : lhs_atom3(X3,X2,X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10,plain,
! [X2,X1] : lhs_atom5(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_11,plain,
! [X2,X1] : lhs_atom4(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_12,plain,
! [X2,X1] : lhs_atom2(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X4,X5,X6] : lhs_atom7(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X4,X5,X6] : lhs_atom6(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X4,X5,X6] : lhs_atom3(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X3,X4] : lhs_atom5(X3,X4),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X3,X4] : lhs_atom4(X3,X4),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X3,X4] : lhs_atom2(X3,X4),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
lhs_atom7(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
lhs_atom6(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
lhs_atom3(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
lhs_atom5(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
lhs_atom4(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
lhs_atom2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
lhs_atom7(X1,X2,X3),
c_0_21,
[final] ).
cnf(c_0_29,plain,
lhs_atom6(X1,X2,X3),
c_0_22,
[final] ).
cnf(c_0_30,plain,
lhs_atom3(X1,X2,X3),
c_0_23,
[final] ).
cnf(c_0_31,plain,
lhs_atom5(X1,X2),
c_0_24,
[final] ).
cnf(c_0_32,plain,
lhs_atom4(X1,X2),
c_0_25,
[final] ).
cnf(c_0_33,plain,
lhs_atom2(X1,X2),
c_0_26,
[final] ).
cnf(c_0_34,plain,
lhs_atom1(X1),
c_0_27,
[final] ).
% End CNF derivation
cnf(c_0_28_0,axiom,
equalish(subtract(add(X3,X2),X1),add(subtract(X3,X1),X2)),
inference(unfold_definition,[status(thm)],[c_0_28,def_lhs_atom7]) ).
cnf(c_0_29_0,axiom,
equalish(add(subtract(X3,X2),X1),subtract(add(X3,X1),X2)),
inference(unfold_definition,[status(thm)],[c_0_29,def_lhs_atom6]) ).
cnf(c_0_30_0,axiom,
equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1)),
inference(unfold_definition,[status(thm)],[c_0_30,def_lhs_atom3]) ).
cnf(c_0_31_0,axiom,
equalish(X2,subtract(add(X2,X1),X1)),
inference(unfold_definition,[status(thm)],[c_0_31,def_lhs_atom5]) ).
cnf(c_0_32_0,axiom,
equalish(subtract(add(X2,X1),X1),X2),
inference(unfold_definition,[status(thm)],[c_0_32,def_lhs_atom4]) ).
cnf(c_0_33_0,axiom,
equalish(add(X2,X1),add(X1,X2)),
inference(unfold_definition,[status(thm)],[c_0_33,def_lhs_atom2]) ).
cnf(c_0_34_0,axiom,
equalish(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_34,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X2,add(X4,X1))
| equalish(X2,add(X3,X1)) ),
file('<stdin>',add_substitution1) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X2,add(X1,X4))
| equalish(X2,add(X1,X3)) ),
file('<stdin>',add_substitution2) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X2,subtract(X4,X1))
| equalish(X2,subtract(X3,X1)) ),
file('<stdin>',subtract_substitution1) ).
fof(c_0_3_004,axiom,
! [X1,X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X2,subtract(X1,X4))
| equalish(X2,subtract(X1,X3)) ),
file('<stdin>',subtract_substitution2) ).
fof(c_0_4_005,axiom,
! [X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X3,X2)
| equalish(X4,X2) ),
file('<stdin>',transitivity) ).
fof(c_0_5_006,plain,
! [X1,X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X2,add(X4,X1))
| equalish(X2,add(X3,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_6_007,plain,
! [X1,X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X2,add(X1,X4))
| equalish(X2,add(X1,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_7_008,plain,
! [X1,X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X2,subtract(X4,X1))
| equalish(X2,subtract(X3,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_8_009,plain,
! [X1,X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X2,subtract(X1,X4))
| equalish(X2,subtract(X1,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_9_010,plain,
! [X2,X3,X4] :
( ~ equalish(X4,X3)
| ~ equalish(X3,X2)
| equalish(X4,X2) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_10_011,plain,
! [X5,X6,X7,X8] :
( ~ equalish(X8,X7)
| ~ equalish(X6,add(X8,X5))
| equalish(X6,add(X7,X5)) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_11_012,plain,
! [X5,X6,X7,X8] :
( ~ equalish(X8,X7)
| ~ equalish(X6,add(X5,X8))
| equalish(X6,add(X5,X7)) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_12_013,plain,
! [X5,X6,X7,X8] :
( ~ equalish(X8,X7)
| ~ equalish(X6,subtract(X8,X5))
| equalish(X6,subtract(X7,X5)) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_13_014,plain,
! [X5,X6,X7,X8] :
( ~ equalish(X8,X7)
| ~ equalish(X6,subtract(X5,X8))
| equalish(X6,subtract(X5,X7)) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_14_015,plain,
! [X5,X6,X7] :
( ~ equalish(X7,X6)
| ~ equalish(X6,X5)
| equalish(X7,X5) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_15_016,plain,
( equalish(X1,add(X2,X3))
| ~ equalish(X1,add(X4,X3))
| ~ equalish(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16_017,plain,
( equalish(X1,add(X2,X3))
| ~ equalish(X1,add(X2,X4))
| ~ equalish(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17_018,plain,
( equalish(X1,subtract(X2,X3))
| ~ equalish(X1,subtract(X4,X3))
| ~ equalish(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18_019,plain,
( equalish(X1,subtract(X2,X3))
| ~ equalish(X1,subtract(X2,X4))
| ~ equalish(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19_020,plain,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20_021,plain,
( equalish(X1,add(X2,X3))
| ~ equalish(X1,add(X4,X3))
| ~ equalish(X4,X2) ),
c_0_15,
[final] ).
cnf(c_0_21_022,plain,
( equalish(X1,add(X2,X3))
| ~ equalish(X1,add(X2,X4))
| ~ equalish(X4,X3) ),
c_0_16,
[final] ).
cnf(c_0_22_023,plain,
( equalish(X1,subtract(X2,X3))
| ~ equalish(X1,subtract(X4,X3))
| ~ equalish(X4,X2) ),
c_0_17,
[final] ).
cnf(c_0_23_024,plain,
( equalish(X1,subtract(X2,X3))
| ~ equalish(X1,subtract(X2,X4))
| ~ equalish(X4,X3) ),
c_0_18,
[final] ).
cnf(c_0_24_025,plain,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
c_0_19,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_20_0,axiom,
( equalish(X1,add(X2,X3))
| ~ equalish(X1,add(X4,X3))
| ~ equalish(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_1,axiom,
( ~ equalish(X1,add(X4,X3))
| equalish(X1,add(X2,X3))
| ~ equalish(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_2,axiom,
( ~ equalish(X4,X2)
| ~ equalish(X1,add(X4,X3))
| equalish(X1,add(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_21_0,axiom,
( equalish(X1,add(X2,X3))
| ~ equalish(X1,add(X2,X4))
| ~ equalish(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_1,axiom,
( ~ equalish(X1,add(X2,X4))
| equalish(X1,add(X2,X3))
| ~ equalish(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_2,axiom,
( ~ equalish(X4,X3)
| ~ equalish(X1,add(X2,X4))
| equalish(X1,add(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_22_0,axiom,
( equalish(X1,subtract(X2,X3))
| ~ equalish(X1,subtract(X4,X3))
| ~ equalish(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_1,axiom,
( ~ equalish(X1,subtract(X4,X3))
| equalish(X1,subtract(X2,X3))
| ~ equalish(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_2,axiom,
( ~ equalish(X4,X2)
| ~ equalish(X1,subtract(X4,X3))
| equalish(X1,subtract(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_23_0,axiom,
( equalish(X1,subtract(X2,X3))
| ~ equalish(X1,subtract(X2,X4))
| ~ equalish(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_1,axiom,
( ~ equalish(X1,subtract(X2,X4))
| equalish(X1,subtract(X2,X3))
| ~ equalish(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_2,axiom,
( ~ equalish(X4,X3)
| ~ equalish(X1,subtract(X2,X4))
| equalish(X1,subtract(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_24_0,axiom,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( ~ equalish(X3,X2)
| equalish(X1,X2)
| ~ equalish(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_2,axiom,
( ~ equalish(X1,X3)
| ~ equalish(X3,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_026,negated_conjecture,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
file('<stdin>',prove_equation) ).
fof(c_0_1_027,negated_conjecture,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_028,negated_conjecture,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
c_0_1 ).
cnf(c_0_3_029,negated_conjecture,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_030,negated_conjecture,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_14,plain,
( equalish(X0,X1)
| ~ equalish(X2,X1)
| ~ equalish(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6e43d4.p',c_0_24_2) ).
cnf(c_1987435,plain,
( equalish(X0,X1)
| ~ equalish(X2,X1)
| ~ equalish(X0,X2) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_1987447,plain,
( equalish(X0,add(X1,X2))
| ~ equalish(X3,add(X1,X2))
| ~ equalish(X0,X3) ),
inference(instantiation,[status(thm)],[c_1987435]) ).
cnf(c_1987634,plain,
( ~ equalish(add(X0,X1),add(X1,X0))
| equalish(X2,add(X1,X0))
| ~ equalish(X2,add(X0,X1)) ),
inference(instantiation,[status(thm)],[c_1987447]) ).
cnf(c_16,plain,
equalish(add(X0,X1),add(X1,X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_6e43d4.p',c_0_33_0) ).
cnf(c_51,plain,
( equalish(X0,X1)
| ~ equalish(X2,X1)
| ~ equalish(X0,X2) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_8906,plain,
( equalish(X0,add(X1,X2))
| ~ equalish(X3,add(X1,X2))
| ~ equalish(X0,X3) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_9097,plain,
( ~ equalish(add(X0,X1),add(X1,X0))
| equalish(X2,add(X1,X0))
| ~ equalish(X2,add(X0,X1)) ),
inference(instantiation,[status(thm)],[c_8906]) ).
cnf(c_2006544,plain,
( equalish(X2,add(X1,X0))
| ~ equalish(X2,add(X0,X1)) ),
inference(global_propositional_subsumption,[status(thm)],[c_1987634,c_16,c_9097]) ).
cnf(c_2008626,plain,
( ~ equalish(X0,add(subtract(X1,X2),X3))
| equalish(X0,add(X3,subtract(X1,X2))) ),
inference(instantiation,[status(thm)],[c_2006544]) ).
cnf(c_2212050,plain,
( ~ equalish(add(subtract(a,b),c),add(subtract(c,b),a))
| equalish(add(subtract(a,b),c),add(a,subtract(c,b))) ),
inference(instantiation,[status(thm)],[c_2008626]) ).
cnf(c_1987638,plain,
( ~ equalish(subtract(add(X0,X1),X2),add(subtract(X0,X2),X1))
| equalish(X3,add(subtract(X0,X2),X1))
| ~ equalish(X3,subtract(add(X0,X1),X2)) ),
inference(instantiation,[status(thm)],[c_1987447]) ).
cnf(c_21,plain,
equalish(subtract(add(X0,X1),X2),add(subtract(X0,X2),X1)),
file('/export/starexec/sandbox/tmp/iprover_modulo_6e43d4.p',c_0_28_0) ).
cnf(c_9102,plain,
( ~ equalish(subtract(add(X0,X1),X2),add(subtract(X0,X2),X1))
| equalish(X3,add(subtract(X0,X2),X1))
| ~ equalish(X3,subtract(add(X0,X1),X2)) ),
inference(instantiation,[status(thm)],[c_8906]) ).
cnf(c_2008558,plain,
( equalish(X3,add(subtract(X0,X2),X1))
| ~ equalish(X3,subtract(add(X0,X1),X2)) ),
inference(global_propositional_subsumption,[status(thm)],[c_1987638,c_21,c_9102]) ).
cnf(c_2008567,plain,
( equalish(add(subtract(a,b),c),add(subtract(X0,X1),X2))
| ~ equalish(add(subtract(a,b),c),subtract(add(X0,X2),X1)) ),
inference(instantiation,[status(thm)],[c_2008558]) ).
cnf(c_2128653,plain,
( equalish(add(subtract(a,b),c),add(subtract(c,b),a))
| ~ equalish(add(subtract(a,b),c),subtract(add(c,a),b)) ),
inference(instantiation,[status(thm)],[c_2008567]) ).
cnf(c_6,plain,
( ~ equalish(X0,X1)
| ~ equalish(X2,subtract(X0,X3))
| equalish(X2,subtract(X1,X3)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6e43d4.p',c_0_22_0) ).
cnf(c_43,plain,
( ~ equalish(X0,X1)
| ~ equalish(X2,subtract(X0,X3))
| equalish(X2,subtract(X1,X3)) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_9014,plain,
( ~ equalish(add(subtract(X0,X1),X2),subtract(add(X0,X2),X1))
| equalish(add(subtract(X0,X1),X2),subtract(X3,X1))
| ~ equalish(add(X0,X2),X3) ),
inference(instantiation,[status(thm)],[c_43]) ).
cnf(c_25980,plain,
( ~ equalish(add(subtract(X0,X1),X2),subtract(add(X0,X2),X1))
| equalish(add(subtract(X0,X1),X2),subtract(add(X2,X0),X1))
| ~ equalish(add(X0,X2),add(X2,X0)) ),
inference(instantiation,[status(thm)],[c_9014]) ).
cnf(c_100456,plain,
( ~ equalish(add(subtract(a,b),c),subtract(add(a,c),b))
| equalish(add(subtract(a,b),c),subtract(add(c,a),b))
| ~ equalish(add(a,c),add(c,a)) ),
inference(instantiation,[status(thm)],[c_25980]) ).
cnf(c_53,plain,
equalish(add(X0,X1),add(X1,X0)),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_11309,plain,
equalish(add(a,c),add(c,a)),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_20,plain,
equalish(add(subtract(X0,X1),X2),subtract(add(X0,X2),X1)),
file('/export/starexec/sandbox/tmp/iprover_modulo_6e43d4.p',c_0_29_0) ).
cnf(c_57,plain,
equalish(add(subtract(X0,X1),X2),subtract(add(X0,X2),X1)),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_8944,plain,
equalish(add(subtract(a,b),c),subtract(add(a,c),b)),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_22,negated_conjecture,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
file('/export/starexec/sandbox/tmp/iprover_modulo_6e43d4.p',c_0_4) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_2212050,c_2128653,c_100456,c_11309,c_8944,c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n010.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 : Wed Jul 6 09:11:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0bc5fe.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6e43d4.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6bc7ca | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0bc5fe.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
% 101.30/101.51 % --inst_prop_sim_new false
% 101.30/101.51 % --inst_orphan_elimination true
% 101.30/101.51 % --inst_learning_loop_flag true
% 101.30/101.51 % --inst_learning_start 3000
% 101.30/101.51 % --inst_learning_factor 2
% 101.30/101.51 % --inst_start_prop_sim_after_learn 3
% 101.30/101.51 % --inst_sel_renew solver
% 101.30/101.51 % --inst_lit_activity_flag true
% 101.30/101.51 % --inst_out_proof true
% 101.30/101.51
% 101.30/101.51 % ------ Resolution Options
% 101.30/101.51
% 101.30/101.51 % --resolution_flag true
% 101.30/101.51 % --res_lit_sel kbo_max
% 101.30/101.51 % --res_to_prop_solver none
% 101.30/101.51 % --res_prop_simpl_new false
% 101.30/101.51 % --res_prop_simpl_given false
% 101.30/101.51 % --res_passive_queue_type priority_queues
% 101.30/101.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 101.30/101.51 % --res_passive_queues_freq [15;5]
% 101.30/101.51 % --res_forward_subs full
% 101.30/101.51 % --res_backward_subs full
% 101.30/101.51 % --res_forward_subs_resolution true
% 101.30/101.51 % --res_backward_subs_resolution true
% 101.30/101.51 % --res_orphan_elimination false
% 101.30/101.51 % --res_time_limit 1000.
% 101.30/101.51 % --res_out_proof true
% 101.30/101.51 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0bc5fe.s
% 101.30/101.51 % --modulo true
% 101.30/101.51
% 101.30/101.51 % ------ Combination Options
% 101.30/101.51
% 101.30/101.51 % --comb_res_mult 1000
% 101.30/101.51 % --comb_inst_mult 300
% 101.30/101.51 % ------
% 101.30/101.51
% 101.30/101.51
% 101.30/101.51
% 101.30/101.51 % ------ Proving...
% 101.30/101.51 %
% 101.30/101.51
% 101.30/101.51
% 101.30/101.51 % ------ Statistics
% 101.30/101.51
% 101.30/101.51 % ------ General
% 101.30/101.51
% 101.30/101.51 % num_of_input_clauses: 23
% 101.30/101.51 % num_of_input_neg_conjectures: 1
% 101.30/101.51 % num_of_splits: 0
% 101.30/101.51 % num_of_split_atoms: 0
% 101.30/101.51 % num_of_sem_filtered_clauses: 0
% 101.30/101.51 % num_of_subtypes: 0
% 101.30/101.51 % monotx_restored_types: 0
% 101.30/101.51 % sat_num_of_epr_types: 0
% 101.30/101.51 % sat_num_of_non_cyclic_types: 0
% 101.30/101.51 % sat_guarded_non_collapsed_types: 0
% 101.30/101.51 % is_epr: 0
% 101.30/101.51 % is_horn: 1
% 101.30/101.51 % has_eq: 0
% 101.30/101.51 % num_pure_diseq_elim: 0
% 101.30/101.51 % simp_replaced_by: 0
% 101.30/101.51 % res_preprocessed: 2
% 101.30/101.51 % prep_upred: 0
% 101.30/101.51 % prep_unflattend: 0
% 101.30/101.51 % pred_elim_cands: 0
% 101.30/101.51 % pred_elim: 0
% 101.30/101.51 % pred_elim_cl: 0
% 101.30/101.51 % pred_elim_cycles: 0
% 101.30/101.51 % forced_gc_time: 0
% 101.30/101.51 % gc_basic_clause_elim: 0
% 101.30/101.51 % parsing_time: 0.001
% 101.30/101.51 % sem_filter_time: 0.
% 101.30/101.51 % pred_elim_time: 0.
% 101.30/101.51 % out_proof_time: 0.023
% 101.30/101.51 % monotx_time: 0.
% 101.30/101.51 % subtype_inf_time: 0.
% 101.30/101.51 % unif_index_cands_time: 0.655
% 101.30/101.51 % unif_index_add_time: 0.142
% 101.30/101.51 % total_time: 101.104
% 101.30/101.51 % num_of_symbols: 31
% 101.30/101.51 % num_of_terms: 1139820
% 101.30/101.51
% 101.30/101.51 % ------ Propositional Solver
% 101.30/101.51
% 101.30/101.51 % prop_solver_calls: 103
% 101.30/101.51 % prop_fast_solver_calls: 5761
% 101.30/101.51 % prop_num_of_clauses: 113904
% 101.30/101.51 % prop_preprocess_simplified: 383171
% 101.30/101.51 % prop_fo_subsumed: 648
% 101.30/101.51 % prop_solver_time: 0.228
% 101.30/101.51 % prop_fast_solver_time: 0.038
% 101.30/101.51 % prop_unsat_core_time: 0.013
% 101.30/101.51
% 101.30/101.51 % ------ QBF
% 101.30/101.51
% 101.30/101.51 % qbf_q_res: 0
% 101.30/101.51 % qbf_num_tautologies: 0
% 101.30/101.51 % qbf_prep_cycles: 0
% 101.30/101.51
% 101.30/101.51 % ------ BMC1
% 101.30/101.51
% 101.30/101.51 % bmc1_current_bound: -1
% 101.30/101.51 % bmc1_last_solved_bound: -1
% 101.30/101.51 % bmc1_unsat_core_size: -1
% 101.30/101.51 % bmc1_unsat_core_parents_size: -1
% 101.30/101.51 % bmc1_merge_next_fun: 0
% 101.30/101.51 % bmc1_unsat_core_clauses_time: 0.
% 101.30/101.51
% 101.30/101.51 % ------ Instantiation
% 101.30/101.51
% 101.30/101.51 % inst_num_of_clauses: 13413
% 101.30/101.51 % inst_num_in_passive: 10565
% 101.30/101.51 % inst_num_in_active: 2097
% 101.30/101.51 % inst_num_in_unprocessed: 20
% 101.30/101.51 % inst_num_of_loops: 2457
% 101.30/101.52 % inst_num_of_learning_restarts: 3
% 101.30/101.52 % inst_num_moves_active_passive: 44
% 101.30/101.52 % inst_lit_activity: 1364
% 101.30/101.52 % inst_lit_activity_moves: 0
% 101.30/101.52 % inst_num_tautologies: 94
% 101.30/101.52 % inst_num_prop_implied: 0
% 101.30/101.52 % inst_num_existing_simplified: 220
% 101.30/101.52 % inst_num_eq_res_simplified: 0
% 101.30/101.52 % inst_num_child_elim: 0
% 101.30/101.52 % inst_num_of_dismatching_blockings: 37656
% 101.30/101.52 % inst_num_of_non_proper_insts: 26104
% 101.30/101.52 % inst_num_of_duplicates: 14896
% 101.30/101.52 % inst_inst_num_from_inst_to_res: 0
% 101.30/101.52 % inst_dismatching_checking_time: 3.4
% 101.30/101.52
% 101.30/101.52 % ------ Resolution
% 101.30/101.52
% 101.30/101.52 % res_num_of_clauses: 157331
% 101.30/101.52 % res_num_in_passive: 118502
% 101.30/101.52 % res_num_in_active: 38821
% 101.30/101.52 % res_num_of_loops: 79000
% 101.30/101.52 % res_forward_subset_subsumed: 94806
% 101.30/101.52 % res_backward_subset_subsumed: 0
% 101.30/101.52 % res_forward_subsumed: 40195
% 101.30/101.52 % res_backward_subsumed: 2
% 101.30/101.52 % res_forward_subsumption_resolution: 0
% 101.30/101.52 % res_backward_subsumption_resolution: 0
% 101.30/101.52 % res_clause_to_clause_subsumption: 24615728
% 101.30/101.52 % res_orphan_elimination: 0
% 101.30/101.52 % res_tautology_del: 0
% 101.30/101.52 % res_num_eq_res_simplified: 0
% 101.30/101.52 % res_num_sel_changes: 0
% 101.30/101.52 % res_moves_from_active_to_pass: 0
% 101.30/101.52
% 101.30/101.52 % Status Unsatisfiable
% 101.30/101.52 % SZS status Unsatisfiable
% 101.30/101.52 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------