TSTP Solution File: SWV007-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWV007-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 : Wed Jul 20 19:07:00 EDT 2022
% Result : Unsatisfiable 0.99s 1.24s
% Output : CNFRefutation 0.99s
% 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(x_not_less_than_x,axiom,
~ less_than(X,X),
input ).
fof(x_not_less_than_x_0,plain,
! [X] :
( ~ less_than(X,X)
| $false ),
inference(orientation,[status(thm)],[x_not_less_than_x]) ).
cnf(less_than_successor,axiom,
less_than(X,successor(X)),
input ).
fof(less_than_successor_0,plain,
! [X] :
( less_than(X,successor(X))
| $false ),
inference(orientation,[status(thm)],[less_than_successor]) ).
cnf(predecessor_less_than,axiom,
less_than(predecessor(X),X),
input ).
fof(predecessor_less_than_0,plain,
! [X] :
( less_than(predecessor(X),X)
| $false ),
inference(orientation,[status(thm)],[predecessor_less_than]) ).
cnf(successor_predecessor,axiom,
successor(predecessor(X)) = X,
input ).
fof(successor_predecessor_0,plain,
! [X] :
( successor(predecessor(X)) = X
| $false ),
inference(orientation,[status(thm)],[successor_predecessor]) ).
cnf(predecessor_successor,axiom,
predecessor(successor(X)) = X,
input ).
fof(predecessor_successor_0,plain,
! [X] :
( predecessor(successor(X)) = X
| $false ),
inference(orientation,[status(thm)],[predecessor_successor]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> predecessor(successor(X)) = X ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[predecessor_successor_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X] :
( lhs_atom2(X)
<=> successor(predecessor(X)) = X ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X] :
( lhs_atom2(X)
| $false ),
inference(fold_definition,[status(thm)],[successor_predecessor_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [X] :
( lhs_atom3(X)
<=> less_than(predecessor(X),X) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [X] :
( lhs_atom3(X)
| $false ),
inference(fold_definition,[status(thm)],[predecessor_less_than_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [X] :
( lhs_atom4(X)
<=> less_than(X,successor(X)) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [X] :
( lhs_atom4(X)
| $false ),
inference(fold_definition,[status(thm)],[less_than_successor_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [X] :
( lhs_atom5(X)
<=> ~ less_than(X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [X] :
( lhs_atom5(X)
| $false ),
inference(fold_definition,[status(thm)],[x_not_less_than_x_0,def_lhs_atom5]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom5(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom4(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_2,axiom,
! [X1] :
( lhs_atom3(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_3,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_4,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_5,plain,
! [X1] : lhs_atom5(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_6,plain,
! [X1] : lhs_atom4(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_7,plain,
! [X1] : lhs_atom3(X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_8,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_9,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X2] : lhs_atom5(X2),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X2] : lhs_atom4(X2),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X2] : lhs_atom3(X2),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
lhs_atom5(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
lhs_atom4(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
lhs_atom5(X1),
c_0_15,
[final] ).
cnf(c_0_21,plain,
lhs_atom4(X1),
c_0_16,
[final] ).
cnf(c_0_22,plain,
lhs_atom3(X1),
c_0_17,
[final] ).
cnf(c_0_23,plain,
lhs_atom2(X1),
c_0_18,
[final] ).
cnf(c_0_24,plain,
lhs_atom1(X1),
c_0_19,
[final] ).
% End CNF derivation
cnf(c_0_20_0,axiom,
~ less_than(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_20,def_lhs_atom5]) ).
cnf(c_0_21_0,axiom,
less_than(X1,successor(X1)),
inference(unfold_definition,[status(thm)],[c_0_21,def_lhs_atom4]) ).
cnf(c_0_22_0,axiom,
less_than(predecessor(X1),X1),
inference(unfold_definition,[status(thm)],[c_0_22,def_lhs_atom3]) ).
cnf(c_0_23_0,axiom,
successor(predecessor(X1)) = X1,
inference(unfold_definition,[status(thm)],[c_0_23,def_lhs_atom2]) ).
cnf(c_0_24_0,axiom,
predecessor(successor(X1)) = X1,
inference(unfold_definition,[status(thm)],[c_0_24,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] :
( less_than(X3,X1)
| ~ less_than(X3,X2)
| ~ less_than(X2,X1) ),
file('<stdin>',transitivity_of_less_than) ).
fof(c_0_1_002,axiom,
! [X2,X3] :
( ~ less_than(X3,X2)
| ~ less_than(X2,X3) ),
file('<stdin>',anti_symmetry_of_less_than) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3] :
( less_than(X2,X1)
| X3 != X2
| ~ less_than(X3,X1) ),
file('<stdin>',equal_and_less_than_transitivity1) ).
fof(c_0_3_004,axiom,
! [X1,X2,X3] :
( less_than(X1,X2)
| X3 != X2
| ~ less_than(X1,X3) ),
file('<stdin>',equal_and_less_than_transitivity2) ).
fof(c_0_4_005,axiom,
! [X2,X3] :
( less_than(X3,X2)
| less_than(X2,X3)
| X3 = X2 ),
file('<stdin>',all_related) ).
fof(c_0_5_006,axiom,
! [X2,X3] :
( X3 = X2
| predecessor(X3) != predecessor(X2) ),
file('<stdin>',well_defined_predecessor) ).
fof(c_0_6_007,axiom,
! [X2,X3] :
( X3 = X2
| successor(X3) != successor(X2) ),
file('<stdin>',well_defined_successor) ).
fof(c_0_7_008,plain,
! [X1,X2,X3] :
( less_than(X3,X1)
| ~ less_than(X3,X2)
| ~ less_than(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8_009,plain,
! [X2,X3] :
( ~ less_than(X3,X2)
| ~ less_than(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_9_010,plain,
! [X1,X2,X3] :
( less_than(X2,X1)
| X3 != X2
| ~ less_than(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10_011,plain,
! [X1,X2,X3] :
( less_than(X1,X2)
| X3 != X2
| ~ less_than(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_11_012,axiom,
! [X2,X3] :
( less_than(X3,X2)
| less_than(X2,X3)
| X3 = X2 ),
c_0_4 ).
fof(c_0_12_013,axiom,
! [X2,X3] :
( X3 = X2
| predecessor(X3) != predecessor(X2) ),
c_0_5 ).
fof(c_0_13_014,axiom,
! [X2,X3] :
( X3 = X2
| successor(X3) != successor(X2) ),
c_0_6 ).
fof(c_0_14_015,plain,
! [X4,X5,X6] :
( less_than(X6,X4)
| ~ less_than(X6,X5)
| ~ less_than(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15_016,plain,
! [X4,X5] :
( ~ less_than(X5,X4)
| ~ less_than(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_16_017,plain,
! [X4,X5,X6] :
( less_than(X5,X4)
| X6 != X5
| ~ less_than(X6,X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_9])])]) ).
fof(c_0_17_018,plain,
! [X4,X5,X6] :
( less_than(X4,X5)
| X6 != X5
| ~ less_than(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_10])])]) ).
fof(c_0_18_019,plain,
! [X4,X5] :
( less_than(X5,X4)
| less_than(X4,X5)
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19_020,plain,
! [X4,X5] :
( X5 = X4
| predecessor(X5) != predecessor(X4) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20_021,plain,
! [X4,X5] :
( X5 = X4
| successor(X5) != successor(X4) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_21_022,plain,
( less_than(X3,X2)
| ~ less_than(X1,X2)
| ~ less_than(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22_023,plain,
( ~ less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23_024,plain,
( less_than(X3,X2)
| ~ less_than(X1,X2)
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24_025,plain,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| X2 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( X1 = X2
| less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( X1 = X2
| predecessor(X1) != predecessor(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( X1 = X2
| successor(X1) != successor(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( less_than(X3,X2)
| ~ less_than(X1,X2)
| ~ less_than(X3,X1) ),
c_0_21,
[final] ).
cnf(c_0_29,plain,
( ~ less_than(X1,X2)
| ~ less_than(X2,X1) ),
c_0_22,
[final] ).
cnf(c_0_30,plain,
( less_than(X3,X2)
| ~ less_than(X1,X2)
| X1 != X3 ),
c_0_23,
[final] ).
cnf(c_0_31,plain,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| X2 != X3 ),
c_0_24,
[final] ).
cnf(c_0_32,plain,
( X1 = X2
| less_than(X2,X1)
| less_than(X1,X2) ),
c_0_25,
[final] ).
cnf(c_0_33,plain,
( X1 = X2
| predecessor(X1) != predecessor(X2) ),
c_0_26,
[final] ).
cnf(c_0_34,plain,
( X1 = X2
| successor(X1) != successor(X2) ),
c_0_27,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_28_0,axiom,
( less_than(X3,X2)
| ~ less_than(X1,X2)
| ~ less_than(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( ~ less_than(X1,X2)
| less_than(X3,X2)
| ~ less_than(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_2,axiom,
( ~ less_than(X3,X1)
| ~ less_than(X1,X2)
| less_than(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( ~ less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( ~ less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_30_0,axiom,
( less_than(X3,X2)
| ~ less_than(X1,X2)
| X1 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( ~ less_than(X1,X2)
| less_than(X3,X2)
| X1 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_2,axiom,
( X1 != X3
| ~ less_than(X1,X2)
| less_than(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_31_0,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| X2 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_1,axiom,
( ~ less_than(X1,X2)
| less_than(X1,X3)
| X2 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_2,axiom,
( X2 != X3
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_32_0,axiom,
( X1 = X2
| less_than(X2,X1)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( less_than(X2,X1)
| X1 = X2
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_2,axiom,
( less_than(X1,X2)
| less_than(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
( X1 = X2
| predecessor(X1) != predecessor(X2) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( predecessor(X1) != predecessor(X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( X1 = X2
| successor(X1) != successor(X2) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( successor(X1) != successor(X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_026,negated_conjecture,
! [X1] :
( ~ less_than(one,X1)
| ~ less_than(X1,i)
| ~ less_than(a(X1),a(predecessor(X1))) ),
file('<stdin>',clause_9) ).
fof(c_0_1_027,negated_conjecture,
! [X1] :
( less_than(X1,i)
| less_than(n,X1)
| ~ less_than(one,X1)
| ~ less_than(a(X1),a(predecessor(i))) ),
file('<stdin>',clause_10) ).
fof(c_0_2_028,negated_conjecture,
! [X1] :
( less_than(X1,i)
| ~ less_than(X1,successor(n))
| ~ less_than(a(X1),a(k)) ),
file('<stdin>',clause_11) ).
fof(c_0_3_029,negated_conjecture,
less_than(a(m),a(k)),
file('<stdin>',clause_8) ).
fof(c_0_4_030,negated_conjecture,
~ less_than(i,one),
file('<stdin>',clause_6) ).
fof(c_0_5_031,negated_conjecture,
~ less_than(n,m),
file('<stdin>',clause_4) ).
fof(c_0_6_032,negated_conjecture,
~ less_than(k,i),
file('<stdin>',clause_2) ).
fof(c_0_7_033,negated_conjecture,
~ less_than(n,k),
file('<stdin>',clause_1) ).
fof(c_0_8_034,negated_conjecture,
less_than(i,m),
file('<stdin>',clause_5) ).
fof(c_0_9_035,negated_conjecture,
less_than(i,n),
file('<stdin>',clause_3) ).
fof(c_0_10_036,negated_conjecture,
k != m,
file('<stdin>',clause_7) ).
fof(c_0_11_037,negated_conjecture,
! [X1] :
( ~ less_than(one,X1)
| ~ less_than(X1,i)
| ~ less_than(a(X1),a(predecessor(X1))) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_12_038,negated_conjecture,
! [X1] :
( less_than(X1,i)
| less_than(n,X1)
| ~ less_than(one,X1)
| ~ less_than(a(X1),a(predecessor(i))) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_13_039,negated_conjecture,
! [X1] :
( less_than(X1,i)
| ~ less_than(X1,successor(n))
| ~ less_than(a(X1),a(k)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_14_040,negated_conjecture,
less_than(a(m),a(k)),
c_0_3 ).
fof(c_0_15_041,negated_conjecture,
~ less_than(i,one),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_16_042,negated_conjecture,
~ less_than(n,m),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_17_043,negated_conjecture,
~ less_than(k,i),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_18_044,negated_conjecture,
~ less_than(n,k),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_19_045,negated_conjecture,
less_than(i,m),
c_0_8 ).
fof(c_0_20_046,negated_conjecture,
less_than(i,n),
c_0_9 ).
fof(c_0_21_047,negated_conjecture,
k != m,
c_0_10 ).
fof(c_0_22_048,negated_conjecture,
! [X2] :
( ~ less_than(one,X2)
| ~ less_than(X2,i)
| ~ less_than(a(X2),a(predecessor(X2))) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_23_049,negated_conjecture,
! [X2] :
( less_than(X2,i)
| less_than(n,X2)
| ~ less_than(one,X2)
| ~ less_than(a(X2),a(predecessor(i))) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_24_050,negated_conjecture,
! [X2] :
( less_than(X2,i)
| ~ less_than(X2,successor(n))
| ~ less_than(a(X2),a(k)) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_25_051,negated_conjecture,
less_than(a(m),a(k)),
c_0_14 ).
fof(c_0_26_052,negated_conjecture,
~ less_than(i,one),
c_0_15 ).
fof(c_0_27_053,negated_conjecture,
~ less_than(n,m),
c_0_16 ).
fof(c_0_28_054,negated_conjecture,
~ less_than(k,i),
c_0_17 ).
fof(c_0_29_055,negated_conjecture,
~ less_than(n,k),
c_0_18 ).
fof(c_0_30_056,negated_conjecture,
less_than(i,m),
c_0_19 ).
fof(c_0_31_057,negated_conjecture,
less_than(i,n),
c_0_20 ).
fof(c_0_32_058,negated_conjecture,
k != m,
c_0_21 ).
cnf(c_0_33_059,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(X1)))
| ~ less_than(X1,i)
| ~ less_than(one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34_060,negated_conjecture,
( less_than(n,X1)
| less_than(X1,i)
| ~ less_than(a(X1),a(predecessor(i)))
| ~ less_than(one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
( less_than(X1,i)
| ~ less_than(a(X1),a(k))
| ~ less_than(X1,successor(n)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,negated_conjecture,
less_than(a(m),a(k)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,negated_conjecture,
~ less_than(i,one),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,negated_conjecture,
~ less_than(n,m),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
~ less_than(k,i),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,negated_conjecture,
~ less_than(n,k),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,negated_conjecture,
less_than(i,m),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,negated_conjecture,
less_than(i,n),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,negated_conjecture,
k != m,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(X1)))
| ~ less_than(X1,i)
| ~ less_than(one,X1) ),
c_0_33,
[final] ).
cnf(c_0_45,negated_conjecture,
( less_than(n,X1)
| less_than(X1,i)
| ~ less_than(a(X1),a(predecessor(i)))
| ~ less_than(one,X1) ),
c_0_34,
[final] ).
cnf(c_0_46,negated_conjecture,
( less_than(X1,i)
| ~ less_than(a(X1),a(k))
| ~ less_than(X1,successor(n)) ),
c_0_35,
[final] ).
cnf(c_0_47,negated_conjecture,
less_than(a(m),a(k)),
c_0_36,
[final] ).
cnf(c_0_48,negated_conjecture,
~ less_than(i,one),
c_0_37,
[final] ).
cnf(c_0_49,negated_conjecture,
~ less_than(n,m),
c_0_38,
[final] ).
cnf(c_0_50,negated_conjecture,
~ less_than(k,i),
c_0_39,
[final] ).
cnf(c_0_51,negated_conjecture,
~ less_than(n,k),
c_0_40,
[final] ).
cnf(c_0_52,negated_conjecture,
less_than(i,m),
c_0_41,
[final] ).
cnf(c_0_53,negated_conjecture,
less_than(i,n),
c_0_42,
[final] ).
cnf(c_0_54,negated_conjecture,
m != k,
c_0_43,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_2,plain,
( less_than(X0,X1)
| ~ less_than(X2,X1)
| ~ less_than(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_28_2) ).
cnf(c_124,plain,
( less_than(X0,X1)
| ~ less_than(X2,X1)
| ~ less_than(X0,X2) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_33927,plain,
( less_than(X0,successor(X1))
| ~ less_than(X1,successor(X1))
| ~ less_than(X0,X1) ),
inference(instantiation,[status(thm)],[c_124]) ).
cnf(c_34375,plain,
( less_than(m,successor(X0))
| ~ less_than(m,X0)
| ~ less_than(X0,successor(X0)) ),
inference(instantiation,[status(thm)],[c_33927]) ).
cnf(c_35823,plain,
( ~ less_than(n,successor(n))
| less_than(m,successor(n))
| ~ less_than(m,n) ),
inference(instantiation,[status(thm)],[c_34375]) ).
cnf(c_13,plain,
( X0 = X1
| less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_32_2) ).
cnf(c_135,plain,
( X0 = X1
| less_than(X1,X0)
| less_than(X0,X1) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_34106,plain,
( less_than(n,X0)
| less_than(X0,n)
| n = X0 ),
inference(instantiation,[status(thm)],[c_135]) ).
cnf(c_34757,plain,
( less_than(n,m)
| less_than(m,n)
| n = m ),
inference(instantiation,[status(thm)],[c_34106]) ).
cnf(c_5,plain,
( X0 != X1
| ~ less_than(X0,X2)
| less_than(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_30_0) ).
cnf(c_127,plain,
( X0 != X1
| ~ less_than(X0,X2)
| less_than(X1,X2) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_33937,plain,
( ~ less_than(X0,successor(X0))
| less_than(X1,successor(X0))
| X0 != X1 ),
inference(instantiation,[status(thm)],[c_127]) ).
cnf(c_34575,plain,
( ~ less_than(n,successor(n))
| less_than(m,successor(n))
| n != m ),
inference(instantiation,[status(thm)],[c_33937]) ).
cnf(c_25,negated_conjecture,
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_46) ).
cnf(c_49,negated_conjecture,
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_91,negated_conjecture,
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_108,negated_conjecture,
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_114,negated_conjecture,
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_148,negated_conjecture,
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_34226,plain,
( ~ less_than(a(m),a(k))
| ~ less_than(m,successor(n))
| less_than(m,i) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_3,plain,
( ~ less_than(X0,X1)
| ~ less_than(X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_29_0) ).
cnf(c_125,plain,
( ~ less_than(X0,X1)
| ~ less_than(X1,X0) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_33873,plain,
( ~ less_than(i,m)
| ~ less_than(m,i) ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_21,plain,
less_than(X0,successor(X0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_21_0) ).
cnf(c_143,plain,
less_than(X0,successor(X0)),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_33866,plain,
less_than(n,successor(n)),
inference(instantiation,[status(thm)],[c_143]) ).
cnf(c_27,negated_conjecture,
~ less_than(n,m),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_49) ).
cnf(c_31,negated_conjecture,
less_than(a(m),a(k)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_47) ).
cnf(c_32,negated_conjecture,
less_than(i,m),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p',c_0_52) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_35823,c_34757,c_34575,c_34226,c_33873,c_33866,c_27,c_31,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 15 09:48:54 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.34 % 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/sandbox2/tmp/iprover_proof_c815c7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_3fc947.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_483534 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.30/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.30/0.53 % --bmc1_dump_file -
% 0.30/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.30/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.30/0.53 % --bmc1_ucm_extend_mode 1
% 0.30/0.53 % --bmc1_ucm_init_mode 2
% 0.30/0.53 % --bmc1_ucm_cone_mode none
% 0.30/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.30/0.53 % --bmc1_ucm_relax_model 4
% 0.30/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.30/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.30/0.53 % --bmc1_ucm_layered_model none
% 0.30/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.30/0.53
% 0.30/0.53 % ------ AIG Options
% 0.30/0.53
% 0.30/0.53 % --aig_mode false
% 0.30/0.53
% 0.30/0.53 % ------ Instantiation Options
% 0.30/0.53
% 0.30/0.53 % --instantiation_flag true
% 0.30/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.30/0.53 % --inst_solver_per_active 750
% 0.30/0.53 % --inst_solver_calls_frac 0.5
% 0.30/0.53 % --inst_passive_queue_type priority_queues
% 0.30/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.30/0.53 % --inst_passive_queues_freq [25;2]
% 0.30/0.53 % --inst_dismatching true
% 0.30/0.53 % --inst_eager_unprocessed_to_passive true
% 0.30/0.53 % --inst_prop_sim_given true
% 0.30/0.53 % --inst_prop_sim_new false
% 0.30/0.53 % --inst_orphan_elimination true
% 0.30/0.53 % --inst_learning_loop_flag true
% 0.30/0.53 % --inst_learning_start 3000
% 0.30/0.53 % --inst_learning_factor 2
% 0.30/0.53 % --inst_start_prop_sim_after_learn 3
% 0.30/0.53 % --inst_sel_renew solver
% 0.30/0.53 % --inst_lit_activity_flag true
% 0.30/0.53 % --inst_out_proof true
% 0.30/0.53
% 0.30/0.53 % ------ Resolution Options
% 0.30/0.53
% 0.30/0.53 % --resolution_flag true
% 0.30/0.53 % --res_lit_sel kbo_max
% 0.30/0.53 % --res_to_prop_solver none
% 0.30/0.53 % --res_prop_simpl_new false
% 0.30/0.53 % --res_prop_simpl_given false
% 0.30/0.53 % --res_passive_queue_type priority_queues
% 0.30/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.30/0.53 % --res_passive_queues_freq [15;5]
% 0.30/0.53 % --res_forward_subs full
% 0.30/0.53 % --res_backward_subs full
% 0.30/0.53 % --res_forward_subs_resolution true
% 0.30/0.53 % --res_backward_subs_resolution true
% 0.30/0.53 % --res_orphan_elimination false
% 0.30/0.53 % --res_time_limit 1000.
% 0.30/0.53 % --res_out_proof true
% 0.30/0.53 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c815c7.s
% 0.30/0.53 % --modulo true
% 0.30/0.53
% 0.30/0.53 % ------ Combination Options
% 0.30/0.53
% 0.30/0.53 % --comb_res_mult 1000
% 0.30/0.53 % --comb_inst_mult 300
% 0.30/0.53 % ------
% 0.30/0.53
% 0.30/0.53 % ------ Parsing...% successful
% 0.30/0.53
% 0.30/0.53 % ------ 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.30/0.53
% 0.30/0.53 % ------ Proving...
% 0.30/0.53 % ------ Problem Properties
% 0.30/0.53
% 0.30/0.53 %
% 0.30/0.53 % EPR false
% 0.30/0.53 % Horn false
% 0.30/0.53 % Has equality true
% 0.30/0.53
% 0.30/0.53 % % ------ Input Options Time Limit: Unbounded
% 0.30/0.53
% 0.30/0.53
% 0.30/0.53 Compiling...
% 0.30/0.53 Loading plugin: done.
% 0.30/0.53 % % ------ Current options:
% 0.30/0.53
% 0.30/0.53 % ------ Input Options
% 0.30/0.53
% 0.30/0.53 % --out_options all
% 0.30/0.53 % --tptp_safe_out true
% 0.30/0.53 % --problem_path ""
% 0.30/0.53 % --include_path ""
% 0.30/0.53 % --clausifier .//eprover
% 0.30/0.53 % --clausifier_options --tstp-format
% 0.30/0.53 % --stdin false
% 0.30/0.53 % --dbg_backtrace false
% 0.30/0.53 % --dbg_dump_prop_clauses false
% 0.30/0.53 % --dbg_dump_prop_clauses_file -
% 0.30/0.53 % --dbg_out_stat false
% 0.30/0.53
% 0.30/0.53 % ------ General Options
% 0.30/0.53
% 0.30/0.53 % --fof false
% 0.30/0.53 % --time_out_real 150.
% 0.30/0.53 % --time_out_prep_mult 0.2
% 0.30/0.53 % --time_out_virtual -1.
% 0.30/0.53 % --schedule none
% 0.30/0.53 % --ground_splitting input
% 0.30/0.53 % --splitting_nvd 16
% 0.30/0.53 % --non_eq_to_eq false
% 0.30/0.53 % --prep_gs_sim true
% 0.30/0.53 % --prep_unflatten false
% 0.30/0.53 % --prep_res_sim true
% 0.30/0.53 % --prep_upred true
% 0.30/0.53 % --res_sim_input true
% 0.30/0.53 % --clause_weak_htbl true
% 0.30/0.53 % --gc_record_bc_elim false
% 0.30/0.53 % --symbol_type_check false
% 0.30/0.53 % --clausify_out false
% 0.30/0.53 % --large_theory_mode false
% 0.30/0.53 % --prep_sem_filter none
% 0.30/0.53 % --prep_sem_filter_out false
% 0.30/0.53 % --preprocessed_out false
% 0.30/0.53 % --sub_typing false
% 0.30/0.53 % --brand_transform false
% 0.30/0.53 % --pure_diseq_elim true
% 0.30/0.53 % --min_unsat_core false
% 0.30/0.53 % --pred_elim true
% 0.30/0.53 % --add_important_lit false
% 0.30/0.53 % --soft_assumptions false
% 0.30/0.53 % --reset_solvers false
% 0.30/0.53 % --bc_imp_inh []
% 0.30/0.53 % --conj_cone_tolerance 1.5
% 0.30/0.53 % --prolific_symb_bound 500
% 0.30/0.53 % --lt_threshold 2000
% 0.30/0.53
% 0.30/0.53 % ------ SAT Options
% 0.30/0.53
% 0.30/0.53 % --sat_mode false
% 0.30/0.53 % --sat_fm_restart_options ""
% 0.30/0.53 % --sat_gr_def false
% 0.30/0.53 % --sat_epr_types true
% 0.30/0.53 % --sat_non_cyclic_types false
% 0.30/0.53 % --sat_finite_models false
% 0.30/0.53 % --sat_fm_lemmas false
% 0.30/0.53 % --sat_fm_prep false
% 0.30/0.53 % --sat_fm_uc_incr true
% 0.30/0.53 % --sat_out_model small
% 0.30/0.53 % --sat_out_clauses false
% 0.30/0.53
% 0.30/0.53 % ------ QBF Options
% 0.30/0.53
% 0.30/0.53 % --qbf_mode false
% 0.30/0.53 % --qbf_elim_univ true
% 0.30/0.53 % --qbf_sk_in true
% 0.30/0.53 % --qbf_pred_elim true
% 0.30/0.53 % --qbf_split 32
% 0.30/0.53
% 0.30/0.53 % ------ BMC1 Options
% 0.30/0.53
% 0.30/0.53 % --bmc1_incremental false
% 0.30/0.53 % --bmc1_axioms reachable_all
% 0.30/0.53 % --bmc1_min_bound 0
% 0.30/0.53 % --bmc1_max_bound -1
% 0.30/0.53 % --bmc1_max_bound_default -1
% 0.30/0.53 % --bmc1_symbol_reachability true
% 0.30/0.53 % --bmc1_property_lemmas false
% 0.30/0.53 % --bmc1_k_induction false
% 0.30/0.53 % --bmc1_non_equiv_states false
% 0.30/0.53 % --bmc1_deadlock false
% 0.30/0.53 % --bmc1_ucm false
% 0.30/0.53 % --bmc1_add_unsat_core none
% 0.30/0.53 % --bmc1_unsat_core_children false
% 0.30/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.30/0.53 % --bmc1_out_stat full
% 0.30/0.53 % --bmc1_ground_init false
% 0.30/0.53 % --bmc1_pre_inst_next_state false
% 0.30/0.53 % --bmc1_pre_inst_state false
% 0.30/0.53 % --bmc1_pre_inst_reach_state false
% 0.30/0.53 % --bmc1_out_unsat_core false
% 0.30/0.53 % --bmc1_aig_witness_out false
% 0.30/0.53 % --bmc1_verbose false
% 0.30/0.53 % --bmc1_dump_clauses_tptp false
% 0.30/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.30/0.53 % --bmc1_dump_file -
% 0.30/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.30/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.30/0.53 % --bmc1_ucm_extend_mode 1
% 0.30/0.53 % --bmc1_ucm_init_mode 2
% 0.30/0.53 % --bmc1_ucm_cone_mode none
% 0.30/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.30/0.53 % --bmc1_ucm_relax_model 4
% 0.30/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.30/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.30/0.53 % --bmc1_ucm_layered_model none
% 0.30/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.30/0.53
% 0.30/0.53 % ------ AIG Options
% 0.30/0.53
% 0.30/0.53 % --aig_mode false
% 0.30/0.53
% 0.30/0.53 % ------ Instantiation Options
% 0.30/0.53
% 0.30/0.53 % --instantiation_flag true
% 0.30/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.30/0.53 % --inst_solver_per_active 750
% 0.30/0.53 % --inst_solver_calls_frac 0.5
% 0.30/0.53 % --inst_passive_queue_type priority_queues
% 0.30/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.30/0.53 % --inst_passive_queues_freq [25;2]
% 0.30/0.53 % --inst_dismatching true
% 0.30/0.53 % --inst_eager_unprocessed_to_passive true
% 0.99/1.23 % --inst_prop_sim_given true
% 0.99/1.23 % --inst_prop_sim_new false
% 0.99/1.23 % --inst_orphan_elimination true
% 0.99/1.23 % --inst_learning_loop_flag true
% 0.99/1.23 % --inst_learning_start 3000
% 0.99/1.23 % --inst_learning_factor 2
% 0.99/1.23 % --inst_start_prop_sim_after_learn 3
% 0.99/1.23 % --inst_sel_renew solver
% 0.99/1.23 % --inst_lit_activity_flag true
% 0.99/1.23 % --inst_out_proof true
% 0.99/1.23
% 0.99/1.23 % ------ Resolution Options
% 0.99/1.23
% 0.99/1.23 % --resolution_flag true
% 0.99/1.23 % --res_lit_sel kbo_max
% 0.99/1.23 % --res_to_prop_solver none
% 0.99/1.23 % --res_prop_simpl_new false
% 0.99/1.23 % --res_prop_simpl_given false
% 0.99/1.23 % --res_passive_queue_type priority_queues
% 0.99/1.23 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.99/1.23 % --res_passive_queues_freq [15;5]
% 0.99/1.23 % --res_forward_subs full
% 0.99/1.23 % --res_backward_subs full
% 0.99/1.23 % --res_forward_subs_resolution true
% 0.99/1.23 % --res_backward_subs_resolution true
% 0.99/1.23 % --res_orphan_elimination false
% 0.99/1.23 % --res_time_limit 1000.
% 0.99/1.23 % --res_out_proof true
% 0.99/1.23 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c815c7.s
% 0.99/1.23 % --modulo true
% 0.99/1.23
% 0.99/1.23 % ------ Combination Options
% 0.99/1.23
% 0.99/1.23 % --comb_res_mult 1000
% 0.99/1.23 % --comb_inst_mult 300
% 0.99/1.23 % ------
% 0.99/1.23
% 0.99/1.23
% 0.99/1.23
% 0.99/1.23 % ------ Proving...
% 0.99/1.23 %
% 0.99/1.23
% 0.99/1.23
% 0.99/1.23 % ------ Statistics
% 0.99/1.23
% 0.99/1.23 % ------ General
% 0.99/1.23
% 0.99/1.23 % num_of_input_clauses: 34
% 0.99/1.23 % num_of_input_neg_conjectures: 11
% 0.99/1.23 % num_of_splits: 0
% 0.99/1.23 % num_of_split_atoms: 0
% 0.99/1.23 % num_of_sem_filtered_clauses: 0
% 0.99/1.23 % num_of_subtypes: 0
% 0.99/1.23 % monotx_restored_types: 0
% 0.99/1.23 % sat_num_of_epr_types: 0
% 0.99/1.23 % sat_num_of_non_cyclic_types: 0
% 0.99/1.23 % sat_guarded_non_collapsed_types: 0
% 0.99/1.23 % is_epr: 0
% 0.99/1.23 % is_horn: 0
% 0.99/1.23 % has_eq: 1
% 0.99/1.23 % num_pure_diseq_elim: 0
% 0.99/1.23 % simp_replaced_by: 0
% 0.99/1.23 % res_preprocessed: 22
% 0.99/1.23 % prep_upred: 0
% 0.99/1.23 % prep_unflattend: 0
% 0.99/1.23 % pred_elim_cands: 0
% 0.99/1.23 % pred_elim: 0
% 0.99/1.23 % pred_elim_cl: 0
% 0.99/1.23 % pred_elim_cycles: 0
% 0.99/1.23 % forced_gc_time: 0
% 0.99/1.23 % gc_basic_clause_elim: 0
% 0.99/1.23 % parsing_time: 0.001
% 0.99/1.23 % sem_filter_time: 0.
% 0.99/1.23 % pred_elim_time: 0.
% 0.99/1.23 % out_proof_time: 0.
% 0.99/1.23 % monotx_time: 0.
% 0.99/1.23 % subtype_inf_time: 0.
% 0.99/1.23 % unif_index_cands_time: 0.003
% 0.99/1.23 % unif_index_add_time: 0.001
% 0.99/1.23 % total_time: 0.825
% 0.99/1.23 % num_of_symbols: 34
% 0.99/1.23 % num_of_terms: 2751
% 0.99/1.23
% 0.99/1.23 % ------ Propositional Solver
% 0.99/1.23
% 0.99/1.23 % prop_solver_calls: 9
% 0.99/1.23 % prop_fast_solver_calls: 54
% 0.99/1.23 % prop_num_of_clauses: 783
% 0.99/1.23 % prop_preprocess_simplified: 1425
% 0.99/1.23 % prop_fo_subsumed: 0
% 0.99/1.23 % prop_solver_time: 0.
% 0.99/1.23 % prop_fast_solver_time: 0.
% 0.99/1.23 % prop_unsat_core_time: 0.
% 0.99/1.23
% 0.99/1.23 % ------ QBF
% 0.99/1.23
% 0.99/1.23 % qbf_q_res: 0
% 0.99/1.23 % qbf_num_tautologies: 0
% 0.99/1.23 % qbf_prep_cycles: 0
% 0.99/1.23
% 0.99/1.23 % ------ BMC1
% 0.99/1.23
% 0.99/1.23 % bmc1_current_bound: -1
% 0.99/1.23 % bmc1_last_solved_bound: -1
% 0.99/1.23 % bmc1_unsat_core_size: -1
% 0.99/1.23 % bmc1_unsat_core_parents_size: -1
% 0.99/1.23 % bmc1_merge_next_fun: 0
% 0.99/1.23 % bmc1_unsat_core_clauses_time: 0.
% 0.99/1.23
% 0.99/1.23 % ------ Instantiation
% 0.99/1.23
% 0.99/1.23 % inst_num_of_clauses: 677
% 0.99/1.23 % inst_num_in_passive: 403
% 0.99/1.23 % inst_num_in_active: 265
% 0.99/1.23 % inst_num_in_unprocessed: 2
% 0.99/1.23 % inst_num_of_loops: 293
% 0.99/1.23 % inst_num_of_learning_restarts: 0
% 0.99/1.23 % inst_num_moves_active_passive: 21
% 0.99/1.23 % inst_lit_activity: 132
% 0.99/1.23 % inst_lit_activity_moves: 0
% 0.99/1.23 % inst_num_tautologies: 5
% 0.99/1.23 % inst_num_prop_implied: 0
% 0.99/1.23 % inst_num_existing_simplified: 0
% 0.99/1.23 % inst_num_eq_res_simplified: 0
% 0.99/1.23 % inst_num_child_elim: 0
% 0.99/1.23 % inst_num_of_dismatching_blockings: 380
% 0.99/1.23 % inst_num_of_non_proper_insts: 1106
% 0.99/1.23 % inst_num_of_duplicates: 723
% 0.99/1.23 % inst_inst_num_from_inst_to_res: 0
% 0.99/1.23 % inst_dismatching_checking_time: 0.002
% 0.99/1.23
% 0.99/1.23 % ------ Resolution
% 0.99/1.23
% 0.99/1.23 % res_num_of_clauses: 7657
% 0.99/1.23 % res_num_in_passive: 7072
% 0.99/1.23 % res_num_in_active: 644
% 0.99/1.23 % res_num_of_loops: 1000
% 0.99/1.23 % res_forward_subset_subsumed: 5733
% 0.99/1.23 % res_backward_subset_subsumed: 93
% 0.99/1.23 % res_forward_subsumed: 369
% 0.99/1.23 % res_backward_subsumed: 0
% 0.99/1.23 % res_forward_subsumption_resolution: 24
% 0.99/1.23 % res_backward_subsumption_resolution: 0
% 0.99/1.23 % res_clause_to_clause_subsumption: 36418
% 0.99/1.23 % res_orphan_elimination: 0
% 0.99/1.23 % res_tautology_del: 697
% 0.99/1.23 % res_num_eq_res_simplified: 0
% 0.99/1.23 % res_num_sel_changes: 0
% 0.99/1.23 % res_moves_from_active_to_pass: 0
% 0.99/1.23
% 0.99/1.24 % Status Unsatisfiable
% 0.99/1.24 % SZS status Unsatisfiable
% 0.99/1.24 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------