TSTP Solution File: MGT013-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:13:43 EDT 2022
% Result : Unsatisfiable 9.01s 9.22s
% Output : CNFRefutation 9.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 33
% Syntax : Number of formulae : 154 ( 55 unt; 0 def)
% Number of atoms : 513 ( 58 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 737 ( 378 ~; 359 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 295 ( 6 sgn 78 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3,X4,X5] :
( ~ organization(X5,X4)
| ~ organization(X5,X3)
| ~ complexity(X5,X2,X4)
| ~ complexity(X5,X1,X3)
| X4 != X3
| X2 = X1 ),
file('<stdin>',mp18_23) ).
fof(c_0_1,axiom,
! [X3,X4,X5] :
( ~ reorganization_free(X5,X4,X3)
| reorganization_free(X5,X3,X4) ),
file('<stdin>',mp17_22) ).
fof(c_0_2,axiom,
! [X4,X5] :
( ~ time(X5)
| ~ time(X4)
| greater(X5,X4)
| X5 = X4
| greater(X4,X5) ),
file('<stdin>',mp16_21) ).
fof(c_0_3,axiom,
! [X4,X5] :
( ~ greater(X5,X4)
| ~ greater(X4,X5) ),
file('<stdin>',mp6_2_19) ).
fof(c_0_4,axiom,
! [X4,X5] :
( ~ organization(X5,X4)
| time(X4) ),
file('<stdin>',mp15_20) ).
fof(c_0_5,axiom,
! [X4,X5] :
( ~ greater(X5,X4)
| X5 != X4 ),
file('<stdin>',mp6_1_18) ).
fof(c_0_6,plain,
! [X1,X2,X3,X4,X5] :
( ~ organization(X5,X4)
| ~ organization(X5,X3)
| ~ complexity(X5,X2,X4)
| ~ complexity(X5,X1,X3)
| X4 != X3
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_7,plain,
! [X3,X4,X5] :
( ~ reorganization_free(X5,X4,X3)
| reorganization_free(X5,X3,X4) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_8,plain,
! [X4,X5] :
( ~ time(X5)
| ~ time(X4)
| greater(X5,X4)
| X5 = X4
| greater(X4,X5) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_9,plain,
! [X4,X5] :
( ~ greater(X5,X4)
| ~ greater(X4,X5) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_10,plain,
! [X4,X5] :
( ~ organization(X5,X4)
| time(X4) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X4,X5] :
( ~ greater(X5,X4)
| X5 != X4 ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X6,X7,X8,X9,X10] :
( ~ organization(X10,X9)
| ~ organization(X10,X8)
| ~ complexity(X10,X7,X9)
| ~ complexity(X10,X6,X8)
| X9 != X8
| X7 = X6 ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X6,X7,X8] :
( ~ reorganization_free(X8,X7,X6)
| reorganization_free(X8,X6,X7) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X6,X7] :
( ~ time(X7)
| ~ time(X6)
| greater(X7,X6)
| X7 = X6
| greater(X6,X7) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X6,X7] :
( ~ greater(X7,X6)
| ~ greater(X6,X7) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X6,X7] :
( ~ organization(X7,X6)
| time(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_10])])]) ).
fof(c_0_17,plain,
! [X6,X7] :
( ~ greater(X7,X6)
| X7 != X6 ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( X1 = X2
| X3 != X4
| ~ complexity(X5,X2,X4)
| ~ complexity(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( greater(X1,X2)
| X2 = X1
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( time(X1)
| ~ organization(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( X1 = X2
| X3 != X4
| ~ complexity(X5,X2,X4)
| ~ complexity(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
c_0_18,
[final] ).
cnf(c_0_25,plain,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
c_0_19,
[final] ).
cnf(c_0_26,plain,
( greater(X1,X2)
| X2 = X1
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
c_0_20,
[final] ).
cnf(c_0_27,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
c_0_21,
[final] ).
cnf(c_0_28,plain,
( time(X1)
| ~ organization(X2,X1) ),
c_0_22,
[final] ).
cnf(c_0_29,plain,
( X1 != X2
| ~ greater(X1,X2) ),
c_0_23,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_24_0,axiom,
( X1 = X2
| X3 != X4
| ~ complexity(X5,X2,X4)
| ~ complexity(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( X3 != X4
| X1 = X2
| ~ complexity(X5,X2,X4)
| ~ complexity(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_2,axiom,
( ~ complexity(X5,X2,X4)
| X3 != X4
| X1 = X2
| ~ complexity(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_3,axiom,
( ~ complexity(X5,X1,X3)
| ~ complexity(X5,X2,X4)
| X3 != X4
| X1 = X2
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_4,axiom,
( ~ organization(X5,X4)
| ~ complexity(X5,X1,X3)
| ~ complexity(X5,X2,X4)
| X3 != X4
| X1 = X2
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_5,axiom,
( ~ organization(X5,X3)
| ~ organization(X5,X4)
| ~ complexity(X5,X1,X3)
| ~ complexity(X5,X2,X4)
| X3 != X4
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_25_0,axiom,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_1,axiom,
( ~ reorganization_free(X1,X3,X2)
| reorganization_free(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_26_0,axiom,
( greater(X1,X2)
| X2 = X1
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_1,axiom,
( X2 = X1
| greater(X1,X2)
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_2,axiom,
( greater(X2,X1)
| X2 = X1
| greater(X1,X2)
| ~ time(X1)
| ~ time(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_3,axiom,
( ~ time(X1)
| greater(X2,X1)
| X2 = X1
| greater(X1,X2)
| ~ time(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_4,axiom,
( ~ time(X2)
| ~ time(X1)
| greater(X2,X1)
| X2 = X1
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_27_0,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_0,axiom,
( time(X1)
| ~ organization(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( ~ organization(X2,X1)
| time(X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( X1 != X2
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,hypothesis,
! [X1,X2,X3,X4,X5] :
( ~ organization(X5,X4)
| ~ organization(X5,X3)
| ~ reorganization_free(X5,X4,X3)
| ~ complexity(X5,X2,X4)
| ~ complexity(X5,X1,X3)
| ~ greater(X3,X4)
| ~ greater(X2,X1) ),
file('<stdin>',t12_FOL_25) ).
fof(c_0_1_002,hypothesis,
! [X1,X2,X3,X4,X5] :
( ~ organization(X5,X4)
| ~ organization(X5,X3)
| ~ reorganization_free(X5,X4,X3)
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3)
| ~ greater(X3,X4)
| ~ greater(X2,X1) ),
file('<stdin>',t11_FOL_24) ).
fof(c_0_2_003,negated_conjecture,
size(sk1,sk5,sk7),
file('<stdin>',t13_FOL_32) ).
fof(c_0_3_004,negated_conjecture,
size(sk1,sk4,sk6),
file('<stdin>',t13_FOL_31) ).
fof(c_0_4_005,negated_conjecture,
complexity(sk1,sk3,sk7),
file('<stdin>',t13_FOL_30) ).
fof(c_0_5_006,negated_conjecture,
complexity(sk1,sk2,sk6),
file('<stdin>',t13_FOL_29) ).
fof(c_0_6_007,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('<stdin>',t13_FOL_28) ).
fof(c_0_7_008,negated_conjecture,
greater(sk4,sk5),
file('<stdin>',t13_FOL_34) ).
fof(c_0_8_009,negated_conjecture,
greater(sk3,sk2),
file('<stdin>',t13_FOL_33) ).
fof(c_0_9_010,negated_conjecture,
organization(sk1,sk7),
file('<stdin>',t13_FOL_27) ).
fof(c_0_10_011,negated_conjecture,
organization(sk1,sk6),
file('<stdin>',t13_FOL_26) ).
fof(c_0_11_012,hypothesis,
! [X1,X2,X3,X4,X5] :
( ~ organization(X5,X4)
| ~ organization(X5,X3)
| ~ reorganization_free(X5,X4,X3)
| ~ complexity(X5,X2,X4)
| ~ complexity(X5,X1,X3)
| ~ greater(X3,X4)
| ~ greater(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_12_013,hypothesis,
! [X1,X2,X3,X4,X5] :
( ~ organization(X5,X4)
| ~ organization(X5,X3)
| ~ reorganization_free(X5,X4,X3)
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3)
| ~ greater(X3,X4)
| ~ greater(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_13_014,negated_conjecture,
size(sk1,sk5,sk7),
c_0_2 ).
fof(c_0_14_015,negated_conjecture,
size(sk1,sk4,sk6),
c_0_3 ).
fof(c_0_15_016,negated_conjecture,
complexity(sk1,sk3,sk7),
c_0_4 ).
fof(c_0_16_017,negated_conjecture,
complexity(sk1,sk2,sk6),
c_0_5 ).
fof(c_0_17_018,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
c_0_6 ).
fof(c_0_18_019,negated_conjecture,
greater(sk4,sk5),
c_0_7 ).
fof(c_0_19_020,negated_conjecture,
greater(sk3,sk2),
c_0_8 ).
fof(c_0_20_021,negated_conjecture,
organization(sk1,sk7),
c_0_9 ).
fof(c_0_21_022,negated_conjecture,
organization(sk1,sk6),
c_0_10 ).
fof(c_0_22_023,hypothesis,
! [X6,X7,X8,X9,X10] :
( ~ organization(X10,X9)
| ~ organization(X10,X8)
| ~ reorganization_free(X10,X9,X8)
| ~ complexity(X10,X7,X9)
| ~ complexity(X10,X6,X8)
| ~ greater(X8,X9)
| ~ greater(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_23_024,hypothesis,
! [X6,X7,X8,X9,X10] :
( ~ organization(X10,X9)
| ~ organization(X10,X8)
| ~ reorganization_free(X10,X9,X8)
| ~ size(X10,X7,X9)
| ~ size(X10,X6,X8)
| ~ greater(X8,X9)
| ~ greater(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_24_025,negated_conjecture,
size(sk1,sk5,sk7),
c_0_13 ).
fof(c_0_25_026,negated_conjecture,
size(sk1,sk4,sk6),
c_0_14 ).
fof(c_0_26_027,negated_conjecture,
complexity(sk1,sk3,sk7),
c_0_15 ).
fof(c_0_27_028,negated_conjecture,
complexity(sk1,sk2,sk6),
c_0_16 ).
fof(c_0_28_029,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
c_0_17 ).
fof(c_0_29_030,negated_conjecture,
greater(sk4,sk5),
c_0_18 ).
fof(c_0_30,negated_conjecture,
greater(sk3,sk2),
c_0_19 ).
fof(c_0_31,negated_conjecture,
organization(sk1,sk7),
c_0_20 ).
fof(c_0_32,negated_conjecture,
organization(sk1,sk6),
c_0_21 ).
cnf(c_0_33,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ complexity(X5,X2,X3)
| ~ complexity(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ size(X5,X2,X3)
| ~ size(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
size(sk1,sk5,sk7),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,negated_conjecture,
size(sk1,sk4,sk6),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,negated_conjecture,
complexity(sk1,sk3,sk7),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,negated_conjecture,
complexity(sk1,sk2,sk6),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,negated_conjecture,
greater(sk4,sk5),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,negated_conjecture,
greater(sk3,sk2),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,negated_conjecture,
organization(sk1,sk7),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,negated_conjecture,
organization(sk1,sk6),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ complexity(X5,X2,X3)
| ~ complexity(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
c_0_33,
[final] ).
cnf(c_0_45,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ size(X5,X2,X3)
| ~ size(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
c_0_34,
[final] ).
cnf(c_0_46,negated_conjecture,
size(sk1,sk5,sk7),
c_0_35,
[final] ).
cnf(c_0_47,negated_conjecture,
size(sk1,sk4,sk6),
c_0_36,
[final] ).
cnf(c_0_48,negated_conjecture,
complexity(sk1,sk3,sk7),
c_0_37,
[final] ).
cnf(c_0_49,negated_conjecture,
complexity(sk1,sk2,sk6),
c_0_38,
[final] ).
cnf(c_0_50,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
c_0_39,
[final] ).
cnf(c_0_51,negated_conjecture,
greater(sk4,sk5),
c_0_40,
[final] ).
cnf(c_0_52,negated_conjecture,
greater(sk3,sk2),
c_0_41,
[final] ).
cnf(c_0_53,negated_conjecture,
organization(sk1,sk7),
c_0_42,
[final] ).
cnf(c_0_54,negated_conjecture,
organization(sk1,sk6),
c_0_43,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_20,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_45) ).
cnf(c_38,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_77,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2) ),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_96,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2) ),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_99,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2) ),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_129,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2) ),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_67208,plain,
( ~ organization(sk1,sk6)
| ~ organization(sk1,X0)
| ~ reorganization_free(sk1,sk6,X0)
| ~ greater(X0,sk6)
| ~ greater(X1,X2)
| ~ size(sk1,X1,sk6)
| ~ size(sk1,X2,X0) ),
inference(instantiation,[status(thm)],[c_129]) ).
cnf(c_67243,plain,
( ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk6,sk7)
| ~ greater(sk7,sk6)
| ~ greater(X0,X1)
| ~ size(sk1,X1,sk7)
| ~ size(sk1,X0,sk6) ),
inference(instantiation,[status(thm)],[c_67208]) ).
cnf(c_67290,plain,
( ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk6,sk7)
| ~ greater(sk7,sk6)
| ~ greater(X0,sk5)
| ~ size(sk1,sk5,sk7)
| ~ size(sk1,X0,sk6) ),
inference(instantiation,[status(thm)],[c_67243]) ).
cnf(c_67292,plain,
( ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk6,sk7)
| ~ greater(sk7,sk6)
| ~ greater(sk4,sk5)
| ~ size(sk1,sk5,sk7)
| ~ size(sk1,sk4,sk6) ),
inference(instantiation,[status(thm)],[c_67290]) ).
cnf(c_19,plain,
( ~ complexity(X0,X1,X2)
| ~ complexity(X0,X3,X4)
| ~ organization(X0,X2)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X2,X4)
| ~ greater(X4,X2)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_44) ).
cnf(c_36,plain,
( ~ complexity(X0,X1,X2)
| ~ complexity(X0,X3,X4)
| ~ organization(X0,X2)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X2,X4)
| ~ greater(X4,X2)
| ~ greater(X1,X3) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_76,plain,
( ~ complexity(X0,X1,X2)
| ~ complexity(X0,X3,X4)
| ~ organization(X0,X2)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X2,X4)
| ~ greater(X4,X2)
| ~ greater(X1,X3) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_97,plain,
( ~ complexity(X0,X1,X2)
| ~ complexity(X0,X3,X4)
| ~ organization(X0,X2)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X2,X4)
| ~ greater(X4,X2)
| ~ greater(X1,X3) ),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_98,plain,
( ~ complexity(X0,X1,X2)
| ~ complexity(X0,X3,X4)
| ~ organization(X0,X2)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X2,X4)
| ~ greater(X4,X2)
| ~ greater(X1,X3) ),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_128,plain,
( ~ complexity(X0,X1,X2)
| ~ complexity(X0,X3,X4)
| ~ organization(X0,X2)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X2,X4)
| ~ greater(X4,X2)
| ~ greater(X1,X3) ),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_67205,plain,
( ~ complexity(sk1,X0,sk7)
| ~ complexity(sk1,X1,X2)
| ~ organization(sk1,sk7)
| ~ organization(sk1,X2)
| ~ reorganization_free(sk1,sk7,X2)
| ~ greater(X2,sk7)
| ~ greater(X0,X1) ),
inference(instantiation,[status(thm)],[c_128]) ).
cnf(c_67238,plain,
( ~ complexity(sk1,X0,sk7)
| ~ complexity(sk1,X1,sk6)
| ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk7,sk6)
| ~ greater(sk6,sk7)
| ~ greater(X0,X1) ),
inference(instantiation,[status(thm)],[c_67205]) ).
cnf(c_67280,plain,
( ~ complexity(sk1,sk3,sk7)
| ~ complexity(sk1,X0,sk6)
| ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk7,sk6)
| ~ greater(sk6,sk7)
| ~ greater(sk3,X0) ),
inference(instantiation,[status(thm)],[c_67238]) ).
cnf(c_67284,plain,
( ~ complexity(sk1,sk3,sk7)
| ~ complexity(sk1,sk2,sk6)
| ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk7,sk6)
| ~ greater(sk6,sk7)
| ~ greater(sk3,sk2) ),
inference(instantiation,[status(thm)],[c_67280]) ).
cnf(c_0,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ complexity(X0,X3,X1)
| ~ complexity(X0,X4,X2)
| X1 != X2
| X3 = X4 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_24_0) ).
cnf(c_109,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ complexity(X0,X3,X1)
| ~ complexity(X0,X4,X2)
| X1 != X2
| X3 = X4 ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_67189,plain,
( ~ complexity(sk1,X0,sk7)
| ~ complexity(sk1,X1,X2)
| ~ organization(sk1,sk7)
| ~ organization(sk1,X2)
| sk7 != X2
| X0 = X1 ),
inference(instantiation,[status(thm)],[c_109]) ).
cnf(c_67227,plain,
( ~ complexity(sk1,X0,sk7)
| ~ complexity(sk1,X1,sk6)
| ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| sk7 != sk6
| X0 = X1 ),
inference(instantiation,[status(thm)],[c_67189]) ).
cnf(c_67268,plain,
( ~ complexity(sk1,sk3,sk7)
| ~ complexity(sk1,X0,sk6)
| ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| sk7 != sk6
| sk3 = X0 ),
inference(instantiation,[status(thm)],[c_67227]) ).
cnf(c_67276,plain,
( ~ complexity(sk1,sk3,sk7)
| ~ complexity(sk1,sk2,sk6)
| ~ organization(sk1,sk7)
| ~ organization(sk1,sk6)
| sk7 != sk6
| sk3 = sk2 ),
inference(instantiation,[status(thm)],[c_67268]) ).
cnf(c_11,plain,
( ~ time(X0)
| greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ time(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_26_3) ).
cnf(c_120,plain,
( ~ time(X0)
| greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ time(X1) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_67210,plain,
( greater(sk7,X0)
| greater(X0,sk7)
| ~ time(sk7)
| ~ time(X0)
| sk7 = X0 ),
inference(instantiation,[status(thm)],[c_120]) ).
cnf(c_67248,plain,
( greater(sk7,sk6)
| greater(sk6,sk7)
| ~ time(sk7)
| ~ time(sk6)
| sk7 = sk6 ),
inference(instantiation,[status(thm)],[c_67210]) ).
cnf(c_6,plain,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_25_0) ).
cnf(c_115,plain,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_67187,plain,
( reorganization_free(sk1,sk7,sk6)
| ~ reorganization_free(sk1,sk6,sk7) ),
inference(instantiation,[status(thm)],[c_115]) ).
cnf(c_17,plain,
( ~ greater(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_29_0) ).
cnf(c_126,plain,
( ~ greater(X0,X1)
| X0 != X1 ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_67184,plain,
( ~ greater(sk3,sk2)
| sk3 != sk2 ),
inference(instantiation,[status(thm)],[c_126]) ).
cnf(c_15,plain,
( ~ organization(X0,X1)
| time(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_28_0) ).
cnf(c_124,plain,
( ~ organization(X0,X1)
| time(X1) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_67178,plain,
( ~ organization(sk1,sk6)
| time(sk6) ),
inference(instantiation,[status(thm)],[c_124]) ).
cnf(c_67177,plain,
( ~ organization(sk1,sk7)
| time(sk7) ),
inference(instantiation,[status(thm)],[c_124]) ).
cnf(c_21,negated_conjecture,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_46) ).
cnf(c_22,negated_conjecture,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_47) ).
cnf(c_23,negated_conjecture,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_48) ).
cnf(c_24,negated_conjecture,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_49) ).
cnf(c_25,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_50) ).
cnf(c_26,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_51) ).
cnf(c_27,negated_conjecture,
greater(sk3,sk2),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_52) ).
cnf(c_28,negated_conjecture,
organization(sk1,sk7),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_53) ).
cnf(c_29,negated_conjecture,
organization(sk1,sk6),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p',c_0_54) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_67292,c_67284,c_67276,c_67248,c_67187,c_67184,c_67178,c_67177,c_21,c_22,c_23,c_24,c_25,c_26,c_27,c_28,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n021.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 : Thu Jun 9 09:29:23 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_d4bbba.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_d347ea.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_76b456 | 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.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_d4bbba.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ 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.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % ------ Problem Properties
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % EPR true
% 0.20/0.44 % Horn false
% 0.20/0.44 % Has equality true
% 0.20/0.44
% 0.20/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % % ------ Current options:
% 0.20/0.44
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 9.01/9.22 % --inst_prop_sim_new false
% 9.01/9.22 % --inst_orphan_elimination true
% 9.01/9.22 % --inst_learning_loop_flag true
% 9.01/9.22 % --inst_learning_start 3000
% 9.01/9.22 % --inst_learning_factor 2
% 9.01/9.22 % --inst_start_prop_sim_after_learn 3
% 9.01/9.22 % --inst_sel_renew solver
% 9.01/9.22 % --inst_lit_activity_flag true
% 9.01/9.22 % --inst_out_proof true
% 9.01/9.22
% 9.01/9.22 % ------ Resolution Options
% 9.01/9.22
% 9.01/9.22 % --resolution_flag true
% 9.01/9.22 % --res_lit_sel kbo_max
% 9.01/9.22 % --res_to_prop_solver none
% 9.01/9.22 % --res_prop_simpl_new false
% 9.01/9.22 % --res_prop_simpl_given false
% 9.01/9.22 % --res_passive_queue_type priority_queues
% 9.01/9.22 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 9.01/9.22 % --res_passive_queues_freq [15;5]
% 9.01/9.22 % --res_forward_subs full
% 9.01/9.22 % --res_backward_subs full
% 9.01/9.22 % --res_forward_subs_resolution true
% 9.01/9.22 % --res_backward_subs_resolution true
% 9.01/9.22 % --res_orphan_elimination false
% 9.01/9.22 % --res_time_limit 1000.
% 9.01/9.22 % --res_out_proof true
% 9.01/9.22 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_d4bbba.s
% 9.01/9.22 % --modulo true
% 9.01/9.22
% 9.01/9.22 % ------ Combination Options
% 9.01/9.22
% 9.01/9.22 % --comb_res_mult 1000
% 9.01/9.22 % --comb_inst_mult 300
% 9.01/9.22 % ------
% 9.01/9.22
% 9.01/9.22
% 9.01/9.22
% 9.01/9.22 % ------ Proving...
% 9.01/9.22 %
% 9.01/9.22
% 9.01/9.22
% 9.01/9.22 % ------ Statistics
% 9.01/9.22
% 9.01/9.22 % ------ General
% 9.01/9.22
% 9.01/9.22 % num_of_input_clauses: 30
% 9.01/9.22 % num_of_input_neg_conjectures: 9
% 9.01/9.22 % num_of_splits: 0
% 9.01/9.22 % num_of_split_atoms: 0
% 9.01/9.22 % num_of_sem_filtered_clauses: 0
% 9.01/9.22 % num_of_subtypes: 0
% 9.01/9.22 % monotx_restored_types: 0
% 9.01/9.22 % sat_num_of_epr_types: 0
% 9.01/9.22 % sat_num_of_non_cyclic_types: 0
% 9.01/9.22 % sat_guarded_non_collapsed_types: 0
% 9.01/9.22 % is_epr: 1
% 9.01/9.22 % is_horn: 0
% 9.01/9.22 % has_eq: 1
% 9.01/9.22 % num_pure_diseq_elim: 0
% 9.01/9.22 % simp_replaced_by: 0
% 9.01/9.22 % res_preprocessed: 20
% 9.01/9.22 % prep_upred: 0
% 9.01/9.22 % prep_unflattend: 0
% 9.01/9.22 % pred_elim_cands: 0
% 9.01/9.22 % pred_elim: 0
% 9.01/9.22 % pred_elim_cl: 0
% 9.01/9.22 % pred_elim_cycles: 0
% 9.01/9.22 % forced_gc_time: 0
% 9.01/9.22 % gc_basic_clause_elim: 0
% 9.01/9.22 % parsing_time: 0.001
% 9.01/9.22 % sem_filter_time: 0.
% 9.01/9.22 % pred_elim_time: 0.
% 9.01/9.22 % out_proof_time: 0.001
% 9.01/9.22 % monotx_time: 0.
% 9.01/9.22 % subtype_inf_time: 0.
% 9.01/9.22 % unif_index_cands_time: 0.001
% 9.01/9.22 % unif_index_add_time: 0.001
% 9.01/9.22 % total_time: 8.811
% 9.01/9.22 % num_of_symbols: 38
% 9.01/9.22 % num_of_terms: 2782
% 9.01/9.22
% 9.01/9.22 % ------ Propositional Solver
% 9.01/9.22
% 9.01/9.22 % prop_solver_calls: 8
% 9.01/9.22 % prop_fast_solver_calls: 55
% 9.01/9.22 % prop_num_of_clauses: 111
% 9.01/9.22 % prop_preprocess_simplified: 326
% 9.01/9.22 % prop_fo_subsumed: 0
% 9.01/9.22 % prop_solver_time: 0.
% 9.01/9.22 % prop_fast_solver_time: 0.
% 9.01/9.22 % prop_unsat_core_time: 0.
% 9.01/9.22
% 9.01/9.22 % ------ QBF
% 9.01/9.22
% 9.01/9.22 % qbf_q_res: 0
% 9.01/9.22 % qbf_num_tautologies: 0
% 9.01/9.22 % qbf_prep_cycles: 0
% 9.01/9.22
% 9.01/9.22 % ------ BMC1
% 9.01/9.22
% 9.01/9.22 % bmc1_current_bound: -1
% 9.01/9.22 % bmc1_last_solved_bound: -1
% 9.01/9.22 % bmc1_unsat_core_size: -1
% 9.01/9.22 % bmc1_unsat_core_parents_size: -1
% 9.01/9.22 % bmc1_merge_next_fun: 0
% 9.01/9.22 % bmc1_unsat_core_clauses_time: 0.
% 9.01/9.22
% 9.01/9.22 % ------ Instantiation
% 9.01/9.22
% 9.01/9.22 % inst_num_of_clauses: 90
% 9.01/9.22 % inst_num_in_passive: 1
% 9.01/9.22 % inst_num_in_active: 83
% 9.01/9.22 % inst_num_in_unprocessed: 0
% 9.01/9.22 % inst_num_of_loops: 103
% 9.01/9.22 % inst_num_of_learning_restarts: 0
% 9.01/9.22 % inst_num_moves_active_passive: 11
% 9.01/9.22 % inst_lit_activity: 18
% 9.01/9.22 % inst_lit_activity_moves: 0
% 9.01/9.22 % inst_num_tautologies: 0
% 9.01/9.22 % inst_num_prop_implied: 0
% 9.01/9.22 % inst_num_existing_simplified: 0
% 9.01/9.22 % inst_num_eq_res_simplified: 4
% 9.01/9.22 % inst_num_child_elim: 0
% 9.01/9.22 % inst_num_of_dismatching_blockings: 0
% 9.01/9.22 % inst_num_of_non_proper_insts: 63
% 9.01/9.22 % inst_num_of_duplicates: 31
% 9.01/9.22 % inst_inst_num_from_inst_to_res: 0
% 9.01/9.22 % inst_dismatching_checking_time: 0.
% 9.01/9.22
% 9.01/9.22 % ------ Resolution
% 9.01/9.22
% 9.01/9.22 % res_num_of_clauses: 543
% 9.01/9.22 % res_num_in_passive: 6
% 9.01/9.22 % res_num_in_active: 524
% 9.01/9.22 % res_num_of_loops: 1000
% 9.01/9.22 % res_forward_subset_subsumed: 414
% 9.01/9.22 % res_backward_subset_subsumed: 0
% 9.01/9.22 % res_forward_subsumed: 102
% 9.01/9.22 % res_backward_subsumed: 1
% 9.01/9.22 % res_forward_subsumption_resolution: 1305
% 9.01/9.22 % res_backward_subsumption_resolution: 3
% 9.01/9.22 % res_clause_to_clause_subsumption: 216902
% 9.01/9.22 % res_orphan_elimination: 0
% 9.01/9.22 % res_tautology_del: 1
% 9.01/9.22 % res_num_eq_res_simplified: 2
% 9.01/9.22 % res_num_sel_changes: 0
% 9.01/9.22 % res_moves_from_active_to_pass: 0
% 9.01/9.22
% 9.01/9.22 % Status Unsatisfiable
% 9.01/9.22 % SZS status Unsatisfiable
% 9.01/9.22 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------