TSTP Solution File: MGT009-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT009-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n032.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:42 EDT 2022
% Result : Unsatisfiable 0.16s 0.38s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 31
% Syntax : Number of formulae : 204 ( 137 unt; 0 def)
% Number of atoms : 591 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 793 ( 406 ~; 387 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 359 ( 20 sgn 81 !; 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] :
( ~ organization(X2,X1)
| inertia(X2,sk1(X1,X2),X1) ),
file('<stdin>',mp5_1) ).
fof(c_0_1,plain,
! [X1,X2] :
( ~ organization(X2,X1)
| inertia(X2,sk1(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2,plain,
! [X3,X4] :
( ~ organization(X4,X3)
| inertia(X4,sk1(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3,plain,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
c_0_3,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_4_0,axiom,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_1,axiom,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,hypothesis,
! [X9,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ organization(X8,X7)
| ~ organization(X6,X5)
| ~ class(X8,X4,X7)
| ~ class(X6,X4,X5)
| ~ size(X8,X3,X7)
| ~ size(X6,X2,X5)
| ~ inertia(X8,X1,X7)
| ~ inertia(X6,X9,X5)
| ~ greater(X2,X3)
| greater(X9,X1) ),
file('<stdin>',a5_FOL_4) ).
fof(c_0_1_002,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ organization(X8,X7)
| ~ organization(X6,X5)
| ~ reorganization_free(X8,X7,X7)
| ~ reorganization_free(X6,X5,X5)
| ~ reproducibility(X8,X4,X7)
| ~ reproducibility(X6,X3,X5)
| ~ inertia(X8,X2,X7)
| ~ inertia(X6,X1,X5)
| ~ greater(X1,X2)
| greater(X3,X4) ),
file('<stdin>',a3_FOL_3) ).
fof(c_0_2_003,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ organization(X8,X7)
| ~ organization(X6,X5)
| ~ reorganization_free(X8,X7,X7)
| ~ reorganization_free(X6,X5,X5)
| ~ reproducibility(X8,X4,X7)
| ~ reproducibility(X6,X3,X5)
| ~ inertia(X8,X2,X7)
| ~ inertia(X6,X1,X5)
| ~ greater(X3,X4)
| greater(X1,X2) ),
file('<stdin>',a3_FOL_2) ).
fof(c_0_3_004,negated_conjecture,
size(sk3,sk8,sk10),
file('<stdin>',t9_FOL_14) ).
fof(c_0_4_005,negated_conjecture,
size(sk2,sk7,sk9),
file('<stdin>',t9_FOL_13) ).
fof(c_0_5,negated_conjecture,
reproducibility(sk3,sk6,sk10),
file('<stdin>',t9_FOL_12) ).
fof(c_0_6,negated_conjecture,
reproducibility(sk2,sk5,sk9),
file('<stdin>',t9_FOL_11) ).
fof(c_0_7,negated_conjecture,
class(sk3,sk4,sk10),
file('<stdin>',t9_FOL_10) ).
fof(c_0_8,negated_conjecture,
class(sk2,sk4,sk9),
file('<stdin>',t9_FOL_9) ).
fof(c_0_9,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
file('<stdin>',t9_FOL_8) ).
fof(c_0_10,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
file('<stdin>',t9_FOL_7) ).
fof(c_0_11,negated_conjecture,
~ greater(sk6,sk5),
file('<stdin>',t9_FOL_16) ).
fof(c_0_12,negated_conjecture,
greater(sk8,sk7),
file('<stdin>',t9_FOL_15) ).
fof(c_0_13,negated_conjecture,
organization(sk3,sk10),
file('<stdin>',t9_FOL_6) ).
fof(c_0_14,negated_conjecture,
organization(sk2,sk9),
file('<stdin>',t9_FOL_5) ).
fof(c_0_15,hypothesis,
! [X9,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ organization(X8,X7)
| ~ organization(X6,X5)
| ~ class(X8,X4,X7)
| ~ class(X6,X4,X5)
| ~ size(X8,X3,X7)
| ~ size(X6,X2,X5)
| ~ inertia(X8,X1,X7)
| ~ inertia(X6,X9,X5)
| ~ greater(X2,X3)
| greater(X9,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_16,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ organization(X8,X7)
| ~ organization(X6,X5)
| ~ reorganization_free(X8,X7,X7)
| ~ reorganization_free(X6,X5,X5)
| ~ reproducibility(X8,X4,X7)
| ~ reproducibility(X6,X3,X5)
| ~ inertia(X8,X2,X7)
| ~ inertia(X6,X1,X5)
| ~ greater(X1,X2)
| greater(X3,X4) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_17,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ organization(X8,X7)
| ~ organization(X6,X5)
| ~ reorganization_free(X8,X7,X7)
| ~ reorganization_free(X6,X5,X5)
| ~ reproducibility(X8,X4,X7)
| ~ reproducibility(X6,X3,X5)
| ~ inertia(X8,X2,X7)
| ~ inertia(X6,X1,X5)
| ~ greater(X3,X4)
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_18,negated_conjecture,
size(sk3,sk8,sk10),
c_0_3 ).
fof(c_0_19,negated_conjecture,
size(sk2,sk7,sk9),
c_0_4 ).
fof(c_0_20,negated_conjecture,
reproducibility(sk3,sk6,sk10),
c_0_5 ).
fof(c_0_21,negated_conjecture,
reproducibility(sk2,sk5,sk9),
c_0_6 ).
fof(c_0_22,negated_conjecture,
class(sk3,sk4,sk10),
c_0_7 ).
fof(c_0_23,negated_conjecture,
class(sk2,sk4,sk9),
c_0_8 ).
fof(c_0_24,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
c_0_9 ).
fof(c_0_25,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
c_0_10 ).
fof(c_0_26,negated_conjecture,
~ greater(sk6,sk5),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_27,negated_conjecture,
greater(sk8,sk7),
c_0_12 ).
fof(c_0_28,negated_conjecture,
organization(sk3,sk10),
c_0_13 ).
fof(c_0_29,negated_conjecture,
organization(sk2,sk9),
c_0_14 ).
fof(c_0_30,hypothesis,
! [X10,X11,X12,X13,X14,X15,X16,X17,X18] :
( ~ organization(X18,X17)
| ~ organization(X16,X15)
| ~ class(X18,X14,X17)
| ~ class(X16,X14,X15)
| ~ size(X18,X13,X17)
| ~ size(X16,X12,X15)
| ~ inertia(X18,X11,X17)
| ~ inertia(X16,X10,X15)
| ~ greater(X12,X13)
| greater(X10,X11) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_31,hypothesis,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ~ organization(X16,X15)
| ~ organization(X14,X13)
| ~ reorganization_free(X16,X15,X15)
| ~ reorganization_free(X14,X13,X13)
| ~ reproducibility(X16,X12,X15)
| ~ reproducibility(X14,X11,X13)
| ~ inertia(X16,X10,X15)
| ~ inertia(X14,X9,X13)
| ~ greater(X9,X10)
| greater(X11,X12) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_32,hypothesis,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ~ organization(X16,X15)
| ~ organization(X14,X13)
| ~ reorganization_free(X16,X15,X15)
| ~ reorganization_free(X14,X13,X13)
| ~ reproducibility(X16,X12,X15)
| ~ reproducibility(X14,X11,X13)
| ~ inertia(X16,X10,X15)
| ~ inertia(X14,X9,X13)
| ~ greater(X11,X12)
| greater(X9,X10) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_33,negated_conjecture,
size(sk3,sk8,sk10),
c_0_18 ).
fof(c_0_34,negated_conjecture,
size(sk2,sk7,sk9),
c_0_19 ).
fof(c_0_35,negated_conjecture,
reproducibility(sk3,sk6,sk10),
c_0_20 ).
fof(c_0_36,negated_conjecture,
reproducibility(sk2,sk5,sk9),
c_0_21 ).
fof(c_0_37,negated_conjecture,
class(sk3,sk4,sk10),
c_0_22 ).
fof(c_0_38,negated_conjecture,
class(sk2,sk4,sk9),
c_0_23 ).
fof(c_0_39,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
c_0_24 ).
fof(c_0_40,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
c_0_25 ).
fof(c_0_41,negated_conjecture,
~ greater(sk6,sk5),
c_0_26 ).
fof(c_0_42,negated_conjecture,
greater(sk8,sk7),
c_0_27 ).
fof(c_0_43,negated_conjecture,
organization(sk3,sk10),
c_0_28 ).
fof(c_0_44,negated_conjecture,
organization(sk2,sk9),
c_0_29 ).
cnf(c_0_45,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X6)
| ~ inertia(X7,X2,X8)
| ~ size(X5,X3,X6)
| ~ size(X7,X4,X8)
| ~ class(X5,X9,X6)
| ~ class(X7,X9,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_46,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X3,X6)
| ~ inertia(X7,X4,X8)
| ~ reproducibility(X5,X1,X6)
| ~ reproducibility(X7,X2,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_47,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X6)
| ~ inertia(X7,X2,X8)
| ~ reproducibility(X5,X3,X6)
| ~ reproducibility(X7,X4,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_48,negated_conjecture,
size(sk3,sk8,sk10),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_49,negated_conjecture,
size(sk2,sk7,sk9),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_50,negated_conjecture,
reproducibility(sk3,sk6,sk10),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_51,negated_conjecture,
reproducibility(sk2,sk5,sk9),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_52,negated_conjecture,
class(sk3,sk4,sk10),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_53,negated_conjecture,
class(sk2,sk4,sk9),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_54,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_55,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_56,negated_conjecture,
~ greater(sk6,sk5),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_57,negated_conjecture,
greater(sk8,sk7),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_58,negated_conjecture,
organization(sk3,sk10),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_59,negated_conjecture,
organization(sk2,sk9),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_60,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X6)
| ~ inertia(X7,X2,X8)
| ~ size(X5,X3,X6)
| ~ size(X7,X4,X8)
| ~ class(X5,X9,X6)
| ~ class(X7,X9,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
c_0_45,
[final] ).
cnf(c_0_61,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X3,X6)
| ~ inertia(X7,X4,X8)
| ~ reproducibility(X5,X1,X6)
| ~ reproducibility(X7,X2,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
c_0_46,
[final] ).
cnf(c_0_62,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X6)
| ~ inertia(X7,X2,X8)
| ~ reproducibility(X5,X3,X6)
| ~ reproducibility(X7,X4,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
c_0_47,
[final] ).
cnf(c_0_63,negated_conjecture,
size(sk3,sk8,sk10),
c_0_48,
[final] ).
cnf(c_0_64,negated_conjecture,
size(sk2,sk7,sk9),
c_0_49,
[final] ).
cnf(c_0_65,negated_conjecture,
reproducibility(sk3,sk6,sk10),
c_0_50,
[final] ).
cnf(c_0_66,negated_conjecture,
reproducibility(sk2,sk5,sk9),
c_0_51,
[final] ).
cnf(c_0_67,negated_conjecture,
class(sk3,sk4,sk10),
c_0_52,
[final] ).
cnf(c_0_68,negated_conjecture,
class(sk2,sk4,sk9),
c_0_53,
[final] ).
cnf(c_0_69,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
c_0_54,
[final] ).
cnf(c_0_70,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
c_0_55,
[final] ).
cnf(c_0_71,negated_conjecture,
~ greater(sk6,sk5),
c_0_56,
[final] ).
cnf(c_0_72,negated_conjecture,
greater(sk8,sk7),
c_0_57,
[final] ).
cnf(c_0_73,negated_conjecture,
organization(sk3,sk10),
c_0_58,
[final] ).
cnf(c_0_74,negated_conjecture,
organization(sk2,sk9),
c_0_59,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X4,X1)
| greater(X6,X7)
| ~ reproducibility(X0,X7,X2)
| ~ reproducibility(X3,X6,X5)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X3,X5,X5) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_61) ).
cnf(c_20,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X4,X1)
| greater(X6,X7)
| ~ reproducibility(X0,X7,X2)
| ~ reproducibility(X3,X6,X5)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X3,X5,X5) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_73,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X4,X1)
| greater(X6,X7)
| ~ reproducibility(X0,X7,X2)
| ~ reproducibility(X3,X6,X5)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X3,X5,X5) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_100,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X4,X1)
| greater(X6,X7)
| ~ reproducibility(X0,X7,X2)
| ~ reproducibility(X3,X6,X5)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X3,X5,X5) ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_104,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X4,X1)
| greater(X6,X7)
| ~ reproducibility(X0,X7,X2)
| ~ reproducibility(X3,X6,X5)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X3,X5,X5) ),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_142,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X4,X1)
| greater(X6,X7)
| ~ reproducibility(X0,X7,X2)
| ~ reproducibility(X3,X6,X5)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X3,X5,X5) ),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_12,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_69) ).
cnf(c_38,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_82,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_91,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_113,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_160,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
inference(copy,[status(esa)],[c_113]) ).
cnf(c_276,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(X1,X2,X3)
| ~ organization(sk3,sk10)
| ~ organization(X1,X3)
| ~ greater(X0,X2)
| greater(X4,X5)
| ~ reproducibility(sk3,X4,sk10)
| ~ reproducibility(X1,X5,X3)
| ~ reorganization_free(X1,X3,X3) ),
inference(resolution,[status(thm)],[c_142,c_160]) ).
cnf(c_277,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(X1,X2,X3)
| ~ organization(sk3,sk10)
| ~ organization(X1,X3)
| ~ greater(X0,X2)
| greater(X4,X5)
| ~ reproducibility(sk3,X4,sk10)
| ~ reproducibility(X1,X5,X3)
| ~ reorganization_free(X1,X3,X3) ),
inference(rewriting,[status(thm)],[c_276]) ).
cnf(c_15,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_73) ).
cnf(c_44,negated_conjecture,
organization(sk3,sk10),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_85,negated_conjecture,
organization(sk3,sk10),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_88,negated_conjecture,
organization(sk3,sk10),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_116,negated_conjecture,
organization(sk3,sk10),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_166,negated_conjecture,
organization(sk3,sk10),
inference(copy,[status(esa)],[c_116]) ).
cnf(c_336,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(X1,X2,X3)
| ~ organization(X1,X3)
| ~ greater(X0,X2)
| greater(X4,X5)
| ~ reproducibility(sk3,X4,sk10)
| ~ reproducibility(X1,X5,X3)
| ~ reorganization_free(X1,X3,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_277,c_166]) ).
cnf(c_337,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(X1,X2,X3)
| ~ organization(X1,X3)
| ~ greater(X0,X2)
| greater(X4,X5)
| ~ reproducibility(sk3,X4,sk10)
| ~ reproducibility(X1,X5,X3)
| ~ reorganization_free(X1,X3,X3) ),
inference(rewriting,[status(thm)],[c_336]) ).
cnf(c_13,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_70) ).
cnf(c_40,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_83,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_90,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_114,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_162,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_348,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ organization(sk2,sk9)
| ~ greater(X0,X1)
| greater(X2,X3)
| ~ reproducibility(sk3,X2,sk10)
| ~ reproducibility(sk2,X3,sk9) ),
inference(resolution,[status(thm)],[c_337,c_162]) ).
cnf(c_349,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ organization(sk2,sk9)
| ~ greater(X0,X1)
| greater(X2,X3)
| ~ reproducibility(sk3,X2,sk10)
| ~ reproducibility(sk2,X3,sk9) ),
inference(rewriting,[status(thm)],[c_348]) ).
cnf(c_2,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X6,X7)
| greater(X4,X1)
| ~ size(X0,X7,X2)
| ~ size(X3,X6,X5)
| ~ class(X0,X8,X2)
| ~ class(X3,X8,X5) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_60) ).
cnf(c_18,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X6,X7)
| greater(X4,X1)
| ~ size(X0,X7,X2)
| ~ size(X3,X6,X5)
| ~ class(X0,X8,X2)
| ~ class(X3,X8,X5) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_72,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X6,X7)
| greater(X4,X1)
| ~ size(X0,X7,X2)
| ~ size(X3,X6,X5)
| ~ class(X0,X8,X2)
| ~ class(X3,X8,X5) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_101,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X6,X7)
| greater(X4,X1)
| ~ size(X0,X7,X2)
| ~ size(X3,X6,X5)
| ~ class(X0,X8,X2)
| ~ class(X3,X8,X5) ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_103,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X6,X7)
| greater(X4,X1)
| ~ size(X0,X7,X2)
| ~ size(X3,X6,X5)
| ~ class(X0,X8,X2)
| ~ class(X3,X8,X5) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_140,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X6,X7)
| greater(X4,X1)
| ~ size(X0,X7,X2)
| ~ size(X3,X6,X5)
| ~ class(X0,X8,X2)
| ~ class(X3,X8,X5) ),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_10,negated_conjecture,
class(sk3,sk4,sk10),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_67) ).
cnf(c_34,negated_conjecture,
class(sk3,sk4,sk10),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_80,negated_conjecture,
class(sk3,sk4,sk10),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_93,negated_conjecture,
class(sk3,sk4,sk10),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_111,negated_conjecture,
class(sk3,sk4,sk10),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_156,negated_conjecture,
class(sk3,sk4,sk10),
inference(copy,[status(esa)],[c_111]) ).
cnf(c_212,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(X1,X2,X3)
| ~ organization(sk3,sk10)
| ~ organization(X1,X3)
| ~ greater(X4,X5)
| greater(X0,X2)
| ~ size(sk3,X4,sk10)
| ~ size(X1,X5,X3)
| ~ class(X1,sk4,X3) ),
inference(resolution,[status(thm)],[c_140,c_156]) ).
cnf(c_213,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(X1,X2,X3)
| ~ organization(sk3,sk10)
| ~ organization(X1,X3)
| ~ greater(X4,X5)
| greater(X0,X2)
| ~ size(sk3,X4,sk10)
| ~ size(X1,X5,X3)
| ~ class(X1,sk4,X3) ),
inference(rewriting,[status(thm)],[c_212]) ).
cnf(c_225,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(X1,X2,X3)
| ~ organization(X1,X3)
| ~ greater(X4,X5)
| greater(X0,X2)
| ~ size(sk3,X4,sk10)
| ~ size(X1,X5,X3)
| ~ class(X1,sk4,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_213,c_166]) ).
cnf(c_226,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(X1,X2,X3)
| ~ organization(X1,X3)
| ~ greater(X4,X5)
| greater(X0,X2)
| ~ size(sk3,X4,sk10)
| ~ size(X1,X5,X3)
| ~ class(X1,sk4,X3) ),
inference(rewriting,[status(thm)],[c_225]) ).
cnf(c_11,negated_conjecture,
class(sk2,sk4,sk9),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_68) ).
cnf(c_36,negated_conjecture,
class(sk2,sk4,sk9),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_81,negated_conjecture,
class(sk2,sk4,sk9),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_92,negated_conjecture,
class(sk2,sk4,sk9),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_112,negated_conjecture,
class(sk2,sk4,sk9),
inference(copy,[status(esa)],[c_92]) ).
cnf(c_158,negated_conjecture,
class(sk2,sk4,sk9),
inference(copy,[status(esa)],[c_112]) ).
cnf(c_237,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ organization(sk2,sk9)
| ~ greater(X2,X3)
| greater(X0,X1)
| ~ size(sk3,X2,sk10)
| ~ size(sk2,X3,sk9) ),
inference(resolution,[status(thm)],[c_226,c_158]) ).
cnf(c_238,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ organization(sk2,sk9)
| ~ greater(X2,X3)
| greater(X0,X1)
| ~ size(sk3,X2,sk10)
| ~ size(sk2,X3,sk9) ),
inference(rewriting,[status(thm)],[c_237]) ).
cnf(c_16,negated_conjecture,
organization(sk2,sk9),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_74) ).
cnf(c_46,negated_conjecture,
organization(sk2,sk9),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_86,negated_conjecture,
organization(sk2,sk9),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_87,negated_conjecture,
organization(sk2,sk9),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_102,negated_conjecture,
organization(sk2,sk9),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_138,negated_conjecture,
organization(sk2,sk9),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_402,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ greater(X2,X3)
| greater(X0,X1)
| ~ size(sk3,X2,sk10)
| ~ size(sk2,X3,sk9) ),
inference(forward_subsumption_resolution,[status(thm)],[c_238,c_138]) ).
cnf(c_403,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ greater(X2,X3)
| greater(X0,X1)
| ~ size(sk3,X2,sk10)
| ~ size(sk2,X3,sk9) ),
inference(rewriting,[status(thm)],[c_402]) ).
cnf(c_7,negated_conjecture,
size(sk2,sk7,sk9),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_64) ).
cnf(c_28,negated_conjecture,
size(sk2,sk7,sk9),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_77,negated_conjecture,
size(sk2,sk7,sk9),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_96,negated_conjecture,
size(sk2,sk7,sk9),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_108,negated_conjecture,
size(sk2,sk7,sk9),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_150,negated_conjecture,
size(sk2,sk7,sk9),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_410,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ greater(X2,sk7)
| greater(X0,X1)
| ~ size(sk3,X2,sk10) ),
inference(resolution,[status(thm)],[c_403,c_150]) ).
cnf(c_411,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ greater(X2,sk7)
| greater(X0,X1)
| ~ size(sk3,X2,sk10) ),
inference(rewriting,[status(thm)],[c_410]) ).
cnf(c_6,negated_conjecture,
size(sk3,sk8,sk10),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_63) ).
cnf(c_26,negated_conjecture,
size(sk3,sk8,sk10),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_76,negated_conjecture,
size(sk3,sk8,sk10),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_97,negated_conjecture,
size(sk3,sk8,sk10),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_107,negated_conjecture,
size(sk3,sk8,sk10),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_148,negated_conjecture,
size(sk3,sk8,sk10),
inference(copy,[status(esa)],[c_107]) ).
cnf(c_422,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ greater(sk8,sk7)
| greater(X0,X1) ),
inference(resolution,[status(thm)],[c_411,c_148]) ).
cnf(c_423,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| ~ greater(sk8,sk7)
| greater(X0,X1) ),
inference(rewriting,[status(thm)],[c_422]) ).
cnf(c_14,negated_conjecture,
greater(sk8,sk7),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_72) ).
cnf(c_42,negated_conjecture,
greater(sk8,sk7),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_84,negated_conjecture,
greater(sk8,sk7),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_89,negated_conjecture,
greater(sk8,sk7),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_115,negated_conjecture,
greater(sk8,sk7),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_164,negated_conjecture,
greater(sk8,sk7),
inference(copy,[status(esa)],[c_115]) ).
cnf(c_428,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_423,c_164]) ).
cnf(c_429,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(X0,X1) ),
inference(rewriting,[status(thm)],[c_428]) ).
cnf(c_620,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(X2,X3)
| ~ reproducibility(sk3,X2,sk10)
| ~ reproducibility(sk2,X3,sk9) ),
inference(forward_subsumption_resolution,[status(thm)],[c_349,c_429,c_138]) ).
cnf(c_621,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(X2,X3)
| ~ reproducibility(sk3,X2,sk10)
| ~ reproducibility(sk2,X3,sk9) ),
inference(rewriting,[status(thm)],[c_620]) ).
cnf(c_9,negated_conjecture,
reproducibility(sk2,sk5,sk9),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_66) ).
cnf(c_32,negated_conjecture,
reproducibility(sk2,sk5,sk9),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_79,negated_conjecture,
reproducibility(sk2,sk5,sk9),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_94,negated_conjecture,
reproducibility(sk2,sk5,sk9),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_110,negated_conjecture,
reproducibility(sk2,sk5,sk9),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_154,negated_conjecture,
reproducibility(sk2,sk5,sk9),
inference(copy,[status(esa)],[c_110]) ).
cnf(c_627,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(X2,sk5)
| ~ reproducibility(sk3,X2,sk10) ),
inference(resolution,[status(thm)],[c_621,c_154]) ).
cnf(c_628,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(X2,sk5)
| ~ reproducibility(sk3,X2,sk10) ),
inference(rewriting,[status(thm)],[c_627]) ).
cnf(c_8,negated_conjecture,
reproducibility(sk3,sk6,sk10),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_65) ).
cnf(c_30,negated_conjecture,
reproducibility(sk3,sk6,sk10),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_78,negated_conjecture,
reproducibility(sk3,sk6,sk10),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_95,negated_conjecture,
reproducibility(sk3,sk6,sk10),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_109,negated_conjecture,
reproducibility(sk3,sk6,sk10),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_152,negated_conjecture,
reproducibility(sk3,sk6,sk10),
inference(copy,[status(esa)],[c_109]) ).
cnf(c_637,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(sk6,sk5) ),
inference(resolution,[status(thm)],[c_628,c_152]) ).
cnf(c_638,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(sk6,sk5) ),
inference(rewriting,[status(thm)],[c_637]) ).
cnf(c_5,negated_conjecture,
~ greater(sk6,sk5),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_71) ).
cnf(c_24,negated_conjecture,
~ greater(sk6,sk5),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_75,negated_conjecture,
~ greater(sk6,sk5),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_98,negated_conjecture,
~ greater(sk6,sk5),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_106,negated_conjecture,
~ greater(sk6,sk5),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_146,negated_conjecture,
~ greater(sk6,sk5),
inference(copy,[status(esa)],[c_106]) ).
cnf(c_642,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9) ),
inference(forward_subsumption_resolution,[status(thm)],[c_638,c_146]) ).
cnf(c_643,plain,
( ~ inertia(sk3,X0,sk10)
| ~ inertia(sk2,X1,sk9) ),
inference(rewriting,[status(thm)],[c_642]) ).
cnf(c_0,plain,
( ~ organization(X0,X1)
| inertia(X0,sk1(X1,X0),X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_daff68.p',c_0_4_0) ).
cnf(c_134,plain,
( ~ organization(X0,X1)
| inertia(X0,sk1(X1,X0),X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_135,plain,
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
inference(rewriting,[status(thm)],[c_134]) ).
cnf(c_646,plain,
( ~ inertia(sk3,X0,sk10)
| ~ organization(sk2,sk9) ),
inference(resolution,[status(thm)],[c_643,c_135]) ).
cnf(c_647,plain,
( ~ inertia(sk3,X0,sk10)
| ~ organization(sk2,sk9) ),
inference(rewriting,[status(thm)],[c_646]) ).
cnf(c_775,plain,
~ inertia(sk3,X0,sk10),
inference(forward_subsumption_resolution,[status(thm)],[c_647,c_138]) ).
cnf(c_776,plain,
~ inertia(sk3,X0,sk10),
inference(rewriting,[status(thm)],[c_775]) ).
cnf(c_778,plain,
~ organization(sk3,sk10),
inference(resolution,[status(thm)],[c_776,c_135]) ).
cnf(c_779,plain,
~ organization(sk3,sk10),
inference(rewriting,[status(thm)],[c_778]) ).
cnf(c_781,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_779,c_166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : MGT009-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.10 % Command : iprover_modulo %s %d
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Thu Jun 9 12:26:52 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.10/0.30 % Running in mono-core mode
% 0.16/0.34 % Orienting using strategy Equiv(ClausalAll)
% 0.16/0.34 % Orientation found
% 0.16/0.34 % 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_a0e898.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_daff68.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_920b22 | grep -v "SZS"
% 0.16/0.36
% 0.16/0.36 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.16/0.36
% 0.16/0.36 %
% 0.16/0.36 % ------ iProver source info
% 0.16/0.36
% 0.16/0.36 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.16/0.36 % git: non_committed_changes: true
% 0.16/0.36 % git: last_make_outside_of_git: true
% 0.16/0.36
% 0.16/0.36 %
% 0.16/0.36 % ------ Input Options
% 0.16/0.36
% 0.16/0.36 % --out_options all
% 0.16/0.36 % --tptp_safe_out true
% 0.16/0.36 % --problem_path ""
% 0.16/0.36 % --include_path ""
% 0.16/0.36 % --clausifier .//eprover
% 0.16/0.36 % --clausifier_options --tstp-format
% 0.16/0.36 % --stdin false
% 0.16/0.36 % --dbg_backtrace false
% 0.16/0.36 % --dbg_dump_prop_clauses false
% 0.16/0.36 % --dbg_dump_prop_clauses_file -
% 0.16/0.36 % --dbg_out_stat false
% 0.16/0.36
% 0.16/0.36 % ------ General Options
% 0.16/0.36
% 0.16/0.36 % --fof false
% 0.16/0.36 % --time_out_real 150.
% 0.16/0.36 % --time_out_prep_mult 0.2
% 0.16/0.36 % --time_out_virtual -1.
% 0.16/0.36 % --schedule none
% 0.16/0.36 % --ground_splitting input
% 0.16/0.36 % --splitting_nvd 16
% 0.16/0.36 % --non_eq_to_eq false
% 0.16/0.36 % --prep_gs_sim true
% 0.16/0.36 % --prep_unflatten false
% 0.16/0.36 % --prep_res_sim true
% 0.16/0.36 % --prep_upred true
% 0.16/0.36 % --res_sim_input true
% 0.16/0.36 % --clause_weak_htbl true
% 0.16/0.36 % --gc_record_bc_elim false
% 0.16/0.36 % --symbol_type_check false
% 0.16/0.36 % --clausify_out false
% 0.16/0.36 % --large_theory_mode false
% 0.16/0.36 % --prep_sem_filter none
% 0.16/0.36 % --prep_sem_filter_out false
% 0.16/0.36 % --preprocessed_out false
% 0.16/0.36 % --sub_typing false
% 0.16/0.36 % --brand_transform false
% 0.16/0.36 % --pure_diseq_elim true
% 0.16/0.36 % --min_unsat_core false
% 0.16/0.36 % --pred_elim true
% 0.16/0.36 % --add_important_lit false
% 0.16/0.36 % --soft_assumptions false
% 0.16/0.36 % --reset_solvers false
% 0.16/0.36 % --bc_imp_inh []
% 0.16/0.36 % --conj_cone_tolerance 1.5
% 0.16/0.36 % --prolific_symb_bound 500
% 0.16/0.36 % --lt_threshold 2000
% 0.16/0.36
% 0.16/0.36 % ------ SAT Options
% 0.16/0.36
% 0.16/0.36 % --sat_mode false
% 0.16/0.36 % --sat_fm_restart_options ""
% 0.16/0.36 % --sat_gr_def false
% 0.16/0.36 % --sat_epr_types true
% 0.16/0.36 % --sat_non_cyclic_types false
% 0.16/0.36 % --sat_finite_models false
% 0.16/0.36 % --sat_fm_lemmas false
% 0.16/0.36 % --sat_fm_prep false
% 0.16/0.36 % --sat_fm_uc_incr true
% 0.16/0.36 % --sat_out_model small
% 0.16/0.36 % --sat_out_clauses false
% 0.16/0.36
% 0.16/0.36 % ------ QBF Options
% 0.16/0.36
% 0.16/0.36 % --qbf_mode false
% 0.16/0.36 % --qbf_elim_univ true
% 0.16/0.36 % --qbf_sk_in true
% 0.16/0.36 % --qbf_pred_elim true
% 0.16/0.36 % --qbf_split 32
% 0.16/0.36
% 0.16/0.36 % ------ BMC1 Options
% 0.16/0.36
% 0.16/0.36 % --bmc1_incremental false
% 0.16/0.36 % --bmc1_axioms reachable_all
% 0.16/0.36 % --bmc1_min_bound 0
% 0.16/0.36 % --bmc1_max_bound -1
% 0.16/0.36 % --bmc1_max_bound_default -1
% 0.16/0.36 % --bmc1_symbol_reachability true
% 0.16/0.36 % --bmc1_property_lemmas false
% 0.16/0.36 % --bmc1_k_induction false
% 0.16/0.36 % --bmc1_non_equiv_states false
% 0.16/0.36 % --bmc1_deadlock false
% 0.16/0.36 % --bmc1_ucm false
% 0.16/0.36 % --bmc1_add_unsat_core none
% 0.16/0.36 % --bmc1_unsat_core_children false
% 0.16/0.36 % --bmc1_unsat_core_extrapolate_axioms false
% 0.16/0.36 % --bmc1_out_stat full
% 0.16/0.36 % --bmc1_ground_init false
% 0.16/0.36 % --bmc1_pre_inst_next_state false
% 0.16/0.36 % --bmc1_pre_inst_state false
% 0.16/0.36 % --bmc1_pre_inst_reach_state false
% 0.16/0.36 % --bmc1_out_unsat_core false
% 0.16/0.36 % --bmc1_aig_witness_out false
% 0.16/0.36 % --bmc1_verbose false
% 0.16/0.36 % --bmc1_dump_clauses_tptp false
% 0.16/0.36 % --bmc1_dump_unsat_core_tptp false
% 0.16/0.36 % --bmc1_dump_file -
% 0.16/0.36 % --bmc1_ucm_expand_uc_limit 128
% 0.16/0.36 % --bmc1_ucm_n_expand_iterations 6
% 0.16/0.36 % --bmc1_ucm_extend_mode 1
% 0.16/0.36 % --bmc1_ucm_init_mode 2
% 0.16/0.36 % --bmc1_ucm_cone_mode none
% 0.16/0.36 % --bmc1_ucm_reduced_relation_type 0
% 0.16/0.36 % --bmc1_ucm_relax_model 4
% 0.16/0.36 % --bmc1_ucm_full_tr_after_sat true
% 0.16/0.36 % --bmc1_ucm_expand_neg_assumptions false
% 0.16/0.36 % --bmc1_ucm_layered_model none
% 0.16/0.36 % --bmc1_ucm_max_lemma_size 10
% 0.16/0.36
% 0.16/0.36 % ------ AIG Options
% 0.16/0.36
% 0.16/0.36 % --aig_mode false
% 0.16/0.36
% 0.16/0.36 % ------ Instantiation Options
% 0.16/0.36
% 0.16/0.36 % --instantiation_flag true
% 0.16/0.36 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.16/0.36 % --inst_solver_per_active 750
% 0.16/0.36 % --inst_solver_calls_frac 0.5
% 0.16/0.36 % --inst_passive_queue_type priority_queues
% 0.16/0.36 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.16/0.36 % --inst_passive_queues_freq [25;2]
% 0.16/0.36 % --inst_dismatching true
% 0.16/0.36 % --inst_eager_unprocessed_to_passive true
% 0.16/0.36 % --inst_prop_sim_given true
% 0.16/0.36 % --inst_prop_sim_new false
% 0.16/0.36 % --inst_orphan_elimination true
% 0.16/0.36 % --inst_learning_loop_flag true
% 0.16/0.36 % --inst_learning_start 3000
% 0.16/0.36 % --inst_learning_factor 2
% 0.16/0.36 % --inst_start_prop_sim_after_learn 3
% 0.16/0.36 % --inst_sel_renew solver
% 0.16/0.36 % --inst_lit_activity_flag true
% 0.16/0.36 % --inst_out_proof true
% 0.16/0.36
% 0.16/0.36 % ------ Resolution Options
% 0.16/0.36
% 0.16/0.36 % --resolution_flag true
% 0.16/0.36 % --res_lit_sel kbo_max
% 0.16/0.36 % --res_to_prop_solver none
% 0.16/0.36 % --res_prop_simpl_new false
% 0.16/0.36 % --res_prop_simpl_given false
% 0.16/0.36 % --res_passive_queue_type priority_queues
% 0.16/0.36 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.16/0.36 % --res_passive_queues_freq [15;5]
% 0.16/0.36 % --res_forward_subs full
% 0.16/0.36 % --res_backward_subs full
% 0.16/0.36 % --res_forward_subs_resolution true
% 0.16/0.36 % --res_backward_subs_resolution true
% 0.16/0.36 % --res_orphan_elimination false
% 0.16/0.36 % --res_time_limit 1000.
% 0.16/0.36 % --res_out_proof true
% 0.16/0.36 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0e898.s
% 0.16/0.36 % --modulo true
% 0.16/0.36
% 0.16/0.36 % ------ Combination Options
% 0.16/0.36
% 0.16/0.36 % --comb_res_mult 1000
% 0.16/0.36 % --comb_inst_mult 300
% 0.16/0.36 % ------
% 0.16/0.36
% 0.16/0.36 % ------ Parsing...% successful
% 0.16/0.36
% 0.16/0.36 % ------ 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.16/0.36
% 0.16/0.36 % ------ Proving...
% 0.16/0.36 % ------ Problem Properties
% 0.16/0.36
% 0.16/0.36 %
% 0.16/0.36 % EPR false
% 0.16/0.36 % Horn true
% 0.16/0.36 % Has equality false
% 0.16/0.36
% 0.16/0.36 % % ------ Input Options Time Limit: Unbounded
% 0.16/0.36
% 0.16/0.36
% 0.16/0.36 % % ------ Current options:
% 0.16/0.36
% 0.16/0.36 % ------ Input Options
% 0.16/0.36
% 0.16/0.36 % --out_options all
% 0.16/0.36 % --tptp_safe_out true
% 0.16/0.36 % --problem_path ""
% 0.16/0.36 % --include_path ""
% 0.16/0.36 % --clausifier .//eprover
% 0.16/0.36 % --clausifier_options --tstp-format
% 0.16/0.36 % --stdin false
% 0.16/0.36 % --dbg_backtrace false
% 0.16/0.36 % --dbg_dump_prop_clauses false
% 0.16/0.36 % --dbg_dump_prop_clauses_file -
% 0.16/0.36 % --dbg_out_stat false
% 0.16/0.36
% 0.16/0.36 % ------ General Options
% 0.16/0.36
% 0.16/0.36 % --fof false
% 0.16/0.36 % --time_out_real 150.
% 0.16/0.36 % --time_out_prep_mult 0.2
% 0.16/0.36 % --time_out_virtual -1.
% 0.16/0.36 % --schedule none
% 0.16/0.36 % --ground_splitting input
% 0.16/0.36 % --splitting_nvd 16
% 0.16/0.36 % --non_eq_to_eq false
% 0.16/0.36 % --prep_gs_sim true
% 0.16/0.36 % --prep_unflatten false
% 0.16/0.36 % --prep_res_sim true
% 0.16/0.36 % --prep_upred true
% 0.16/0.36 % --res_sim_input true
% 0.16/0.36 % --clause_weak_htbl true
% 0.16/0.36 % --gc_record_bc_elim false
% 0.16/0.36 % --symbol_type_check false
% 0.16/0.36 % --clausify_out false
% 0.16/0.36 % --large_theory_mode false
% 0.16/0.36 % --prep_sem_filter none
% 0.16/0.36 % --prep_sem_filter_out false
% 0.16/0.36 % --preprocessed_out false
% 0.16/0.36 % --sub_typing false
% 0.16/0.36 % --brand_transform false
% 0.16/0.36 % --pure_diseq_elim true
% 0.16/0.36 % --min_unsat_core false
% 0.16/0.36 % --pred_elim true
% 0.16/0.36 % --add_important_lit false
% 0.16/0.36 % --soft_assumptions false
% 0.16/0.36 % --reset_solvers false
% 0.16/0.36 % --bc_imp_inh []
% 0.16/0.36 % --conj_cone_tolerance 1.5
% 0.16/0.36 % --prolific_symb_bound 500
% 0.16/0.36 % --lt_threshold 2000
% 0.16/0.36
% 0.16/0.36 % ------ SAT Options
% 0.16/0.36
% 0.16/0.36 % --sat_mode false
% 0.16/0.36 % --sat_fm_restart_options ""
% 0.16/0.36 % --sat_gr_def false
% 0.16/0.36 % --sat_epr_types true
% 0.16/0.36 % --sat_non_cyclic_types false
% 0.16/0.36 % --sat_finite_models false
% 0.16/0.36 % --sat_fm_lemmas false
% 0.16/0.36 % --sat_fm_prep false
% 0.16/0.36 % --sat_fm_uc_incr true
% 0.16/0.36 % --sat_out_model small
% 0.16/0.36 % --sat_out_clauses false
% 0.16/0.36
% 0.16/0.36 % ------ QBF Options
% 0.16/0.36
% 0.16/0.36 % --qbf_mode false
% 0.16/0.36 % --qbf_elim_univ true
% 0.16/0.36 % --qbf_sk_in true
% 0.16/0.36 % --qbf_pred_elim true
% 0.16/0.36 % --qbf_split 32
% 0.16/0.36
% 0.16/0.36 % ------ BMC1 Options
% 0.16/0.36
% 0.16/0.36 % --bmc1_incremental false
% 0.16/0.36 % --bmc1_axioms reachable_all
% 0.16/0.36 % --bmc1_min_bound 0
% 0.16/0.36 % --bmc1_max_bound -1
% 0.16/0.36 % --bmc1_max_bound_default -1
% 0.16/0.36 % --bmc1_symbol_reachability true
% 0.16/0.36 % --bmc1_property_lemmas false
% 0.16/0.36 % --bmc1_k_induction false
% 0.16/0.36 % --bmc1_non_equiv_states false
% 0.16/0.36 % --bmc1_deadlock false
% 0.16/0.36 % --bmc1_ucm false
% 0.16/0.36 % --bmc1_add_unsat_core none
% 0.16/0.36 % --bmc1_unsat_core_children false
% 0.16/0.36 % --bmc1_unsat_core_extrapolate_axioms false
% 0.16/0.36 % --bmc1_out_stat full
% 0.16/0.36 % --bmc1_ground_init false
% 0.16/0.36 % --bmc1_pre_inst_next_state false
% 0.16/0.36 % --bmc1_pre_inst_state false
% 0.16/0.36 % --bmc1_pre_inst_reach_state false
% 0.16/0.36 % --bmc1_out_unsat_core false
% 0.16/0.36 % --bmc1_aig_witness_out false
% 0.16/0.36 % --bmc1_verbose false
% 0.16/0.36 % --bmc1_dump_clauses_tptp false
% 0.16/0.36 % --bmc1_dump_unsat_core_tptp false
% 0.16/0.36 % --bmc1_dump_file -
% 0.16/0.36 % --bmc1_ucm_expand_uc_limit 128
% 0.16/0.36 % --bmc1_ucm_n_expand_iterations 6
% 0.16/0.36 % --bmc1_ucm_extend_mode 1
% 0.16/0.36 % --bmc1_ucm_init_mode 2
% 0.16/0.36 % --bmc1_ucm_cone_mode none
% 0.16/0.36 % --bmc1_ucm_reduced_relation_type 0
% 0.16/0.36 % --bmc1_ucm_relax_model 4
% 0.16/0.36 % --bmc1_ucm_full_tr_after_sat true
% 0.16/0.36 % --bmc1_ucm_expand_neg_assumptions false
% 0.16/0.36 % --bmc1_ucm_layered_model none
% 0.16/0.36 % --bmc1_ucm_max_lemma_size 10
% 0.16/0.36
% 0.16/0.36 % ------ AIG Options
% 0.16/0.36
% 0.16/0.36 % --aig_mode false
% 0.16/0.36
% 0.16/0.36 % ------ Instantiation Options
% 0.16/0.36
% 0.16/0.36 % --instantiation_flag true
% 0.16/0.36 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.16/0.36 % --inst_solver_per_active 750
% 0.16/0.36 % --inst_solver_calls_frac 0.5
% 0.16/0.36 % --inst_passive_queue_type priority_queues
% 0.16/0.36 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.16/0.36 % --inst_passive_queues_freq [25;2]
% 0.16/0.36 % --inst_dismatching true
% 0.16/0.36 % --inst_eager_unprocessed_to_passive true
% 0.16/0.36 % --inst_prop_sim_given true
% 0.16/0.38 % --inst_prop_sim_new false
% 0.16/0.38 % --inst_orphan_elimination true
% 0.16/0.38 % --inst_learning_loop_flag true
% 0.16/0.38 % --inst_learning_start 3000
% 0.16/0.38 % --inst_learning_factor 2
% 0.16/0.38 % --inst_start_prop_sim_after_learn 3
% 0.16/0.38 % --inst_sel_renew solver
% 0.16/0.38 % --inst_lit_activity_flag true
% 0.16/0.38 % --inst_out_proof true
% 0.16/0.38
% 0.16/0.38 % ------ Resolution Options
% 0.16/0.38
% 0.16/0.38 % --resolution_flag true
% 0.16/0.38 % --res_lit_sel kbo_max
% 0.16/0.38 % --res_to_prop_solver none
% 0.16/0.38 % --res_prop_simpl_new false
% 0.16/0.38 % --res_prop_simpl_given false
% 0.16/0.38 % --res_passive_queue_type priority_queues
% 0.16/0.38 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.16/0.38 % --res_passive_queues_freq [15;5]
% 0.16/0.38 % --res_forward_subs full
% 0.16/0.38 % --res_backward_subs full
% 0.16/0.38 % --res_forward_subs_resolution true
% 0.16/0.38 % --res_backward_subs_resolution true
% 0.16/0.38 % --res_orphan_elimination false
% 0.16/0.38 % --res_time_limit 1000.
% 0.16/0.38 % --res_out_proof true
% 0.16/0.38 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0e898.s
% 0.16/0.38 % --modulo true
% 0.16/0.38
% 0.16/0.38 % ------ Combination Options
% 0.16/0.38
% 0.16/0.38 % --comb_res_mult 1000
% 0.16/0.38 % --comb_inst_mult 300
% 0.16/0.38 % ------
% 0.16/0.38
% 0.16/0.38
% 0.16/0.38
% 0.16/0.38 % ------ Proving...
% 0.16/0.38 %
% 0.16/0.38
% 0.16/0.38
% 0.16/0.38 % Resolution empty clause
% 0.16/0.38
% 0.16/0.38 % ------ Statistics
% 0.16/0.38
% 0.16/0.38 % ------ General
% 0.16/0.38
% 0.16/0.38 % num_of_input_clauses: 17
% 0.16/0.38 % num_of_input_neg_conjectures: 12
% 0.16/0.38 % num_of_splits: 0
% 0.16/0.38 % num_of_split_atoms: 0
% 0.16/0.38 % num_of_sem_filtered_clauses: 0
% 0.16/0.38 % num_of_subtypes: 0
% 0.16/0.38 % monotx_restored_types: 0
% 0.16/0.38 % sat_num_of_epr_types: 0
% 0.16/0.38 % sat_num_of_non_cyclic_types: 0
% 0.16/0.38 % sat_guarded_non_collapsed_types: 0
% 0.16/0.38 % is_epr: 0
% 0.16/0.38 % is_horn: 1
% 0.16/0.38 % has_eq: 0
% 0.16/0.38 % num_pure_diseq_elim: 0
% 0.16/0.38 % simp_replaced_by: 0
% 0.16/0.38 % res_preprocessed: 27
% 0.16/0.38 % prep_upred: 0
% 0.16/0.38 % prep_unflattend: 0
% 0.16/0.38 % pred_elim_cands: 1
% 0.16/0.38 % pred_elim: 0
% 0.16/0.38 % pred_elim_cl: 0
% 0.16/0.38 % pred_elim_cycles: 1
% 0.16/0.38 % forced_gc_time: 0
% 0.16/0.38 % gc_basic_clause_elim: 0
% 0.16/0.38 % parsing_time: 0.
% 0.16/0.38 % sem_filter_time: 0.
% 0.16/0.38 % pred_elim_time: 0.
% 0.16/0.38 % out_proof_time: 0.004
% 0.16/0.38 % monotx_time: 0.
% 0.16/0.38 % subtype_inf_time: 0.
% 0.16/0.38 % unif_index_cands_time: 0.
% 0.16/0.38 % unif_index_add_time: 0.
% 0.16/0.38 % total_time: 0.033
% 0.16/0.38 % num_of_symbols: 42
% 0.16/0.38 % num_of_terms: 223
% 0.16/0.38
% 0.16/0.38 % ------ Propositional Solver
% 0.16/0.38
% 0.16/0.38 % prop_solver_calls: 1
% 0.16/0.38 % prop_fast_solver_calls: 96
% 0.16/0.38 % prop_num_of_clauses: 17
% 0.16/0.38 % prop_preprocess_simplified: 153
% 0.16/0.38 % prop_fo_subsumed: 0
% 0.16/0.38 % prop_solver_time: 0.
% 0.16/0.38 % prop_fast_solver_time: 0.
% 0.16/0.38 % prop_unsat_core_time: 0.
% 0.16/0.38
% 0.16/0.38 % ------ QBF
% 0.16/0.38
% 0.16/0.38 % qbf_q_res: 0
% 0.16/0.38 % qbf_num_tautologies: 0
% 0.16/0.38 % qbf_prep_cycles: 0
% 0.16/0.38
% 0.16/0.38 % ------ BMC1
% 0.16/0.38
% 0.16/0.38 % bmc1_current_bound: -1
% 0.16/0.38 % bmc1_last_solved_bound: -1
% 0.16/0.38 % bmc1_unsat_core_size: -1
% 0.16/0.38 % bmc1_unsat_core_parents_size: -1
% 0.16/0.38 % bmc1_merge_next_fun: 0
% 0.16/0.38 % bmc1_unsat_core_clauses_time: 0.
% 0.16/0.38
% 0.16/0.38 % ------ Instantiation
% 0.16/0.38
% 0.16/0.38 % inst_num_of_clauses: 17
% 0.16/0.38 % inst_num_in_passive: 0
% 0.16/0.38 % inst_num_in_active: 0
% 0.16/0.38 % inst_num_in_unprocessed: 17
% 0.16/0.38 % inst_num_of_loops: 0
% 0.16/0.38 % inst_num_of_learning_restarts: 0
% 0.16/0.38 % inst_num_moves_active_passive: 0
% 0.16/0.38 % inst_lit_activity: 0
% 0.16/0.38 % inst_lit_activity_moves: 0
% 0.16/0.38 % inst_num_tautologies: 0
% 0.16/0.38 % inst_num_prop_implied: 0
% 0.16/0.38 % inst_num_existing_simplified: 0
% 0.16/0.38 % inst_num_eq_res_simplified: 0
% 0.16/0.38 % inst_num_child_elim: 0
% 0.16/0.38 % inst_num_of_dismatching_blockings: 0
% 0.16/0.38 % inst_num_of_non_proper_insts: 0
% 0.16/0.38 % inst_num_of_duplicates: 0
% 0.16/0.38 % inst_inst_num_from_inst_to_res: 0
% 0.16/0.38 % inst_dismatching_checking_time: 0.
% 0.16/0.38
% 0.16/0.38 % ------ Resolution
% 0.16/0.38
% 0.16/0.38 % res_num_of_clauses: 35
% 0.16/0.38 % res_num_in_passive: 7
% 0.16/0.38 % res_num_in_active: 30
% 0.16/0.38 % res_num_of_loops: 53
% 0.16/0.38 % res_forward_subset_subsumed: 1
% 0.16/0.38 % res_backward_subset_subsumed: 27
% 0.16/0.38 % res_forward_subsumed: 0
% 0.16/0.38 % res_backward_subsumed: 3
% 0.16/0.38 % res_forward_subsumption_resolution: 21
% 0.16/0.38 % res_backward_subsumption_resolution: 0
% 0.16/0.38 % res_clause_to_clause_subsumption: 47
% 0.16/0.38 % res_orphan_elimination: 0
% 0.16/0.38 % res_tautology_del: 0
% 0.16/0.38 % res_num_eq_res_simplified: 0
% 0.16/0.38 % res_num_sel_changes: 0
% 0.16/0.38 % res_moves_from_active_to_pass: 0
% 0.16/0.38
% 0.16/0.38 % Status Unsatisfiable
% 0.16/0.38 % SZS status Unsatisfiable
% 0.16/0.38 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------