TSTP Solution File: MGT002-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT002-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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:38 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 25
% Syntax : Number of formulae : 157 ( 82 unt; 0 def)
% Number of atoms : 483 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 673 ( 347 ~; 326 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 309 ( 12 sgn 87 !; 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] :
( ~ reorganization_free(X3,X2,X1)
| reorganization_free(X3,X2,X2) ),
file('<stdin>',mp4_2) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( ~ reorganization_free(X3,X2,X1)
| reorganization_free(X3,X1,X1) ),
file('<stdin>',mp4_3) ).
fof(c_0_2,axiom,
! [X2,X3] :
( ~ organization(X3,X2)
| reproducibility(X3,sk1(X2,X3),X2) ),
file('<stdin>',mp3_1) ).
fof(c_0_3,plain,
! [X1,X2,X3] :
( ~ reorganization_free(X3,X2,X1)
| reorganization_free(X3,X2,X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4,plain,
! [X1,X2,X3] :
( ~ reorganization_free(X3,X2,X1)
| reorganization_free(X3,X1,X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_5,plain,
! [X2,X3] :
( ~ organization(X3,X2)
| reproducibility(X3,sk1(X2,X3),X2) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ~ reorganization_free(X6,X5,X4)
| reorganization_free(X6,X5,X5) ),
inference(variable_rename,[status(thm)],[c_0_3]) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ~ reorganization_free(X6,X5,X4)
| reorganization_free(X6,X4,X4) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X4,X5] :
( ~ organization(X5,X4)
| reproducibility(X5,sk1(X4,X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
c_0_9,
[final] ).
cnf(c_0_13,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X3,X2) ),
c_0_10,
[final] ).
cnf(c_0_14,plain,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
c_0_11,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_12_0,axiom,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_1,axiom,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_13_0,axiom,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_13_1,axiom,
( ~ reorganization_free(X1,X3,X2)
| reorganization_free(X1,X2,X2) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_14_0,axiom,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_14]) ).
cnf(c_0_14_1,axiom,
( ~ organization(X1,X2)
| reproducibility(X1,sk1(X2,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_14]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,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_5) ).
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(X3,X4)
| greater(X1,X2) ),
file('<stdin>',a3_FOL_4) ).
fof(c_0_2_003,hypothesis,
! [X4,X5,X6,X7,X8] :
( ~ organization(X8,X7)
| ~ organization(X8,X6)
| ~ reorganization_free(X8,X7,X6)
| ~ reproducibility(X8,X5,X7)
| ~ reproducibility(X8,X4,X6)
| ~ greater(X6,X7)
| greater(X4,X5) ),
file('<stdin>',a4_FOL_6) ).
fof(c_0_3_004,negated_conjecture,
inertia(sk2,sk4,sk6),
file('<stdin>',t2_FOL_11) ).
fof(c_0_4_005,negated_conjecture,
inertia(sk2,sk3,sk5),
file('<stdin>',t2_FOL_10) ).
fof(c_0_5_006,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('<stdin>',t2_FOL_9) ).
fof(c_0_6_007,negated_conjecture,
~ greater(sk4,sk3),
file('<stdin>',t2_FOL_13) ).
fof(c_0_7_008,negated_conjecture,
greater(sk6,sk5),
file('<stdin>',t2_FOL_12) ).
fof(c_0_8_009,negated_conjecture,
organization(sk2,sk6),
file('<stdin>',t2_FOL_8) ).
fof(c_0_9_010,negated_conjecture,
organization(sk2,sk5),
file('<stdin>',t2_FOL_7) ).
fof(c_0_10_011,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_0]) ).
fof(c_0_11_012,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_1]) ).
fof(c_0_12_013,hypothesis,
! [X4,X5,X6,X7,X8] :
( ~ organization(X8,X7)
| ~ organization(X8,X6)
| ~ reorganization_free(X8,X7,X6)
| ~ reproducibility(X8,X5,X7)
| ~ reproducibility(X8,X4,X6)
| ~ greater(X6,X7)
| greater(X4,X5) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_13_014,negated_conjecture,
inertia(sk2,sk4,sk6),
c_0_3 ).
fof(c_0_14_015,negated_conjecture,
inertia(sk2,sk3,sk5),
c_0_4 ).
fof(c_0_15,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
c_0_5 ).
fof(c_0_16,negated_conjecture,
~ greater(sk4,sk3),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_17,negated_conjecture,
greater(sk6,sk5),
c_0_7 ).
fof(c_0_18,negated_conjecture,
organization(sk2,sk6),
c_0_8 ).
fof(c_0_19,negated_conjecture,
organization(sk2,sk5),
c_0_9 ).
fof(c_0_20,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_10]) ).
fof(c_0_21,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_11]) ).
fof(c_0_22,hypothesis,
! [X9,X10,X11,X12,X13] :
( ~ organization(X13,X12)
| ~ organization(X13,X11)
| ~ reorganization_free(X13,X12,X11)
| ~ reproducibility(X13,X10,X12)
| ~ reproducibility(X13,X9,X11)
| ~ greater(X11,X12)
| greater(X9,X10) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_23,negated_conjecture,
inertia(sk2,sk4,sk6),
c_0_13 ).
fof(c_0_24,negated_conjecture,
inertia(sk2,sk3,sk5),
c_0_14 ).
fof(c_0_25,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
c_0_15 ).
fof(c_0_26,negated_conjecture,
~ greater(sk4,sk3),
c_0_16 ).
fof(c_0_27,negated_conjecture,
greater(sk6,sk5),
c_0_17 ).
fof(c_0_28,negated_conjecture,
organization(sk2,sk6),
c_0_18 ).
fof(c_0_29,negated_conjecture,
organization(sk2,sk5),
c_0_19 ).
cnf(c_0_30,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_20]) ).
cnf(c_0_31,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_21]) ).
cnf(c_0_32,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ reproducibility(X5,X1,X3)
| ~ reproducibility(X5,X2,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
inertia(sk2,sk4,sk6),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
inertia(sk2,sk3,sk5),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,negated_conjecture,
~ greater(sk4,sk3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,negated_conjecture,
greater(sk6,sk5),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
organization(sk2,sk6),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,negated_conjecture,
organization(sk2,sk5),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,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_30,
[final] ).
cnf(c_0_41,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_31,
[final] ).
cnf(c_0_42,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ reproducibility(X5,X1,X3)
| ~ reproducibility(X5,X2,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
c_0_32,
[final] ).
cnf(c_0_43,negated_conjecture,
inertia(sk2,sk4,sk6),
c_0_33,
[final] ).
cnf(c_0_44,negated_conjecture,
inertia(sk2,sk3,sk5),
c_0_34,
[final] ).
cnf(c_0_45,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
c_0_35,
[final] ).
cnf(c_0_46,negated_conjecture,
~ greater(sk4,sk3),
c_0_36,
[final] ).
cnf(c_0_47,negated_conjecture,
greater(sk6,sk5),
c_0_37,
[final] ).
cnf(c_0_48,negated_conjecture,
organization(sk2,sk6),
c_0_38,
[final] ).
cnf(c_0_49,negated_conjecture,
organization(sk2,sk5),
c_0_39,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_7,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X6,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_41) ).
cnf(c_19,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X6,X3) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_52,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X6,X3) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_69,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X6,X3) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_72,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X6,X3) ),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_111,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X6,X3) ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_10,negated_conjecture,
inertia(sk2,sk4,sk6),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_43) ).
cnf(c_25,negated_conjecture,
inertia(sk2,sk4,sk6),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_55,negated_conjecture,
inertia(sk2,sk4,sk6),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_66,negated_conjecture,
inertia(sk2,sk4,sk6),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_75,negated_conjecture,
inertia(sk2,sk4,sk6),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_117,negated_conjecture,
inertia(sk2,sk4,sk6),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_279,plain,
( ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(X0,X1,X1)
| ~ reproducibility(sk2,X2,sk6)
| ~ reproducibility(X0,X3,X1)
| ~ organization(sk2,sk6)
| ~ organization(X0,X1)
| greater(sk4,X4)
| ~ greater(X2,X3)
| ~ inertia(X0,X4,X1) ),
inference(resolution,[status(thm)],[c_111,c_117]) ).
cnf(c_280,plain,
( ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(X0,X1,X1)
| ~ reproducibility(sk2,X2,sk6)
| ~ reproducibility(X0,X3,X1)
| ~ organization(sk2,sk6)
| ~ organization(X0,X1)
| greater(sk4,X4)
| ~ greater(X2,X3)
| ~ inertia(X0,X4,X1) ),
inference(rewriting,[status(thm)],[c_279]) ).
cnf(c_14,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_48) ).
cnf(c_33,negated_conjecture,
organization(sk2,sk6),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_59,negated_conjecture,
organization(sk2,sk6),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_62,negated_conjecture,
organization(sk2,sk6),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_79,negated_conjecture,
organization(sk2,sk6),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_125,negated_conjecture,
organization(sk2,sk6),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_12,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_45) ).
cnf(c_29,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_57,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_64,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_77,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_121,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_3,plain,
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_13_1) ).
cnf(c_103,plain,
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X2,X1) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_145,plain,
reorganization_free(sk2,sk6,sk6),
inference(resolution,[status(thm)],[c_121,c_103]) ).
cnf(c_146,plain,
reorganization_free(sk2,sk6,sk6),
inference(rewriting,[status(thm)],[c_145]) ).
cnf(c_314,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reproducibility(sk2,X2,sk6)
| ~ reproducibility(X0,X3,X1)
| ~ organization(X0,X1)
| greater(sk4,X4)
| ~ greater(X2,X3)
| ~ inertia(X0,X4,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_280,c_125,c_146]) ).
cnf(c_315,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reproducibility(sk2,X2,sk6)
| ~ reproducibility(X0,X3,X1)
| ~ organization(X0,X1)
| greater(sk4,X4)
| ~ greater(X2,X3)
| ~ inertia(X0,X4,X1) ),
inference(rewriting,[status(thm)],[c_314]) ).
cnf(c_11,negated_conjecture,
inertia(sk2,sk3,sk5),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_44) ).
cnf(c_27,negated_conjecture,
inertia(sk2,sk3,sk5),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_56,negated_conjecture,
inertia(sk2,sk3,sk5),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_65,negated_conjecture,
inertia(sk2,sk3,sk5),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_76,negated_conjecture,
inertia(sk2,sk3,sk5),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_119,negated_conjecture,
inertia(sk2,sk3,sk5),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_325,plain,
( ~ reorganization_free(sk2,sk5,sk5)
| ~ reproducibility(sk2,X0,sk6)
| ~ reproducibility(sk2,X1,sk5)
| ~ organization(sk2,sk5)
| greater(sk4,sk3)
| ~ greater(X0,X1) ),
inference(resolution,[status(thm)],[c_315,c_119]) ).
cnf(c_326,plain,
( ~ reorganization_free(sk2,sk5,sk5)
| ~ reproducibility(sk2,X0,sk6)
| ~ reproducibility(sk2,X1,sk5)
| ~ organization(sk2,sk5)
| greater(sk4,sk3)
| ~ greater(X0,X1) ),
inference(rewriting,[status(thm)],[c_325]) ).
cnf(c_9,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_46) ).
cnf(c_23,negated_conjecture,
~ greater(sk4,sk3),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_54,negated_conjecture,
~ greater(sk4,sk3),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_67,negated_conjecture,
~ greater(sk4,sk3),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_74,negated_conjecture,
~ greater(sk4,sk3),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_115,plain,
~ greater(sk4,sk3),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_15,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_49) ).
cnf(c_35,negated_conjecture,
organization(sk2,sk5),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_60,negated_conjecture,
organization(sk2,sk5),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_61,negated_conjecture,
organization(sk2,sk5),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_80,negated_conjecture,
organization(sk2,sk5),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_127,negated_conjecture,
organization(sk2,sk5),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_1,plain,
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_12_1) ).
cnf(c_99,plain,
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_143,plain,
reorganization_free(sk2,sk5,sk5),
inference(resolution,[status(thm)],[c_121,c_99]) ).
cnf(c_144,plain,
reorganization_free(sk2,sk5,sk5),
inference(rewriting,[status(thm)],[c_143]) ).
cnf(c_416,plain,
( ~ reproducibility(sk2,X0,sk6)
| ~ reproducibility(sk2,X1,sk5)
| ~ greater(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_326,c_115,c_127,c_144]) ).
cnf(c_417,plain,
( ~ reproducibility(sk2,X0,sk6)
| ~ reproducibility(sk2,X1,sk5)
| ~ greater(X0,X1) ),
inference(rewriting,[status(thm)],[c_416]) ).
cnf(c_8,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_42) ).
cnf(c_21,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_53,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_68,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_73,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_113,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_4,plain,
( ~ organization(X0,X1)
| reproducibility(X0,sk1(X1,X0),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_14_0) ).
cnf(c_105,plain,
( ~ organization(X0,X1)
| reproducibility(X0,sk1(X1,X0),X1) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_106,plain,
( reproducibility(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
inference(rewriting,[status(thm)],[c_105]) ).
cnf(c_173,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| greater(sk1(X2,X0),X3)
| ~ greater(X2,X1) ),
inference(resolution,[status(thm)],[c_113,c_106]) ).
cnf(c_174,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| greater(sk1(X2,X0),X3)
| ~ greater(X2,X1) ),
inference(rewriting,[status(thm)],[c_173]) ).
cnf(c_187,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| greater(sk1(X2,X0),sk1(X1,X0))
| ~ greater(X2,X1) ),
inference(resolution,[status(thm)],[c_174,c_106]) ).
cnf(c_188,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| greater(sk1(X2,X0),sk1(X1,X0))
| ~ greater(X2,X1) ),
inference(rewriting,[status(thm)],[c_187]) ).
cnf(c_423,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(sk2,sk1(X2,X0),sk6)
| ~ reproducibility(sk2,sk1(X1,X0),sk5)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ greater(X2,X1) ),
inference(resolution,[status(thm)],[c_417,c_188]) ).
cnf(c_424,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(sk2,sk1(X2,X0),sk6)
| ~ reproducibility(sk2,sk1(X1,X0),sk5)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ greater(X2,X1) ),
inference(rewriting,[status(thm)],[c_423]) ).
cnf(c_610,plain,
( ~ reorganization_free(sk2,sk5,X0)
| ~ reproducibility(sk2,sk1(X0,sk2),sk6)
| ~ organization(sk2,sk5)
| ~ organization(sk2,X0)
| ~ greater(X0,sk5) ),
inference(resolution,[status(thm)],[c_424,c_106]) ).
cnf(c_611,plain,
( ~ reorganization_free(sk2,sk5,X0)
| ~ reproducibility(sk2,sk1(X0,sk2),sk6)
| ~ organization(sk2,sk5)
| ~ organization(sk2,X0)
| ~ greater(X0,sk5) ),
inference(rewriting,[status(thm)],[c_610]) ).
cnf(c_696,plain,
( ~ reorganization_free(sk2,sk5,X0)
| ~ reproducibility(sk2,sk1(X0,sk2),sk6)
| ~ organization(sk2,X0)
| ~ greater(X0,sk5) ),
inference(forward_subsumption_resolution,[status(thm)],[c_611,c_127]) ).
cnf(c_697,plain,
( ~ reorganization_free(sk2,sk5,X0)
| ~ reproducibility(sk2,sk1(X0,sk2),sk6)
| ~ organization(sk2,X0)
| ~ greater(X0,sk5) ),
inference(rewriting,[status(thm)],[c_696]) ).
cnf(c_702,plain,
( ~ reorganization_free(sk2,sk5,sk6)
| ~ organization(sk2,sk6)
| ~ greater(sk6,sk5) ),
inference(resolution,[status(thm)],[c_697,c_106]) ).
cnf(c_703,plain,
( ~ reorganization_free(sk2,sk5,sk6)
| ~ organization(sk2,sk6)
| ~ greater(sk6,sk5) ),
inference(rewriting,[status(thm)],[c_702]) ).
cnf(c_13,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p',c_0_47) ).
cnf(c_31,negated_conjecture,
greater(sk6,sk5),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_58,negated_conjecture,
greater(sk6,sk5),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_63,negated_conjecture,
greater(sk6,sk5),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_78,negated_conjecture,
greater(sk6,sk5),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_123,negated_conjecture,
greater(sk6,sk5),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_717,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_703,c_123,c_125,c_121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : MGT002-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 12:17:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.39 % Orientation found
% 0.12/0.39 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c5eb50.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_7d4749.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_f5dd68 | grep -v "SZS"
% 0.20/0.41
% 0.20/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ iProver source info
% 0.20/0.41
% 0.20/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.41 % git: non_committed_changes: true
% 0.20/0.41 % git: last_make_outside_of_git: true
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ Input Options
% 0.20/0.41
% 0.20/0.41 % --out_options all
% 0.20/0.41 % --tptp_safe_out true
% 0.20/0.41 % --problem_path ""
% 0.20/0.41 % --include_path ""
% 0.20/0.41 % --clausifier .//eprover
% 0.20/0.41 % --clausifier_options --tstp-format
% 0.20/0.41 % --stdin false
% 0.20/0.41 % --dbg_backtrace false
% 0.20/0.41 % --dbg_dump_prop_clauses false
% 0.20/0.41 % --dbg_dump_prop_clauses_file -
% 0.20/0.41 % --dbg_out_stat false
% 0.20/0.41
% 0.20/0.41 % ------ General Options
% 0.20/0.41
% 0.20/0.41 % --fof false
% 0.20/0.41 % --time_out_real 150.
% 0.20/0.41 % --time_out_prep_mult 0.2
% 0.20/0.41 % --time_out_virtual -1.
% 0.20/0.41 % --schedule none
% 0.20/0.41 % --ground_splitting input
% 0.20/0.41 % --splitting_nvd 16
% 0.20/0.41 % --non_eq_to_eq false
% 0.20/0.41 % --prep_gs_sim true
% 0.20/0.41 % --prep_unflatten false
% 0.20/0.41 % --prep_res_sim true
% 0.20/0.41 % --prep_upred true
% 0.20/0.41 % --res_sim_input true
% 0.20/0.41 % --clause_weak_htbl true
% 0.20/0.41 % --gc_record_bc_elim false
% 0.20/0.41 % --symbol_type_check false
% 0.20/0.41 % --clausify_out false
% 0.20/0.41 % --large_theory_mode false
% 0.20/0.41 % --prep_sem_filter none
% 0.20/0.41 % --prep_sem_filter_out false
% 0.20/0.41 % --preprocessed_out false
% 0.20/0.41 % --sub_typing false
% 0.20/0.41 % --brand_transform false
% 0.20/0.41 % --pure_diseq_elim true
% 0.20/0.41 % --min_unsat_core false
% 0.20/0.41 % --pred_elim true
% 0.20/0.41 % --add_important_lit false
% 0.20/0.41 % --soft_assumptions false
% 0.20/0.41 % --reset_solvers false
% 0.20/0.41 % --bc_imp_inh []
% 0.20/0.41 % --conj_cone_tolerance 1.5
% 0.20/0.41 % --prolific_symb_bound 500
% 0.20/0.41 % --lt_threshold 2000
% 0.20/0.41
% 0.20/0.41 % ------ SAT Options
% 0.20/0.41
% 0.20/0.41 % --sat_mode false
% 0.20/0.41 % --sat_fm_restart_options ""
% 0.20/0.41 % --sat_gr_def false
% 0.20/0.41 % --sat_epr_types true
% 0.20/0.41 % --sat_non_cyclic_types false
% 0.20/0.41 % --sat_finite_models false
% 0.20/0.41 % --sat_fm_lemmas false
% 0.20/0.41 % --sat_fm_prep false
% 0.20/0.41 % --sat_fm_uc_incr true
% 0.20/0.41 % --sat_out_model small
% 0.20/0.41 % --sat_out_clauses false
% 0.20/0.41
% 0.20/0.41 % ------ QBF Options
% 0.20/0.41
% 0.20/0.41 % --qbf_mode false
% 0.20/0.41 % --qbf_elim_univ true
% 0.20/0.41 % --qbf_sk_in true
% 0.20/0.41 % --qbf_pred_elim true
% 0.20/0.41 % --qbf_split 32
% 0.20/0.41
% 0.20/0.41 % ------ BMC1 Options
% 0.20/0.41
% 0.20/0.41 % --bmc1_incremental false
% 0.20/0.41 % --bmc1_axioms reachable_all
% 0.20/0.41 % --bmc1_min_bound 0
% 0.20/0.41 % --bmc1_max_bound -1
% 0.20/0.41 % --bmc1_max_bound_default -1
% 0.20/0.41 % --bmc1_symbol_reachability true
% 0.20/0.41 % --bmc1_property_lemmas false
% 0.20/0.41 % --bmc1_k_induction false
% 0.20/0.41 % --bmc1_non_equiv_states false
% 0.20/0.41 % --bmc1_deadlock false
% 0.20/0.41 % --bmc1_ucm false
% 0.20/0.41 % --bmc1_add_unsat_core none
% 0.20/0.41 % --bmc1_unsat_core_children false
% 0.20/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.41 % --bmc1_out_stat full
% 0.20/0.41 % --bmc1_ground_init false
% 0.20/0.41 % --bmc1_pre_inst_next_state false
% 0.20/0.41 % --bmc1_pre_inst_state false
% 0.20/0.41 % --bmc1_pre_inst_reach_state false
% 0.20/0.41 % --bmc1_out_unsat_core false
% 0.20/0.41 % --bmc1_aig_witness_out false
% 0.20/0.41 % --bmc1_verbose false
% 0.20/0.41 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c5eb50.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ 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.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn true
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 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.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --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_c5eb50.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
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 %
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % Resolution empty clause
% 0.20/0.44
% 0.20/0.44 % ------ Statistics
% 0.20/0.44
% 0.20/0.44 % ------ General
% 0.20/0.44
% 0.20/0.44 % num_of_input_clauses: 16
% 0.20/0.44 % num_of_input_neg_conjectures: 7
% 0.20/0.44 % num_of_splits: 0
% 0.20/0.44 % num_of_split_atoms: 0
% 0.20/0.44 % num_of_sem_filtered_clauses: 0
% 0.20/0.44 % num_of_subtypes: 0
% 0.20/0.44 % monotx_restored_types: 0
% 0.20/0.44 % sat_num_of_epr_types: 0
% 0.20/0.44 % sat_num_of_non_cyclic_types: 0
% 0.20/0.44 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 1
% 0.20/0.44 % has_eq: 0
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 17
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 1
% 0.20/0.44 % pred_elim: 0
% 0.20/0.44 % pred_elim_cl: 0
% 0.20/0.44 % pred_elim_cycles: 1
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.
% 0.20/0.44 % out_proof_time: 0.004
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.04
% 0.20/0.44 % num_of_symbols: 36
% 0.20/0.44 % num_of_terms: 209
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 1
% 0.20/0.44 % prop_fast_solver_calls: 75
% 0.20/0.44 % prop_num_of_clauses: 15
% 0.20/0.44 % prop_preprocess_simplified: 121
% 0.20/0.44 % prop_fo_subsumed: 0
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: 16
% 0.20/0.44 % inst_num_in_passive: 0
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 16
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: 55
% 0.20/0.44 % res_num_in_passive: 4
% 0.20/0.44 % res_num_in_active: 49
% 0.20/0.44 % res_num_of_loops: 56
% 0.20/0.44 % res_forward_subset_subsumed: 6
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 5
% 0.20/0.44 % res_backward_subsumed: 5
% 0.20/0.44 % res_forward_subsumption_resolution: 36
% 0.20/0.44 % res_backward_subsumption_resolution: 1
% 0.20/0.44 % res_clause_to_clause_subsumption: 221
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 3
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unsatisfiable
% 0.20/0.44 % SZS status Unsatisfiable
% 0.20/0.44 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------