TSTP Solution File: SYN014-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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 21 07:22:20 EDT 2022
% Result : Unsatisfiable 0.18s 0.42s
% Output : CNFRefutation 0.18s
% 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(reflexivityish,axiom,
equalish(X,X),
input ).
fof(reflexivityish_0,plain,
! [X] :
( equalish(X,X)
| $false ),
inference(orientation,[status(thm)],[reflexivityish]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> equalish(X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[reflexivityish_0,def_lhs_atom1]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_1,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
lhs_atom1(X1),
c_0_3,
[final] ).
% End CNF derivation
cnf(c_0_4_0,axiom,
equalish(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_4,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X4,X5,X6] :
( ~ equalish(X6,X5)
| ~ equalish(X5,X4)
| equalish(X6,X4) ),
file('<stdin>',transitivityish) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3] :
( ~ equalish(X3,X2)
| ~ element(X1,X3)
| element(X1,X2) ),
file('<stdin>',element_substitutionish1) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3] :
( ~ element(X3,X2)
| ~ equalish(X3,X1)
| element(X1,X2) ),
file('<stdin>',element_substitutionish2) ).
fof(c_0_3_004,axiom,
! [X5,X6] :
( ~ equalish(X6,X5)
| equalish(X5,X6) ),
file('<stdin>',symmetryish) ).
fof(c_0_4_005,plain,
! [X4,X5,X6] :
( ~ equalish(X6,X5)
| ~ equalish(X5,X4)
| equalish(X6,X4) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5,plain,
! [X1,X2,X3] :
( ~ equalish(X3,X2)
| ~ element(X1,X3)
| element(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( ~ element(X3,X2)
| ~ equalish(X3,X1)
| element(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_7,plain,
! [X5,X6] :
( ~ equalish(X6,X5)
| equalish(X5,X6) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_8,plain,
! [X7,X8,X9] :
( ~ equalish(X9,X8)
| ~ equalish(X8,X7)
| equalish(X9,X7) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( ~ equalish(X6,X5)
| ~ element(X4,X6)
| element(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( ~ element(X6,X5)
| ~ equalish(X6,X4)
| element(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X7,X8] :
( ~ equalish(X8,X7)
| equalish(X7,X8) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( element(X1,X2)
| ~ element(X1,X3)
| ~ equalish(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( element(X1,X2)
| ~ equalish(X3,X1)
| ~ element(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
c_0_12,
[final] ).
cnf(c_0_17,plain,
( element(X1,X2)
| ~ element(X1,X3)
| ~ equalish(X3,X2) ),
c_0_13,
[final] ).
cnf(c_0_18,plain,
( element(X1,X2)
| ~ equalish(X3,X1)
| ~ element(X3,X2) ),
c_0_14,
[final] ).
cnf(c_0_19,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
c_0_15,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_16_0,axiom,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).
cnf(c_0_16_1,axiom,
( ~ equalish(X3,X2)
| equalish(X1,X2)
| ~ equalish(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).
cnf(c_0_16_2,axiom,
( ~ equalish(X1,X3)
| ~ equalish(X3,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).
cnf(c_0_17_0,axiom,
( element(X1,X2)
| ~ element(X1,X3)
| ~ equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).
cnf(c_0_17_1,axiom,
( ~ element(X1,X3)
| element(X1,X2)
| ~ equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).
cnf(c_0_17_2,axiom,
( ~ equalish(X3,X2)
| ~ element(X1,X3)
| element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).
cnf(c_0_18_0,axiom,
( element(X1,X2)
| ~ equalish(X3,X1)
| ~ element(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_18_1,axiom,
( ~ equalish(X3,X1)
| element(X1,X2)
| ~ element(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_18_2,axiom,
( ~ element(X3,X2)
| ~ equalish(X3,X1)
| element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_19_0,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
cnf(c_0_19_1,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_006,negated_conjecture,
! [X2,X1] :
( ~ element(X1,X2)
| ~ element(X2,X1)
| equalish(X1,X2)
| equalish(X1,n)
| ~ element(X2,n)
| equalish(X2,n) ),
file('<stdin>',c_14) ).
fof(c_0_1_007,negated_conjecture,
! [X2,X1] :
( ~ element(X1,X2)
| ~ element(X2,X1)
| equalish(X1,X2)
| equalish(X1,m)
| element(X2,m)
| equalish(X2,m) ),
file('<stdin>',c_9) ).
fof(c_0_2_008,negated_conjecture,
! [X1] :
( ~ equalish(f(X1),X1)
| ~ element(X1,m)
| equalish(X1,m) ),
file('<stdin>',c_6) ).
fof(c_0_3_009,negated_conjecture,
! [X1] :
( ~ equalish(f(X1),m)
| ~ element(X1,m)
| equalish(X1,m) ),
file('<stdin>',c_5) ).
fof(c_0_4_010,negated_conjecture,
! [X1] :
( ~ element(X1,k)
| equalish(X1,n)
| equalish(X1,m)
| equalish(X1,k) ),
file('<stdin>',c_17) ).
fof(c_0_5_011,negated_conjecture,
! [X1] :
( ~ equalish(g(X1),X1)
| element(X1,n)
| equalish(X1,n) ),
file('<stdin>',c_11) ).
fof(c_0_6_012,negated_conjecture,
! [X1] :
( ~ equalish(g(X1),n)
| element(X1,n)
| equalish(X1,n) ),
file('<stdin>',c_10) ).
fof(c_0_7_013,negated_conjecture,
! [X1] :
( element(f(X1),X1)
| ~ element(X1,m)
| equalish(X1,m) ),
file('<stdin>',c_8) ).
fof(c_0_8_014,negated_conjecture,
! [X1] :
( element(X1,f(X1))
| ~ element(X1,m)
| equalish(X1,m) ),
file('<stdin>',c_7) ).
fof(c_0_9_015,negated_conjecture,
! [X1] :
( element(g(X1),X1)
| element(X1,n)
| equalish(X1,n) ),
file('<stdin>',c_13) ).
fof(c_0_10_016,negated_conjecture,
! [X1] :
( element(X1,g(X1))
| element(X1,n)
| equalish(X1,n) ),
file('<stdin>',c_12) ).
fof(c_0_11_017,negated_conjecture,
! [X1] :
( ~ equalish(X1,n)
| element(X1,k)
| equalish(X1,k) ),
file('<stdin>',c_16) ).
fof(c_0_12_018,negated_conjecture,
! [X1] :
( ~ equalish(X1,m)
| element(X1,k)
| equalish(X1,k) ),
file('<stdin>',c_15) ).
fof(c_0_13_019,negated_conjecture,
! [X1] :
( ~ equalish(X1,k)
| element(X1,a)
| equalish(X1,a) ),
file('<stdin>',c_4) ).
fof(c_0_14_020,negated_conjecture,
! [X1] :
( ~ element(X1,a)
| equalish(X1,k)
| equalish(X1,a) ),
file('<stdin>',c_3) ).
fof(c_0_15_021,negated_conjecture,
~ equalish(k,a),
file('<stdin>',c_22) ).
fof(c_0_16_022,negated_conjecture,
~ equalish(m,a),
file('<stdin>',c_21) ).
fof(c_0_17_023,negated_conjecture,
~ equalish(m,n),
file('<stdin>',c_19) ).
fof(c_0_18_024,negated_conjecture,
~ equalish(n,a),
file('<stdin>',c_18) ).
fof(c_0_19_025,negated_conjecture,
equalish(m,k),
file('<stdin>',c_23) ).
fof(c_0_20,negated_conjecture,
equalish(n,k),
file('<stdin>',c_20) ).
fof(c_0_21,negated_conjecture,
! [X2,X1] :
( ~ element(X1,X2)
| ~ element(X2,X1)
| equalish(X1,X2)
| equalish(X1,n)
| ~ element(X2,n)
| equalish(X2,n) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_22,negated_conjecture,
! [X2,X1] :
( ~ element(X1,X2)
| ~ element(X2,X1)
| equalish(X1,X2)
| equalish(X1,m)
| element(X2,m)
| equalish(X2,m) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_23,negated_conjecture,
! [X1] :
( ~ equalish(f(X1),X1)
| ~ element(X1,m)
| equalish(X1,m) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_24,negated_conjecture,
! [X1] :
( ~ equalish(f(X1),m)
| ~ element(X1,m)
| equalish(X1,m) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_25,negated_conjecture,
! [X1] :
( ~ element(X1,k)
| equalish(X1,n)
| equalish(X1,m)
| equalish(X1,k) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_26,negated_conjecture,
! [X1] :
( ~ equalish(g(X1),X1)
| element(X1,n)
| equalish(X1,n) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_27,negated_conjecture,
! [X1] :
( ~ equalish(g(X1),n)
| element(X1,n)
| equalish(X1,n) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_28,negated_conjecture,
! [X1] :
( element(f(X1),X1)
| ~ element(X1,m)
| equalish(X1,m) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_29,negated_conjecture,
! [X1] :
( element(X1,f(X1))
| ~ element(X1,m)
| equalish(X1,m) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_30,negated_conjecture,
! [X1] :
( element(g(X1),X1)
| element(X1,n)
| equalish(X1,n) ),
c_0_9 ).
fof(c_0_31,negated_conjecture,
! [X1] :
( element(X1,g(X1))
| element(X1,n)
| equalish(X1,n) ),
c_0_10 ).
fof(c_0_32,negated_conjecture,
! [X1] :
( ~ equalish(X1,n)
| element(X1,k)
| equalish(X1,k) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_33,negated_conjecture,
! [X1] :
( ~ equalish(X1,m)
| element(X1,k)
| equalish(X1,k) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_34,negated_conjecture,
! [X1] :
( ~ equalish(X1,k)
| element(X1,a)
| equalish(X1,a) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_35,negated_conjecture,
! [X1] :
( ~ element(X1,a)
| equalish(X1,k)
| equalish(X1,a) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_36,negated_conjecture,
~ equalish(k,a),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_37,negated_conjecture,
~ equalish(m,a),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_38,negated_conjecture,
~ equalish(m,n),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_39,negated_conjecture,
~ equalish(n,a),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_40,negated_conjecture,
equalish(m,k),
c_0_19 ).
fof(c_0_41,negated_conjecture,
equalish(n,k),
c_0_20 ).
fof(c_0_42,negated_conjecture,
! [X3,X4] :
( ~ element(X4,X3)
| ~ element(X3,X4)
| equalish(X4,X3)
| equalish(X4,n)
| ~ element(X3,n)
| equalish(X3,n) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_43,negated_conjecture,
! [X3,X4] :
( ~ element(X4,X3)
| ~ element(X3,X4)
| equalish(X4,X3)
| equalish(X4,m)
| element(X3,m)
| equalish(X3,m) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_44,negated_conjecture,
! [X2] :
( ~ equalish(f(X2),X2)
| ~ element(X2,m)
| equalish(X2,m) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_45,negated_conjecture,
! [X2] :
( ~ equalish(f(X2),m)
| ~ element(X2,m)
| equalish(X2,m) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_46,negated_conjecture,
! [X2] :
( ~ element(X2,k)
| equalish(X2,n)
| equalish(X2,m)
| equalish(X2,k) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_47,negated_conjecture,
! [X2] :
( ~ equalish(g(X2),X2)
| element(X2,n)
| equalish(X2,n) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_48,negated_conjecture,
! [X2] :
( ~ equalish(g(X2),n)
| element(X2,n)
| equalish(X2,n) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_49,negated_conjecture,
! [X2] :
( element(f(X2),X2)
| ~ element(X2,m)
| equalish(X2,m) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_50,negated_conjecture,
! [X2] :
( element(X2,f(X2))
| ~ element(X2,m)
| equalish(X2,m) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_51,negated_conjecture,
! [X2] :
( element(g(X2),X2)
| element(X2,n)
| equalish(X2,n) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_52,negated_conjecture,
! [X2] :
( element(X2,g(X2))
| element(X2,n)
| equalish(X2,n) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_53,negated_conjecture,
! [X2] :
( ~ equalish(X2,n)
| element(X2,k)
| equalish(X2,k) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_54,negated_conjecture,
! [X2] :
( ~ equalish(X2,m)
| element(X2,k)
| equalish(X2,k) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_55,negated_conjecture,
! [X2] :
( ~ equalish(X2,k)
| element(X2,a)
| equalish(X2,a) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_56,negated_conjecture,
! [X2] :
( ~ element(X2,a)
| equalish(X2,k)
| equalish(X2,a) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_57,negated_conjecture,
~ equalish(k,a),
c_0_36 ).
fof(c_0_58,negated_conjecture,
~ equalish(m,a),
c_0_37 ).
fof(c_0_59,negated_conjecture,
~ equalish(m,n),
c_0_38 ).
fof(c_0_60,negated_conjecture,
~ equalish(n,a),
c_0_39 ).
fof(c_0_61,negated_conjecture,
equalish(m,k),
c_0_40 ).
fof(c_0_62,negated_conjecture,
equalish(n,k),
c_0_41 ).
cnf(c_0_63,negated_conjecture,
( equalish(X1,n)
| equalish(X2,n)
| equalish(X2,X1)
| ~ element(X1,n)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_64,negated_conjecture,
( equalish(X1,m)
| element(X1,m)
| equalish(X2,m)
| equalish(X2,X1)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_65,negated_conjecture,
( equalish(X1,m)
| ~ element(X1,m)
| ~ equalish(f(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_66,negated_conjecture,
( equalish(X1,m)
| ~ element(X1,m)
| ~ equalish(f(X1),m) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_67,negated_conjecture,
( equalish(X1,k)
| equalish(X1,m)
| equalish(X1,n)
| ~ element(X1,k) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_68,negated_conjecture,
( equalish(X1,n)
| element(X1,n)
| ~ equalish(g(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_69,negated_conjecture,
( equalish(X1,n)
| element(X1,n)
| ~ equalish(g(X1),n) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_70,negated_conjecture,
( equalish(X1,m)
| element(f(X1),X1)
| ~ element(X1,m) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_71,negated_conjecture,
( equalish(X1,m)
| element(X1,f(X1))
| ~ element(X1,m) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_72,negated_conjecture,
( equalish(X1,n)
| element(X1,n)
| element(g(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_73,negated_conjecture,
( equalish(X1,n)
| element(X1,n)
| element(X1,g(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_74,negated_conjecture,
( equalish(X1,k)
| element(X1,k)
| ~ equalish(X1,n) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_75,negated_conjecture,
( equalish(X1,k)
| element(X1,k)
| ~ equalish(X1,m) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_76,negated_conjecture,
( equalish(X1,a)
| element(X1,a)
| ~ equalish(X1,k) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_77,negated_conjecture,
( equalish(X1,a)
| equalish(X1,k)
| ~ element(X1,a) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_78,negated_conjecture,
~ equalish(k,a),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_79,negated_conjecture,
~ equalish(m,a),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_80,negated_conjecture,
~ equalish(m,n),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_81,negated_conjecture,
~ equalish(n,a),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_82,negated_conjecture,
equalish(m,k),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_83,negated_conjecture,
equalish(n,k),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_84,negated_conjecture,
( equalish(X1,n)
| equalish(X2,n)
| equalish(X2,X1)
| ~ element(X1,n)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
c_0_63,
[final] ).
cnf(c_0_85,negated_conjecture,
( equalish(X1,m)
| element(X1,m)
| equalish(X2,m)
| equalish(X2,X1)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
c_0_64,
[final] ).
cnf(c_0_86,negated_conjecture,
( equalish(X1,m)
| ~ element(X1,m)
| ~ equalish(f(X1),X1) ),
c_0_65,
[final] ).
cnf(c_0_87,negated_conjecture,
( equalish(X1,m)
| ~ element(X1,m)
| ~ equalish(f(X1),m) ),
c_0_66,
[final] ).
cnf(c_0_88,negated_conjecture,
( equalish(X1,k)
| equalish(X1,m)
| equalish(X1,n)
| ~ element(X1,k) ),
c_0_67,
[final] ).
cnf(c_0_89,negated_conjecture,
( equalish(X1,n)
| element(X1,n)
| ~ equalish(g(X1),X1) ),
c_0_68,
[final] ).
cnf(c_0_90,negated_conjecture,
( equalish(X1,n)
| element(X1,n)
| ~ equalish(g(X1),n) ),
c_0_69,
[final] ).
cnf(c_0_91,negated_conjecture,
( equalish(X1,m)
| element(f(X1),X1)
| ~ element(X1,m) ),
c_0_70,
[final] ).
cnf(c_0_92,negated_conjecture,
( equalish(X1,m)
| element(X1,f(X1))
| ~ element(X1,m) ),
c_0_71,
[final] ).
cnf(c_0_93,negated_conjecture,
( equalish(X1,n)
| element(X1,n)
| element(g(X1),X1) ),
c_0_72,
[final] ).
cnf(c_0_94,negated_conjecture,
( equalish(X1,n)
| element(X1,n)
| element(X1,g(X1)) ),
c_0_73,
[final] ).
cnf(c_0_95,negated_conjecture,
( equalish(X1,k)
| element(X1,k)
| ~ equalish(X1,n) ),
c_0_74,
[final] ).
cnf(c_0_96,negated_conjecture,
( equalish(X1,k)
| element(X1,k)
| ~ equalish(X1,m) ),
c_0_75,
[final] ).
cnf(c_0_97,negated_conjecture,
( equalish(X1,a)
| element(X1,a)
| ~ equalish(X1,k) ),
c_0_76,
[final] ).
cnf(c_0_98,negated_conjecture,
( equalish(X1,a)
| equalish(X1,k)
| ~ element(X1,a) ),
c_0_77,
[final] ).
cnf(c_0_99,negated_conjecture,
~ equalish(k,a),
c_0_78,
[final] ).
cnf(c_0_100,negated_conjecture,
~ equalish(m,a),
c_0_79,
[final] ).
cnf(c_0_101,negated_conjecture,
~ equalish(m,n),
c_0_80,
[final] ).
cnf(c_0_102,negated_conjecture,
~ equalish(n,a),
c_0_81,
[final] ).
cnf(c_0_103,negated_conjecture,
equalish(m,k),
c_0_82,
[final] ).
cnf(c_0_104,negated_conjecture,
equalish(n,k),
c_0_83,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_32,negated_conjecture,
equalish(n,k),
file('/export/starexec/sandbox/tmp/iprover_modulo_5ff598.p',c_0_104) ).
cnf(c_83,negated_conjecture,
equalish(n,k),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_147,negated_conjecture,
equalish(n,k),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_148,negated_conjecture,
equalish(n,k),
inference(copy,[status(esa)],[c_147]) ).
cnf(c_169,negated_conjecture,
equalish(n,k),
inference(copy,[status(esa)],[c_148]) ).
cnf(c_247,plain,
equalish(n,k),
inference(copy,[status(esa)],[c_169]) ).
cnf(c_2,plain,
( equalish(X0,X1)
| ~ equalish(X2,X1)
| ~ equalish(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5ff598.p',c_0_16_2) ).
cnf(c_227,plain,
( equalish(X0,X1)
| ~ equalish(X2,X1)
| ~ equalish(X0,X2) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_291,plain,
( equalish(n,X0)
| ~ equalish(k,X0) ),
inference(resolution,[status(thm)],[c_247,c_227]) ).
cnf(c_292,plain,
( equalish(n,X0)
| ~ equalish(k,X0) ),
inference(rewriting,[status(thm)],[c_291]) ).
cnf(c_31,negated_conjecture,
equalish(m,k),
file('/export/starexec/sandbox/tmp/iprover_modulo_5ff598.p',c_0_103) ).
cnf(c_81,negated_conjecture,
equalish(m,k),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_146,negated_conjecture,
equalish(m,k),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_149,negated_conjecture,
equalish(m,k),
inference(copy,[status(esa)],[c_146]) ).
cnf(c_189,negated_conjecture,
equalish(m,k),
inference(copy,[status(esa)],[c_149]) ).
cnf(c_287,plain,
equalish(m,k),
inference(copy,[status(esa)],[c_189]) ).
cnf(c_10,plain,
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5ff598.p',c_0_19_1) ).
cnf(c_243,plain,
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_303,plain,
equalish(k,m),
inference(resolution,[status(thm)],[c_287,c_243]) ).
cnf(c_304,plain,
equalish(k,m),
inference(rewriting,[status(thm)],[c_303]) ).
cnf(c_592,plain,
equalish(n,m),
inference(resolution,[status(thm)],[c_292,c_304]) ).
cnf(c_593,plain,
equalish(n,m),
inference(rewriting,[status(thm)],[c_592]) ).
cnf(c_29,negated_conjecture,
~ equalish(m,n),
file('/export/starexec/sandbox/tmp/iprover_modulo_5ff598.p',c_0_101) ).
cnf(c_77,negated_conjecture,
~ equalish(m,n),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_144,negated_conjecture,
~ equalish(m,n),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_151,negated_conjecture,
~ equalish(m,n),
inference(copy,[status(esa)],[c_144]) ).
cnf(c_187,negated_conjecture,
~ equalish(m,n),
inference(copy,[status(esa)],[c_151]) ).
cnf(c_283,plain,
~ equalish(m,n),
inference(copy,[status(esa)],[c_187]) ).
cnf(c_9,plain,
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5ff598.p',c_0_19_0) ).
cnf(c_241,plain,
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_321,plain,
~ equalish(n,m),
inference(resolution,[status(thm)],[c_283,c_241]) ).
cnf(c_322,plain,
~ equalish(n,m),
inference(rewriting,[status(thm)],[c_321]) ).
cnf(c_1299,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_593,c_322]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.11 % Command : iprover_modulo %s %d
% 0.10/0.32 % Computer : n020.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Mon Jul 11 23:27:42 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Running in mono-core mode
% 0.10/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.10/0.39 % Orientation found
% 0.10/0.39 % 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_ca886c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_5ff598.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_93a238 | grep -v "SZS"
% 0.18/0.40
% 0.18/0.40 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.18/0.40
% 0.18/0.40 %
% 0.18/0.40 % ------ iProver source info
% 0.18/0.40
% 0.18/0.40 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.18/0.40 % git: non_committed_changes: true
% 0.18/0.40 % git: last_make_outside_of_git: true
% 0.18/0.40
% 0.18/0.40 %
% 0.18/0.40 % ------ Input Options
% 0.18/0.40
% 0.18/0.40 % --out_options all
% 0.18/0.40 % --tptp_safe_out true
% 0.18/0.40 % --problem_path ""
% 0.18/0.40 % --include_path ""
% 0.18/0.40 % --clausifier .//eprover
% 0.18/0.40 % --clausifier_options --tstp-format
% 0.18/0.40 % --stdin false
% 0.18/0.40 % --dbg_backtrace false
% 0.18/0.40 % --dbg_dump_prop_clauses false
% 0.18/0.40 % --dbg_dump_prop_clauses_file -
% 0.18/0.40 % --dbg_out_stat false
% 0.18/0.40
% 0.18/0.40 % ------ General Options
% 0.18/0.40
% 0.18/0.40 % --fof false
% 0.18/0.40 % --time_out_real 150.
% 0.18/0.40 % --time_out_prep_mult 0.2
% 0.18/0.40 % --time_out_virtual -1.
% 0.18/0.40 % --schedule none
% 0.18/0.40 % --ground_splitting input
% 0.18/0.40 % --splitting_nvd 16
% 0.18/0.40 % --non_eq_to_eq false
% 0.18/0.40 % --prep_gs_sim true
% 0.18/0.40 % --prep_unflatten false
% 0.18/0.40 % --prep_res_sim true
% 0.18/0.40 % --prep_upred true
% 0.18/0.40 % --res_sim_input true
% 0.18/0.40 % --clause_weak_htbl true
% 0.18/0.40 % --gc_record_bc_elim false
% 0.18/0.40 % --symbol_type_check false
% 0.18/0.40 % --clausify_out false
% 0.18/0.40 % --large_theory_mode false
% 0.18/0.40 % --prep_sem_filter none
% 0.18/0.40 % --prep_sem_filter_out false
% 0.18/0.40 % --preprocessed_out false
% 0.18/0.40 % --sub_typing false
% 0.18/0.40 % --brand_transform false
% 0.18/0.40 % --pure_diseq_elim true
% 0.18/0.40 % --min_unsat_core false
% 0.18/0.40 % --pred_elim true
% 0.18/0.40 % --add_important_lit false
% 0.18/0.40 % --soft_assumptions false
% 0.18/0.40 % --reset_solvers false
% 0.18/0.40 % --bc_imp_inh []
% 0.18/0.40 % --conj_cone_tolerance 1.5
% 0.18/0.40 % --prolific_symb_bound 500
% 0.18/0.40 % --lt_threshold 2000
% 0.18/0.40
% 0.18/0.40 % ------ SAT Options
% 0.18/0.40
% 0.18/0.40 % --sat_mode false
% 0.18/0.40 % --sat_fm_restart_options ""
% 0.18/0.40 % --sat_gr_def false
% 0.18/0.40 % --sat_epr_types true
% 0.18/0.40 % --sat_non_cyclic_types false
% 0.18/0.40 % --sat_finite_models false
% 0.18/0.40 % --sat_fm_lemmas false
% 0.18/0.40 % --sat_fm_prep false
% 0.18/0.40 % --sat_fm_uc_incr true
% 0.18/0.40 % --sat_out_model small
% 0.18/0.40 % --sat_out_clauses false
% 0.18/0.40
% 0.18/0.40 % ------ QBF Options
% 0.18/0.40
% 0.18/0.40 % --qbf_mode false
% 0.18/0.40 % --qbf_elim_univ true
% 0.18/0.40 % --qbf_sk_in true
% 0.18/0.40 % --qbf_pred_elim true
% 0.18/0.40 % --qbf_split 32
% 0.18/0.40
% 0.18/0.40 % ------ BMC1 Options
% 0.18/0.40
% 0.18/0.40 % --bmc1_incremental false
% 0.18/0.40 % --bmc1_axioms reachable_all
% 0.18/0.40 % --bmc1_min_bound 0
% 0.18/0.40 % --bmc1_max_bound -1
% 0.18/0.40 % --bmc1_max_bound_default -1
% 0.18/0.40 % --bmc1_symbol_reachability true
% 0.18/0.40 % --bmc1_property_lemmas false
% 0.18/0.40 % --bmc1_k_induction false
% 0.18/0.40 % --bmc1_non_equiv_states false
% 0.18/0.40 % --bmc1_deadlock false
% 0.18/0.40 % --bmc1_ucm false
% 0.18/0.40 % --bmc1_add_unsat_core none
% 0.18/0.40 % --bmc1_unsat_core_children false
% 0.18/0.40 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.40 % --bmc1_out_stat full
% 0.18/0.40 % --bmc1_ground_init false
% 0.18/0.40 % --bmc1_pre_inst_next_state false
% 0.18/0.40 % --bmc1_pre_inst_state false
% 0.18/0.40 % --bmc1_pre_inst_reach_state false
% 0.18/0.40 % --bmc1_out_unsat_core false
% 0.18/0.40 % --bmc1_aig_witness_out false
% 0.18/0.40 % --bmc1_verbose false
% 0.18/0.40 % --bmc1_dump_clauses_tptp false
% 0.18/0.41 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.41 % --bmc1_dump_file -
% 0.18/0.41 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.41 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.41 % --bmc1_ucm_extend_mode 1
% 0.18/0.41 % --bmc1_ucm_init_mode 2
% 0.18/0.41 % --bmc1_ucm_cone_mode none
% 0.18/0.41 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.41 % --bmc1_ucm_relax_model 4
% 0.18/0.41 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.41 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.41 % --bmc1_ucm_layered_model none
% 0.18/0.41 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.41
% 0.18/0.41 % ------ AIG Options
% 0.18/0.41
% 0.18/0.41 % --aig_mode false
% 0.18/0.41
% 0.18/0.41 % ------ Instantiation Options
% 0.18/0.41
% 0.18/0.41 % --instantiation_flag true
% 0.18/0.41 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.41 % --inst_solver_per_active 750
% 0.18/0.41 % --inst_solver_calls_frac 0.5
% 0.18/0.41 % --inst_passive_queue_type priority_queues
% 0.18/0.41 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.41 % --inst_passive_queues_freq [25;2]
% 0.18/0.41 % --inst_dismatching true
% 0.18/0.41 % --inst_eager_unprocessed_to_passive true
% 0.18/0.41 % --inst_prop_sim_given true
% 0.18/0.41 % --inst_prop_sim_new false
% 0.18/0.41 % --inst_orphan_elimination true
% 0.18/0.41 % --inst_learning_loop_flag true
% 0.18/0.41 % --inst_learning_start 3000
% 0.18/0.41 % --inst_learning_factor 2
% 0.18/0.41 % --inst_start_prop_sim_after_learn 3
% 0.18/0.41 % --inst_sel_renew solver
% 0.18/0.41 % --inst_lit_activity_flag true
% 0.18/0.41 % --inst_out_proof true
% 0.18/0.41
% 0.18/0.41 % ------ Resolution Options
% 0.18/0.41
% 0.18/0.41 % --resolution_flag true
% 0.18/0.41 % --res_lit_sel kbo_max
% 0.18/0.41 % --res_to_prop_solver none
% 0.18/0.41 % --res_prop_simpl_new false
% 0.18/0.41 % --res_prop_simpl_given false
% 0.18/0.41 % --res_passive_queue_type priority_queues
% 0.18/0.41 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.41 % --res_passive_queues_freq [15;5]
% 0.18/0.41 % --res_forward_subs full
% 0.18/0.41 % --res_backward_subs full
% 0.18/0.41 % --res_forward_subs_resolution true
% 0.18/0.41 % --res_backward_subs_resolution true
% 0.18/0.41 % --res_orphan_elimination false
% 0.18/0.41 % --res_time_limit 1000.
% 0.18/0.41 % --res_out_proof true
% 0.18/0.41 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ca886c.s
% 0.18/0.41 % --modulo true
% 0.18/0.41
% 0.18/0.41 % ------ Combination Options
% 0.18/0.41
% 0.18/0.41 % --comb_res_mult 1000
% 0.18/0.41 % --comb_inst_mult 300
% 0.18/0.41 % ------
% 0.18/0.41
% 0.18/0.41 % ------ Parsing...% successful
% 0.18/0.41
% 0.18/0.41 % ------ 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.18/0.41
% 0.18/0.41 % ------ Proving...
% 0.18/0.41 % ------ Problem Properties
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % EPR false
% 0.18/0.41 % Horn false
% 0.18/0.41 % Has equality false
% 0.18/0.41
% 0.18/0.41 % % ------ Input Options Time Limit: Unbounded
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 % % ------ Current options:
% 0.18/0.41
% 0.18/0.41 % ------ Input Options
% 0.18/0.41
% 0.18/0.41 % --out_options all
% 0.18/0.41 % --tptp_safe_out true
% 0.18/0.41 % --problem_path ""
% 0.18/0.41 % --include_path ""
% 0.18/0.41 % --clausifier .//eprover
% 0.18/0.41 % --clausifier_options --tstp-format
% 0.18/0.41 % --stdin false
% 0.18/0.41 % --dbg_backtrace false
% 0.18/0.41 % --dbg_dump_prop_clauses false
% 0.18/0.41 % --dbg_dump_prop_clauses_file -
% 0.18/0.41 % --dbg_out_stat false
% 0.18/0.41
% 0.18/0.41 % ------ General Options
% 0.18/0.41
% 0.18/0.41 % --fof false
% 0.18/0.41 % --time_out_real 150.
% 0.18/0.41 % --time_out_prep_mult 0.2
% 0.18/0.41 % --time_out_virtual -1.
% 0.18/0.41 % --schedule none
% 0.18/0.41 % --ground_splitting input
% 0.18/0.41 % --splitting_nvd 16
% 0.18/0.41 % --non_eq_to_eq false
% 0.18/0.41 % --prep_gs_sim true
% 0.18/0.41 % --prep_unflatten false
% 0.18/0.41 % --prep_res_sim true
% 0.18/0.41 % --prep_upred true
% 0.18/0.41 % --res_sim_input true
% 0.18/0.41 % --clause_weak_htbl true
% 0.18/0.41 % --gc_record_bc_elim false
% 0.18/0.41 % --symbol_type_check false
% 0.18/0.41 % --clausify_out false
% 0.18/0.41 % --large_theory_mode false
% 0.18/0.41 % --prep_sem_filter none
% 0.18/0.41 % --prep_sem_filter_out false
% 0.18/0.41 % --preprocessed_out false
% 0.18/0.41 % --sub_typing false
% 0.18/0.41 % --brand_transform false
% 0.18/0.41 % --pure_diseq_elim true
% 0.18/0.41 % --min_unsat_core false
% 0.18/0.41 % --pred_elim true
% 0.18/0.41 % --add_important_lit false
% 0.18/0.41 % --soft_assumptions false
% 0.18/0.41 % --reset_solvers false
% 0.18/0.41 % --bc_imp_inh []
% 0.18/0.41 % --conj_cone_tolerance 1.5
% 0.18/0.41 % --prolific_symb_bound 500
% 0.18/0.41 % --lt_threshold 2000
% 0.18/0.41
% 0.18/0.41 % ------ SAT Options
% 0.18/0.41
% 0.18/0.41 % --sat_mode false
% 0.18/0.41 % --sat_fm_restart_options ""
% 0.18/0.41 % --sat_gr_def false
% 0.18/0.41 % --sat_epr_types true
% 0.18/0.41 % --sat_non_cyclic_types false
% 0.18/0.41 % --sat_finite_models false
% 0.18/0.41 % --sat_fm_lemmas false
% 0.18/0.41 % --sat_fm_prep false
% 0.18/0.41 % --sat_fm_uc_incr true
% 0.18/0.41 % --sat_out_model small
% 0.18/0.41 % --sat_out_clauses false
% 0.18/0.41
% 0.18/0.41 % ------ QBF Options
% 0.18/0.41
% 0.18/0.41 % --qbf_mode false
% 0.18/0.41 % --qbf_elim_univ true
% 0.18/0.41 % --qbf_sk_in true
% 0.18/0.41 % --qbf_pred_elim true
% 0.18/0.41 % --qbf_split 32
% 0.18/0.41
% 0.18/0.41 % ------ BMC1 Options
% 0.18/0.41
% 0.18/0.41 % --bmc1_incremental false
% 0.18/0.41 % --bmc1_axioms reachable_all
% 0.18/0.41 % --bmc1_min_bound 0
% 0.18/0.41 % --bmc1_max_bound -1
% 0.18/0.41 % --bmc1_max_bound_default -1
% 0.18/0.41 % --bmc1_symbol_reachability true
% 0.18/0.41 % --bmc1_property_lemmas false
% 0.18/0.41 % --bmc1_k_induction false
% 0.18/0.41 % --bmc1_non_equiv_states false
% 0.18/0.41 % --bmc1_deadlock false
% 0.18/0.41 % --bmc1_ucm false
% 0.18/0.41 % --bmc1_add_unsat_core none
% 0.18/0.41 % --bmc1_unsat_core_children false
% 0.18/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.41 % --bmc1_out_stat full
% 0.18/0.41 % --bmc1_ground_init false
% 0.18/0.41 % --bmc1_pre_inst_next_state false
% 0.18/0.41 % --bmc1_pre_inst_state false
% 0.18/0.41 % --bmc1_pre_inst_reach_state false
% 0.18/0.41 % --bmc1_out_unsat_core false
% 0.18/0.41 % --bmc1_aig_witness_out false
% 0.18/0.41 % --bmc1_verbose false
% 0.18/0.41 % --bmc1_dump_clauses_tptp false
% 0.18/0.41 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.41 % --bmc1_dump_file -
% 0.18/0.41 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.41 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.41 % --bmc1_ucm_extend_mode 1
% 0.18/0.41 % --bmc1_ucm_init_mode 2
% 0.18/0.41 % --bmc1_ucm_cone_mode none
% 0.18/0.41 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.41 % --bmc1_ucm_relax_model 4
% 0.18/0.41 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.41 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.41 % --bmc1_ucm_layered_model none
% 0.18/0.41 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.41
% 0.18/0.41 % ------ AIG Options
% 0.18/0.41
% 0.18/0.41 % --aig_mode false
% 0.18/0.41
% 0.18/0.41 % ------ Instantiation Options
% 0.18/0.41
% 0.18/0.41 % --instantiation_flag true
% 0.18/0.41 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.41 % --inst_solver_per_active 750
% 0.18/0.41 % --inst_solver_calls_frac 0.5
% 0.18/0.41 % --inst_passive_queue_type priority_queues
% 0.18/0.41 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.41 % --inst_passive_queues_freq [25;2]
% 0.18/0.41 % --inst_dismatching true
% 0.18/0.41 % --inst_eager_unprocessed_to_passive true
% 0.18/0.41 % --inst_prop_sim_given true
% 0.18/0.42 % --inst_prop_sim_new false
% 0.18/0.42 % --inst_orphan_elimination true
% 0.18/0.42 % --inst_learning_loop_flag true
% 0.18/0.42 % --inst_learning_start 3000
% 0.18/0.42 % --inst_learning_factor 2
% 0.18/0.42 % --inst_start_prop_sim_after_learn 3
% 0.18/0.42 % --inst_sel_renew solver
% 0.18/0.42 % --inst_lit_activity_flag true
% 0.18/0.42 % --inst_out_proof true
% 0.18/0.42
% 0.18/0.42 % ------ Resolution Options
% 0.18/0.42
% 0.18/0.42 % --resolution_flag true
% 0.18/0.42 % --res_lit_sel kbo_max
% 0.18/0.42 % --res_to_prop_solver none
% 0.18/0.42 % --res_prop_simpl_new false
% 0.18/0.42 % --res_prop_simpl_given false
% 0.18/0.42 % --res_passive_queue_type priority_queues
% 0.18/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.42 % --res_passive_queues_freq [15;5]
% 0.18/0.42 % --res_forward_subs full
% 0.18/0.42 % --res_backward_subs full
% 0.18/0.42 % --res_forward_subs_resolution true
% 0.18/0.42 % --res_backward_subs_resolution true
% 0.18/0.42 % --res_orphan_elimination false
% 0.18/0.42 % --res_time_limit 1000.
% 0.18/0.42 % --res_out_proof true
% 0.18/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ca886c.s
% 0.18/0.42 % --modulo true
% 0.18/0.42
% 0.18/0.42 % ------ Combination Options
% 0.18/0.42
% 0.18/0.42 % --comb_res_mult 1000
% 0.18/0.42 % --comb_inst_mult 300
% 0.18/0.42 % ------
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % ------ Proving...
% 0.18/0.42 %
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % Resolution empty clause
% 0.18/0.42
% 0.18/0.42 % ------ Statistics
% 0.18/0.42
% 0.18/0.42 % ------ General
% 0.18/0.42
% 0.18/0.42 % num_of_input_clauses: 33
% 0.18/0.42 % num_of_input_neg_conjectures: 21
% 0.18/0.42 % num_of_splits: 0
% 0.18/0.42 % num_of_split_atoms: 0
% 0.18/0.42 % num_of_sem_filtered_clauses: 0
% 0.18/0.42 % num_of_subtypes: 0
% 0.18/0.42 % monotx_restored_types: 0
% 0.18/0.42 % sat_num_of_epr_types: 0
% 0.18/0.42 % sat_num_of_non_cyclic_types: 0
% 0.18/0.42 % sat_guarded_non_collapsed_types: 0
% 0.18/0.42 % is_epr: 0
% 0.18/0.42 % is_horn: 0
% 0.18/0.42 % has_eq: 0
% 0.18/0.42 % num_pure_diseq_elim: 0
% 0.18/0.42 % simp_replaced_by: 0
% 0.18/0.42 % res_preprocessed: 42
% 0.18/0.42 % prep_upred: 0
% 0.18/0.42 % prep_unflattend: 0
% 0.18/0.42 % pred_elim_cands: 0
% 0.18/0.42 % pred_elim: 0
% 0.18/0.42 % pred_elim_cl: 0
% 0.18/0.42 % pred_elim_cycles: 0
% 0.18/0.42 % forced_gc_time: 0
% 0.18/0.42 % gc_basic_clause_elim: 0
% 0.18/0.42 % parsing_time: 0.
% 0.18/0.42 % sem_filter_time: 0.
% 0.18/0.42 % pred_elim_time: 0.
% 0.18/0.42 % out_proof_time: 0.001
% 0.18/0.42 % monotx_time: 0.
% 0.18/0.42 % subtype_inf_time: 0.
% 0.18/0.42 % unif_index_cands_time: 0.
% 0.18/0.42 % unif_index_add_time: 0.
% 0.18/0.42 % total_time: 0.027
% 0.18/0.42 % num_of_symbols: 33
% 0.18/0.42 % num_of_terms: 284
% 0.18/0.42
% 0.18/0.42 % ------ Propositional Solver
% 0.18/0.42
% 0.18/0.42 % prop_solver_calls: 1
% 0.18/0.42 % prop_fast_solver_calls: 174
% 0.18/0.42 % prop_num_of_clauses: 40
% 0.18/0.42 % prop_preprocess_simplified: 368
% 0.18/0.42 % prop_fo_subsumed: 0
% 0.18/0.42 % prop_solver_time: 0.
% 0.18/0.42 % prop_fast_solver_time: 0.
% 0.18/0.42 % prop_unsat_core_time: 0.
% 0.18/0.42
% 0.18/0.42 % ------ QBF
% 0.18/0.42
% 0.18/0.42 % qbf_q_res: 0
% 0.18/0.42 % qbf_num_tautologies: 0
% 0.18/0.42 % qbf_prep_cycles: 0
% 0.18/0.42
% 0.18/0.42 % ------ BMC1
% 0.18/0.42
% 0.18/0.42 % bmc1_current_bound: -1
% 0.18/0.42 % bmc1_last_solved_bound: -1
% 0.18/0.42 % bmc1_unsat_core_size: -1
% 0.18/0.42 % bmc1_unsat_core_parents_size: -1
% 0.18/0.42 % bmc1_merge_next_fun: 0
% 0.18/0.42 % bmc1_unsat_core_clauses_time: 0.
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation
% 0.18/0.42
% 0.18/0.42 % inst_num_of_clauses: 33
% 0.18/0.42 % inst_num_in_passive: 0
% 0.18/0.42 % inst_num_in_active: 0
% 0.18/0.42 % inst_num_in_unprocessed: 33
% 0.18/0.42 % inst_num_of_loops: 0
% 0.18/0.42 % inst_num_of_learning_restarts: 0
% 0.18/0.42 % inst_num_moves_active_passive: 0
% 0.18/0.42 % inst_lit_activity: 0
% 0.18/0.42 % inst_lit_activity_moves: 0
% 0.18/0.42 % inst_num_tautologies: 0
% 0.18/0.42 % inst_num_prop_implied: 0
% 0.18/0.42 % inst_num_existing_simplified: 0
% 0.18/0.42 % inst_num_eq_res_simplified: 0
% 0.18/0.42 % inst_num_child_elim: 0
% 0.18/0.42 % inst_num_of_dismatching_blockings: 0
% 0.18/0.42 % inst_num_of_non_proper_insts: 0
% 0.18/0.42 % inst_num_of_duplicates: 0
% 0.18/0.42 % inst_inst_num_from_inst_to_res: 0
% 0.18/0.42 % inst_dismatching_checking_time: 0.
% 0.18/0.42
% 0.18/0.42 % ------ Resolution
% 0.18/0.42
% 0.18/0.42 % res_num_of_clauses: 212
% 0.18/0.42 % res_num_in_passive: 133
% 0.18/0.42 % res_num_in_active: 74
% 0.18/0.42 % res_num_of_loops: 76
% 0.18/0.42 % res_forward_subset_subsumed: 87
% 0.18/0.42 % res_backward_subset_subsumed: 2
% 0.18/0.42 % res_forward_subsumed: 9
% 0.18/0.42 % res_backward_subsumed: 0
% 0.18/0.42 % res_forward_subsumption_resolution: 22
% 0.18/0.42 % res_backward_subsumption_resolution: 0
% 0.18/0.42 % res_clause_to_clause_subsumption: 1220
% 0.18/0.42 % res_orphan_elimination: 0
% 0.18/0.42 % res_tautology_del: 19
% 0.18/0.42 % res_num_eq_res_simplified: 0
% 0.18/0.42 % res_num_sel_changes: 0
% 0.18/0.42 % res_moves_from_active_to_pass: 0
% 0.18/0.42
% 0.18/0.42 % Status Unsatisfiable
% 0.18/0.42 % SZS status Unsatisfiable
% 0.18/0.42 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------