TSTP Solution File: MGT014+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.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:44 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 25
% Syntax : Number of formulae : 192 ( 81 unt; 0 def)
% Number of atoms : 599 ( 53 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 770 ( 363 ~; 337 |; 56 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 14 con; 0-0 aty)
% Number of variables : 334 ( 7 sgn 92 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& X4 = X5 )
=> X6 = X7 ),
file('<stdin>',mp19) ).
fof(c_0_1,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
file('<stdin>',mp17) ).
fof(c_0_2,axiom,
! [X4,X5] :
( ( time(X4)
& time(X5) )
=> ( greater(X4,X5)
| X4 = X5
| greater(X5,X4) ) ),
file('<stdin>',mp16) ).
fof(c_0_3,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& greater(X2,X1) ),
file('<stdin>',mp6_2) ).
fof(c_0_4,axiom,
! [X1,X3] :
( organization(X1,X3)
=> time(X3) ),
file('<stdin>',mp15) ).
fof(c_0_5,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& X1 = X2 ),
file('<stdin>',mp6_1) ).
fof(c_0_6,axiom,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& X4 = X5 )
=> X6 = X7 ),
c_0_0 ).
fof(c_0_7,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
c_0_1 ).
fof(c_0_8,axiom,
! [X4,X5] :
( ( time(X4)
& time(X5) )
=> ( greater(X4,X5)
| X4 = X5
| greater(X5,X4) ) ),
c_0_2 ).
fof(c_0_9,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& greater(X2,X1) ),
c_0_3 ).
fof(c_0_10,axiom,
! [X1,X3] :
( organization(X1,X3)
=> time(X3) ),
c_0_4 ).
fof(c_0_11,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& X1 = X2 ),
c_0_5 ).
fof(c_0_12,plain,
! [X8,X9,X10,X11,X12] :
( ~ organization(X8,X11)
| ~ organization(X8,X12)
| ~ size(X8,X9,X11)
| ~ size(X8,X10,X12)
| X11 != X12
| X9 = X10 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_13,plain,
! [X6,X7,X8] :
( ~ reorganization_free(X6,X7,X8)
| reorganization_free(X6,X8,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_14,plain,
! [X6,X7] :
( ~ time(X6)
| ~ time(X7)
| greater(X6,X7)
| X6 = X7
| greater(X7,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ greater(X3,X4)
| ~ greater(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
fof(c_0_16,plain,
! [X4,X5] :
( ~ organization(X4,X5)
| time(X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ greater(X3,X4)
| X3 != X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
cnf(c_0_18,plain,
( X1 = X2
| X3 != X4
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( greater(X1,X2)
| X2 = X1
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( time(X1)
| ~ organization(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( X1 = X2
| X3 != X4
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
c_0_18,
[final] ).
cnf(c_0_25,plain,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
c_0_19,
[final] ).
cnf(c_0_26,plain,
( greater(X1,X2)
| X2 = X1
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
c_0_20,
[final] ).
cnf(c_0_27,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
c_0_21,
[final] ).
cnf(c_0_28,plain,
( time(X1)
| ~ organization(X2,X1) ),
c_0_22,
[final] ).
cnf(c_0_29,plain,
( X1 != X2
| ~ greater(X1,X2) ),
c_0_23,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_24_0,axiom,
( X1 = X2
| X3 != X4
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( X3 != X4
| X1 = X2
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_2,axiom,
( ~ size(X5,X2,X4)
| X3 != X4
| X1 = X2
| ~ size(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_3,axiom,
( ~ size(X5,X1,X3)
| ~ size(X5,X2,X4)
| X3 != X4
| X1 = X2
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_4,axiom,
( ~ organization(X5,X4)
| ~ size(X5,X1,X3)
| ~ size(X5,X2,X4)
| X3 != X4
| X1 = X2
| ~ organization(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_5,axiom,
( ~ organization(X5,X3)
| ~ organization(X5,X4)
| ~ size(X5,X1,X3)
| ~ size(X5,X2,X4)
| X3 != X4
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_25_0,axiom,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_1,axiom,
( ~ reorganization_free(X1,X3,X2)
| reorganization_free(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_26_0,axiom,
( greater(X1,X2)
| X2 = X1
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_1,axiom,
( X2 = X1
| greater(X1,X2)
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_2,axiom,
( greater(X2,X1)
| X2 = X1
| greater(X1,X2)
| ~ time(X1)
| ~ time(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_3,axiom,
( ~ time(X1)
| greater(X2,X1)
| X2 = X1
| greater(X1,X2)
| ~ time(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_4,axiom,
( ~ time(X2)
| ~ time(X1)
| greater(X2,X1)
| X2 = X1
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_27_0,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_0,axiom,
( time(X1)
| ~ organization(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( ~ organization(X2,X1)
| time(X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( X1 != X2
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X6,X4)
& complexity(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
file('<stdin>',t12_FOL) ).
fof(c_0_1_002,hypothesis,
! [X1,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X5,X4) )
=> ~ greater(X2,X3) ),
file('<stdin>',t11_FOL) ).
fof(c_0_2_003,conjecture,
! [X1,X6,X7,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X6,X4)
& complexity(X1,X7,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X3,X2) )
=> ~ greater(X6,X7) ),
file('<stdin>',t14_FOL) ).
fof(c_0_3_004,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X6,X4)
& complexity(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4_005,hypothesis,
! [X1,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X5,X4) )
=> ~ greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_5_006,negated_conjecture,
~ ! [X1,X6,X7,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X6,X4)
& complexity(X1,X7,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X3,X2) )
=> ~ greater(X6,X7) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_2])]) ).
fof(c_0_6_007,hypothesis,
! [X8,X9,X10,X11,X12] :
( ~ organization(X8,X11)
| ~ organization(X8,X12)
| ~ reorganization_free(X8,X11,X12)
| ~ complexity(X8,X9,X11)
| ~ complexity(X8,X10,X12)
| ~ greater(X12,X11)
| ~ greater(X9,X10) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_7_008,hypothesis,
! [X6,X7,X8,X9,X10] :
( ~ organization(X6,X9)
| ~ organization(X6,X10)
| ~ reorganization_free(X6,X9,X10)
| ~ size(X6,X7,X9)
| ~ size(X6,X8,X10)
| ~ greater(X10,X9)
| ~ greater(X7,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_8_009,negated_conjecture,
( organization(esk1_0,esk6_0)
& organization(esk1_0,esk7_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& complexity(esk1_0,esk2_0,esk6_0)
& complexity(esk1_0,esk3_0,esk7_0)
& size(esk1_0,esk4_0,esk6_0)
& size(esk1_0,esk5_0,esk7_0)
& greater(esk5_0,esk4_0)
& greater(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_9_010,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ complexity(X5,X2,X3)
| ~ complexity(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_011,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ size(X5,X2,X3)
| ~ size(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11_012,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12_013,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_014,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14_015,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15_016,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16_017,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17_018,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18_019,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19_020,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20_021,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ complexity(X5,X2,X3)
| ~ complexity(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
c_0_9,
[final] ).
cnf(c_0_21_022,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ size(X5,X2,X3)
| ~ size(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
c_0_10,
[final] ).
cnf(c_0_22_023,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
c_0_11,
[final] ).
cnf(c_0_23_024,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
c_0_12,
[final] ).
cnf(c_0_24_025,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
c_0_13,
[final] ).
cnf(c_0_25_026,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
c_0_14,
[final] ).
cnf(c_0_26_027,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
c_0_15,
[final] ).
cnf(c_0_27_028,negated_conjecture,
organization(esk1_0,esk6_0),
c_0_16,
[final] ).
cnf(c_0_28_029,negated_conjecture,
organization(esk1_0,esk7_0),
c_0_17,
[final] ).
cnf(c_0_29_030,negated_conjecture,
greater(esk5_0,esk4_0),
c_0_18,
[final] ).
cnf(c_0_30,negated_conjecture,
greater(esk2_0,esk3_0),
c_0_19,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_28,negated_conjecture,
greater(sk2_esk5_0,sk2_esk4_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_29) ).
cnf(c_53,negated_conjecture,
greater(sk2_esk5_0,sk2_esk4_0),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_84,negated_conjecture,
greater(sk2_esk5_0,sk2_esk4_0),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_87,negated_conjecture,
greater(sk2_esk5_0,sk2_esk4_0),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_106,negated_conjecture,
greater(sk2_esk5_0,sk2_esk4_0),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_194,plain,
greater(sk2_esk5_0,sk2_esk4_0),
inference(copy,[status(esa)],[c_106]) ).
cnf(c_0,plain,
( X0 != X1
| ~ greater(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_29_1) ).
cnf(c_138,plain,
( X0 != X1
| ~ greater(X0,X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_139,plain,
( ~ greater(X0,X1)
| X0 != X1 ),
inference(rewriting,[status(thm)],[c_138]) ).
cnf(c_216,plain,
sk2_esk5_0 != sk2_esk4_0,
inference(resolution,[status(thm)],[c_194,c_139]) ).
cnf(c_217,plain,
sk2_esk5_0 != sk2_esk4_0,
inference(rewriting,[status(thm)],[c_216]) ).
cnf(c_18,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2)
| X1 != X2
| X3 = X4 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_24_0) ).
cnf(c_174,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2)
| X1 != X2
| X3 = X4 ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_254,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ size(X0,sk2_esk4_0,X2)
| ~ size(X0,sk2_esk5_0,X1)
| X1 != X2 ),
inference(resolution,[status(thm)],[c_217,c_174]) ).
cnf(c_255,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ size(X0,sk2_esk4_0,X2)
| ~ size(X0,sk2_esk5_0,X1)
| X1 != X2 ),
inference(rewriting,[status(thm)],[c_254]) ).
cnf(c_9,plain,
( ~ time(X0)
| ~ time(X1)
| greater(X0,X1)
| greater(X1,X0)
| X0 = X1 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_26_1) ).
cnf(c_156,plain,
( ~ time(X0)
| ~ time(X1)
| greater(X0,X1)
| greater(X1,X0)
| X0 = X1 ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_157,plain,
( greater(X0,X1)
| greater(X1,X0)
| ~ time(X0)
| ~ time(X1)
| X0 = X1 ),
inference(rewriting,[status(thm)],[c_156]) ).
cnf(c_579,plain,
( greater(X0,X1)
| greater(X1,X0)
| ~ organization(X2,X0)
| ~ organization(X2,X1)
| ~ time(X0)
| ~ time(X1)
| ~ size(X2,sk2_esk4_0,X1)
| ~ size(X2,sk2_esk5_0,X0) ),
inference(resolution,[status(thm)],[c_255,c_157]) ).
cnf(c_580,plain,
( greater(X0,X1)
| greater(X1,X0)
| ~ organization(X2,X0)
| ~ organization(X2,X1)
| ~ time(X0)
| ~ time(X1)
| ~ size(X2,sk2_esk4_0,X1)
| ~ size(X2,sk2_esk5_0,X0) ),
inference(rewriting,[status(thm)],[c_579]) ).
cnf(c_2,plain,
( time(X0)
| ~ organization(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_28_1) ).
cnf(c_142,plain,
( time(X0)
| ~ organization(X1,X0) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_143,plain,
( ~ organization(X0,X1)
| time(X1) ),
inference(rewriting,[status(thm)],[c_142]) ).
cnf(c_1033,plain,
( greater(X0,X1)
| greater(X1,X0)
| ~ organization(X2,X0)
| ~ organization(X2,X1)
| ~ size(X2,sk2_esk4_0,X1)
| ~ size(X2,sk2_esk5_0,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_580,c_143,c_143]) ).
cnf(c_1034,plain,
( greater(X0,X1)
| greater(X1,X0)
| ~ organization(X2,X0)
| ~ organization(X2,X1)
| ~ size(X2,sk2_esk4_0,X1)
| ~ size(X2,sk2_esk5_0,X0) ),
inference(rewriting,[status(thm)],[c_1033]) ).
cnf(c_25,negated_conjecture,
size(sk2_esk1_0,sk2_esk5_0,sk2_esk7_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_26) ).
cnf(c_47,negated_conjecture,
size(sk2_esk1_0,sk2_esk5_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_81,negated_conjecture,
size(sk2_esk1_0,sk2_esk5_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_90,negated_conjecture,
size(sk2_esk1_0,sk2_esk5_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_103,negated_conjecture,
size(sk2_esk1_0,sk2_esk5_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_188,negated_conjecture,
size(sk2_esk1_0,sk2_esk5_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_1041,plain,
( greater(sk2_esk7_0,X0)
| greater(X0,sk2_esk7_0)
| ~ organization(sk2_esk1_0,sk2_esk7_0)
| ~ organization(sk2_esk1_0,X0)
| ~ size(sk2_esk1_0,sk2_esk4_0,X0) ),
inference(resolution,[status(thm)],[c_1034,c_188]) ).
cnf(c_1042,plain,
( greater(sk2_esk7_0,X0)
| greater(X0,sk2_esk7_0)
| ~ organization(sk2_esk1_0,sk2_esk7_0)
| ~ organization(sk2_esk1_0,X0)
| ~ size(sk2_esk1_0,sk2_esk4_0,X0) ),
inference(rewriting,[status(thm)],[c_1041]) ).
cnf(c_27,negated_conjecture,
organization(sk2_esk1_0,sk2_esk7_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_28) ).
cnf(c_51,negated_conjecture,
organization(sk2_esk1_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_83,negated_conjecture,
organization(sk2_esk1_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_88,negated_conjecture,
organization(sk2_esk1_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_105,negated_conjecture,
organization(sk2_esk1_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_192,negated_conjecture,
organization(sk2_esk1_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_105]) ).
cnf(c_1048,plain,
( greater(sk2_esk7_0,X0)
| greater(X0,sk2_esk7_0)
| ~ organization(sk2_esk1_0,X0)
| ~ size(sk2_esk1_0,sk2_esk4_0,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1042,c_192]) ).
cnf(c_1049,plain,
( greater(sk2_esk7_0,X0)
| greater(X0,sk2_esk7_0)
| ~ organization(sk2_esk1_0,X0)
| ~ size(sk2_esk1_0,sk2_esk4_0,X0) ),
inference(rewriting,[status(thm)],[c_1048]) ).
cnf(c_24,negated_conjecture,
size(sk2_esk1_0,sk2_esk4_0,sk2_esk6_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_25) ).
cnf(c_45,negated_conjecture,
size(sk2_esk1_0,sk2_esk4_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_80,negated_conjecture,
size(sk2_esk1_0,sk2_esk4_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_91,negated_conjecture,
size(sk2_esk1_0,sk2_esk4_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_102,negated_conjecture,
size(sk2_esk1_0,sk2_esk4_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_186,negated_conjecture,
size(sk2_esk1_0,sk2_esk4_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_1054,plain,
( greater(sk2_esk6_0,sk2_esk7_0)
| greater(sk2_esk7_0,sk2_esk6_0)
| ~ organization(sk2_esk1_0,sk2_esk6_0) ),
inference(resolution,[status(thm)],[c_1049,c_186]) ).
cnf(c_1055,plain,
( greater(sk2_esk6_0,sk2_esk7_0)
| greater(sk2_esk7_0,sk2_esk6_0)
| ~ organization(sk2_esk1_0,sk2_esk6_0) ),
inference(rewriting,[status(thm)],[c_1054]) ).
cnf(c_26,negated_conjecture,
organization(sk2_esk1_0,sk2_esk6_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_27) ).
cnf(c_49,negated_conjecture,
organization(sk2_esk1_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_82,negated_conjecture,
organization(sk2_esk1_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_89,negated_conjecture,
organization(sk2_esk1_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_104,negated_conjecture,
organization(sk2_esk1_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_190,negated_conjecture,
organization(sk2_esk1_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_19,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ complexity(X4,X2,X1)
| ~ complexity(X4,X3,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_20) ).
cnf(c_35,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ complexity(X4,X2,X1)
| ~ complexity(X4,X3,X0) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_75,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ complexity(X4,X2,X1)
| ~ complexity(X4,X3,X0) ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_96,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ complexity(X4,X2,X1)
| ~ complexity(X4,X3,X0) ),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_97,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ complexity(X4,X2,X1)
| ~ complexity(X4,X3,X0) ),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_176,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ complexity(X4,X2,X1)
| ~ complexity(X4,X3,X0) ),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_23,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk3_0,sk2_esk7_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_24) ).
cnf(c_43,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk3_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_79,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk3_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_92,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk3_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_101,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk3_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_92]) ).
cnf(c_184,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk3_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_278,plain,
( ~ greater(sk2_esk7_0,X0)
| ~ greater(X1,sk2_esk3_0)
| ~ organization(sk2_esk1_0,sk2_esk7_0)
| ~ organization(sk2_esk1_0,X0)
| ~ reorganization_free(sk2_esk1_0,X0,sk2_esk7_0)
| ~ complexity(sk2_esk1_0,X1,X0) ),
inference(resolution,[status(thm)],[c_176,c_184]) ).
cnf(c_279,plain,
( ~ greater(sk2_esk7_0,X0)
| ~ greater(X1,sk2_esk3_0)
| ~ organization(sk2_esk1_0,sk2_esk7_0)
| ~ organization(sk2_esk1_0,X0)
| ~ reorganization_free(sk2_esk1_0,X0,sk2_esk7_0)
| ~ complexity(sk2_esk1_0,X1,X0) ),
inference(rewriting,[status(thm)],[c_278]) ).
cnf(c_391,plain,
( ~ greater(sk2_esk7_0,X0)
| ~ greater(X1,sk2_esk3_0)
| ~ organization(sk2_esk1_0,X0)
| ~ reorganization_free(sk2_esk1_0,X0,sk2_esk7_0)
| ~ complexity(sk2_esk1_0,X1,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_279,c_192]) ).
cnf(c_392,plain,
( ~ greater(sk2_esk7_0,X0)
| ~ greater(X1,sk2_esk3_0)
| ~ organization(sk2_esk1_0,X0)
| ~ reorganization_free(sk2_esk1_0,X0,sk2_esk7_0)
| ~ complexity(sk2_esk1_0,X1,X0) ),
inference(rewriting,[status(thm)],[c_391]) ).
cnf(c_22,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk2_0,sk2_esk6_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_23) ).
cnf(c_41,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk2_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_78,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk2_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_93,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk2_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_100,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk2_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_182,negated_conjecture,
complexity(sk2_esk1_0,sk2_esk2_0,sk2_esk6_0),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_398,plain,
( ~ greater(sk2_esk7_0,sk2_esk6_0)
| ~ greater(sk2_esk2_0,sk2_esk3_0)
| ~ organization(sk2_esk1_0,sk2_esk6_0)
| ~ reorganization_free(sk2_esk1_0,sk2_esk6_0,sk2_esk7_0) ),
inference(resolution,[status(thm)],[c_392,c_182]) ).
cnf(c_399,plain,
( ~ greater(sk2_esk7_0,sk2_esk6_0)
| ~ greater(sk2_esk2_0,sk2_esk3_0)
| ~ organization(sk2_esk1_0,sk2_esk6_0)
| ~ reorganization_free(sk2_esk1_0,sk2_esk6_0,sk2_esk7_0) ),
inference(rewriting,[status(thm)],[c_398]) ).
cnf(c_21,negated_conjecture,
reorganization_free(sk2_esk1_0,sk2_esk6_0,sk2_esk7_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_22) ).
cnf(c_39,negated_conjecture,
reorganization_free(sk2_esk1_0,sk2_esk6_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_77,negated_conjecture,
reorganization_free(sk2_esk1_0,sk2_esk6_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_94,negated_conjecture,
reorganization_free(sk2_esk1_0,sk2_esk6_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_99,negated_conjecture,
reorganization_free(sk2_esk1_0,sk2_esk6_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_180,negated_conjecture,
reorganization_free(sk2_esk1_0,sk2_esk6_0,sk2_esk7_0),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_29,negated_conjecture,
greater(sk2_esk2_0,sk2_esk3_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_30) ).
cnf(c_55,negated_conjecture,
greater(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_85,negated_conjecture,
greater(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_86,negated_conjecture,
greater(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_107,negated_conjecture,
greater(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_196,plain,
greater(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_107]) ).
cnf(c_406,plain,
~ greater(sk2_esk7_0,sk2_esk6_0),
inference(forward_subsumption_resolution,[status(thm)],[c_399,c_180,c_190,c_196]) ).
cnf(c_407,plain,
~ greater(sk2_esk7_0,sk2_esk6_0),
inference(rewriting,[status(thm)],[c_406]) ).
cnf(c_20,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ size(X4,X2,X1)
| ~ size(X4,X3,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_21) ).
cnf(c_37,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ size(X4,X2,X1)
| ~ size(X4,X3,X0) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_76,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ size(X4,X2,X1)
| ~ size(X4,X3,X0) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_95,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ size(X4,X2,X1)
| ~ size(X4,X3,X0) ),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_98,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ size(X4,X2,X1)
| ~ size(X4,X3,X0) ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_178,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X3)
| ~ organization(X4,X1)
| ~ organization(X4,X0)
| ~ reorganization_free(X4,X1,X0)
| ~ size(X4,X2,X1)
| ~ size(X4,X3,X0) ),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_294,plain,
( ~ greater(sk2_esk6_0,X0)
| ~ greater(X1,sk2_esk4_0)
| ~ organization(sk2_esk1_0,sk2_esk6_0)
| ~ organization(sk2_esk1_0,X0)
| ~ reorganization_free(sk2_esk1_0,X0,sk2_esk6_0)
| ~ size(sk2_esk1_0,X1,X0) ),
inference(resolution,[status(thm)],[c_178,c_186]) ).
cnf(c_295,plain,
( ~ greater(sk2_esk6_0,X0)
| ~ greater(X1,sk2_esk4_0)
| ~ organization(sk2_esk1_0,sk2_esk6_0)
| ~ organization(sk2_esk1_0,X0)
| ~ reorganization_free(sk2_esk1_0,X0,sk2_esk6_0)
| ~ size(sk2_esk1_0,X1,X0) ),
inference(rewriting,[status(thm)],[c_294]) ).
cnf(c_426,plain,
( ~ greater(sk2_esk6_0,X0)
| ~ greater(X1,sk2_esk4_0)
| ~ organization(sk2_esk1_0,X0)
| ~ reorganization_free(sk2_esk1_0,X0,sk2_esk6_0)
| ~ size(sk2_esk1_0,X1,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_295,c_190]) ).
cnf(c_427,plain,
( ~ greater(sk2_esk6_0,X0)
| ~ greater(X1,sk2_esk4_0)
| ~ organization(sk2_esk1_0,X0)
| ~ reorganization_free(sk2_esk1_0,X0,sk2_esk6_0)
| ~ size(sk2_esk1_0,X1,X0) ),
inference(rewriting,[status(thm)],[c_426]) ).
cnf(c_435,plain,
( ~ greater(sk2_esk6_0,sk2_esk7_0)
| ~ greater(sk2_esk5_0,sk2_esk4_0)
| ~ organization(sk2_esk1_0,sk2_esk7_0)
| ~ reorganization_free(sk2_esk1_0,sk2_esk7_0,sk2_esk6_0) ),
inference(resolution,[status(thm)],[c_427,c_188]) ).
cnf(c_436,plain,
( ~ greater(sk2_esk6_0,sk2_esk7_0)
| ~ greater(sk2_esk5_0,sk2_esk4_0)
| ~ organization(sk2_esk1_0,sk2_esk7_0)
| ~ reorganization_free(sk2_esk1_0,sk2_esk7_0,sk2_esk6_0) ),
inference(rewriting,[status(thm)],[c_435]) ).
cnf(c_11,plain,
( reorganization_free(X0,X1,X2)
| ~ reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p',c_0_25_1) ).
cnf(c_160,plain,
( reorganization_free(X0,X1,X2)
| ~ reorganization_free(X0,X2,X1) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_228,plain,
reorganization_free(sk2_esk1_0,sk2_esk7_0,sk2_esk6_0),
inference(resolution,[status(thm)],[c_180,c_160]) ).
cnf(c_229,plain,
reorganization_free(sk2_esk1_0,sk2_esk7_0,sk2_esk6_0),
inference(rewriting,[status(thm)],[c_228]) ).
cnf(c_452,plain,
~ greater(sk2_esk6_0,sk2_esk7_0),
inference(forward_subsumption_resolution,[status(thm)],[c_436,c_229,c_192,c_194]) ).
cnf(c_453,plain,
~ greater(sk2_esk6_0,sk2_esk7_0),
inference(rewriting,[status(thm)],[c_452]) ).
cnf(c_1059,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1055,c_190,c_407,c_453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n024.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 11:21:04 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 % FOF problem with conjecture
% 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/sandbox/tmp/iprover_proof_9344f4.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_59149b | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.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/sandbox/tmp/iprover_proof_9344f4.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 true
% 0.20/0.42 % Horn false
% 0.20/0.42 % Has equality true
% 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.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9344f4.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % warning: shown sat in sat incomplete mode
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 cnf(c_13,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ size(X4,X2,X1)
% 0.20/0.43 | ~ size(X4,X3,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_21) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_31,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ size(X4,X2,X1)
% 0.20/0.43 | ~ size(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_70,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ size(X4,X2,X1)
% 0.20/0.43 | ~ size(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_89,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ size(X4,X2,X1)
% 0.20/0.43 | ~ size(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_70]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_98,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ size(X4,X2,X1)
% 0.20/0.43 | ~ size(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_89]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_163,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ size(X4,X2,X1)
% 0.20/0.43 | ~ size(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_98]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_17,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk4_0,sk3_esk6_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_25) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_39,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk4_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_74,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk4_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_85,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk4_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_74]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_91,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk4_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_85]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_149,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk4_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_91]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_265,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk4_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk6_0)
% 0.20/0.43 | ~ size(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_163,c_149]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_266,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk4_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk6_0)
% 0.20/0.43 | ~ size(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_265]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_19,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk6_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_27) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_43,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_76,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_43]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_83,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_76]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_93,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_83]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_153,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_93]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_309,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk4_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk6_0)
% 0.20/0.43 | ~ size(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_266,c_153]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_310,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk4_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk6_0)
% 0.20/0.43 | ~ size(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_309]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_18,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk5_0,sk3_esk7_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_26) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_41,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk5_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_75,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk5_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_41]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_84,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk5_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_75]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_92,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk5_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_84]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_151,negated_conjecture,
% 0.20/0.43 ( size(sk3_esk1_0,sk3_esk5_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_92]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_318,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk5_0,sk3_esk4_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk6_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_310,c_151]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_319,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk5_0,sk3_esk4_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk6_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_318]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_14,negated_conjecture,
% 0.20/0.43 ( reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_22) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_33,negated_conjecture,
% 0.20/0.43 ( reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_71,negated_conjecture,
% 0.20/0.43 ( reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_88,negated_conjecture,
% 0.20/0.43 ( reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_71]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_99,negated_conjecture,
% 0.20/0.43 ( reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_88]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_165,negated_conjecture,
% 0.20/0.43 ( reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_99]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_10,plain,
% 0.20/0.43 ( reorganization_free(X0,X1,X2) | ~ reorganization_free(X0,X2,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_13_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_145,plain,
% 0.20/0.43 ( reorganization_free(X0,X1,X2) | ~ reorganization_free(X0,X2,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_193,plain,
% 0.20/0.43 ( reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk6_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_165,c_145]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_194,plain,
% 0.20/0.43 ( reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk6_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_193]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_20,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk7_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_28) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_45,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_77,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_82,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_77]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_94,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_82]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_155,negated_conjecture,
% 0.20/0.43 ( organization(sk3_esk1_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_94]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_21,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk5_0,sk3_esk4_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_29) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_47,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk5_0,sk3_esk4_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_78,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk5_0,sk3_esk4_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_81,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk5_0,sk3_esk4_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_78]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_95,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk5_0,sk3_esk4_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_81]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_157,plain,
% 0.20/0.43 ( greater(sk3_esk5_0,sk3_esk4_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_95]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_362,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,
% 0.20/0.43 [status(thm)],
% 0.20/0.43 [c_319,c_194,c_155,c_157]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_363,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_362]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_2,plain,
% 0.20/0.43 ( ~ time(X0) | ~ time(X1) | greater(X1,X0) | X0 = X1 | greater(X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_12_3) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_129,plain,
% 0.20/0.43 ( ~ time(X0) | ~ time(X1) | greater(X1,X0) | X0 = X1 | greater(X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_130,plain,
% 0.20/0.43 ( greater(X0,X1) | greater(X1,X0) | ~ time(X1) | ~ time(X0) | X1 = X0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_129]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_365,plain,
% 0.20/0.43 ( greater(sk3_esk7_0,sk3_esk6_0)
% 0.20/0.43 | ~ time(sk3_esk6_0)
% 0.20/0.43 | ~ time(sk3_esk7_0)
% 0.20/0.43 | sk3_esk7_0 = sk3_esk6_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_363,c_130]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_366,plain,
% 0.20/0.43 ( greater(sk3_esk7_0,sk3_esk6_0)
% 0.20/0.43 | ~ time(sk3_esk6_0)
% 0.20/0.43 | ~ time(sk3_esk7_0)
% 0.20/0.43 | sk3_esk7_0 = sk3_esk6_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_365]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_9,plain,
% 0.20/0.43 ( time(X0) | ~ organization(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_14_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_143,plain,
% 0.20/0.43 ( time(X0) | ~ organization(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_177,plain,
% 0.20/0.43 ( time(sk3_esk7_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_155,c_143]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_178,plain,
% 0.20/0.43 ( time(sk3_esk7_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_177]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_173,plain,
% 0.20/0.43 ( time(sk3_esk6_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_153,c_143]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_174,plain,
% 0.20/0.43 ( time(sk3_esk6_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_173]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_12,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ complexity(X4,X2,X1)
% 0.20/0.43 | ~ complexity(X4,X3,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_20) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_29,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ complexity(X4,X2,X1)
% 0.20/0.43 | ~ complexity(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_69,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ complexity(X4,X2,X1)
% 0.20/0.43 | ~ complexity(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_90,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ complexity(X4,X2,X1)
% 0.20/0.43 | ~ complexity(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_69]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_97,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ complexity(X4,X2,X1)
% 0.20/0.43 | ~ complexity(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_90]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_161,plain,
% 0.20/0.43 ( ~ greater(X0,X1)
% 0.20/0.43 | ~ greater(X2,X3)
% 0.20/0.43 | ~ organization(X4,X1)
% 0.20/0.43 | ~ organization(X4,X0)
% 0.20/0.43 | ~ reorganization_free(X4,X1,X0)
% 0.20/0.43 | ~ complexity(X4,X2,X1)
% 0.20/0.43 | ~ complexity(X4,X3,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_97]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_16,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk3_0,sk3_esk7_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_24) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_37,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk3_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_73,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk3_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_37]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_86,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk3_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_73]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_101,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk3_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_86]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_169,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk3_0,sk3_esk7_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_101]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_249,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk3_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk7_0)
% 0.20/0.43 | ~ complexity(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_161,c_169]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_250,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk3_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk7_0)
% 0.20/0.43 | ~ complexity(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_249]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_292,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk3_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk7_0)
% 0.20/0.43 | ~ complexity(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_250,c_155]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_293,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk3_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk7_0)
% 0.20/0.43 | ~ complexity(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_292]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_15,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk2_0,sk3_esk6_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_23) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_35,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk2_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_72,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk2_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_35]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_87,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk2_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_72]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_100,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk2_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_87]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_167,negated_conjecture,
% 0.20/0.43 ( complexity(sk3_esk1_0,sk3_esk2_0,sk3_esk6_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_100]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_299,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk2_0,sk3_esk3_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_293,c_167]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_300,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk2_0,sk3_esk3_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk7_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_299]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_22,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_30) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_49,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_79,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_49]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_80,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_79]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_96,negated_conjecture,
% 0.20/0.43 ( greater(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_80]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_159,plain,
% 0.20/0.43 ( greater(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_96]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_333,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk6_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,
% 0.20/0.43 [status(thm)],
% 0.20/0.43 [c_300,c_165,c_153,c_159]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_334,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk6_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_333]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_418,plain,
% 0.20/0.43 ( sk3_esk7_0 = sk3_esk6_0 ),
% 0.20/0.43 inference(forward_subsumption_resolution,
% 0.20/0.43 [status(thm)],
% 0.20/0.43 [c_366,c_178,c_174,c_334]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_419,plain,
% 0.20/0.43 ( sk3_esk7_0 = sk3_esk6_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_418]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_336,plain,
% 0.20/0.43 ( greater(sk3_esk6_0,sk3_esk7_0)
% 0.20/0.43 | ~ time(sk3_esk6_0)
% 0.20/0.43 | ~ time(sk3_esk7_0)
% 0.20/0.43 | sk3_esk6_0 = sk3_esk7_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_334,c_130]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_337,plain,
% 0.20/0.43 ( greater(sk3_esk6_0,sk3_esk7_0)
% 0.20/0.43 | ~ time(sk3_esk6_0)
% 0.20/0.43 | ~ time(sk3_esk7_0)
% 0.20/0.43 | sk3_esk6_0 = sk3_esk7_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_336]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_409,plain,
% 0.20/0.43 ( sk3_esk6_0 = sk3_esk7_0 ),
% 0.20/0.43 inference(forward_subsumption_resolution,
% 0.20/0.43 [status(thm)],
% 0.20/0.43 [c_337,c_178,c_174,c_363]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_410,plain,
% 0.20/0.43 ( sk3_esk6_0 = sk3_esk7_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_409]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_267,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk5_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk7_0)
% 0.20/0.43 | ~ size(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_163,c_151]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_268,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk5_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk7_0)
% 0.20/0.43 | ~ size(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_267]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_375,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk5_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk7_0)
% 0.20/0.43 | ~ size(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_268,c_155]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_376,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk5_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk7_0)
% 0.20/0.43 | ~ size(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_375]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_384,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk5_0,sk3_esk5_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk7_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_376,c_151]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_385,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk5_0,sk3_esk5_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk7_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_384]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_390,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk5_0,sk3_esk5_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk7_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_385,c_155]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_391,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk5_0,sk3_esk5_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk7_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_390]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_316,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk4_0,sk3_esk4_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk6_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_310,c_149]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_317,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk4_0,sk3_esk4_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk6_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_316]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_353,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk4_0,sk3_esk4_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk6_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_317,c_153]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_354,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk4_0,sk3_esk4_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk6_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_353]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_301,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk3_0,sk3_esk3_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk7_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_293,c_169]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_302,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk3_0,sk3_esk3_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk7_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk7_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_301]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_344,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk3_0,sk3_esk3_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk7_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_302,c_155]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_345,plain,
% 0.20/0.43 ( ~ greater(sk3_esk7_0,sk3_esk7_0)
% 0.20/0.43 | ~ greater(sk3_esk3_0,sk3_esk3_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk7_0,sk3_esk7_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_344]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_247,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk2_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk6_0)
% 0.20/0.43 | ~ complexity(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_161,c_167]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_248,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk2_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk6_0)
% 0.20/0.43 | ~ complexity(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_247]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_275,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk2_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk6_0)
% 0.20/0.43 | ~ complexity(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_248,c_153]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_276,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,X0)
% 0.20/0.43 | ~ greater(X1,sk3_esk2_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,X0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,X0,sk3_esk6_0)
% 0.20/0.43 | ~ complexity(sk3_esk1_0,X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_275]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_282,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk2_0,sk3_esk2_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk6_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_276,c_167]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_283,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk2_0,sk3_esk2_0)
% 0.20/0.43 | ~ organization(sk3_esk1_0,sk3_esk6_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk6_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_282]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_324,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk2_0,sk3_esk2_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk6_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_283,c_153]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_325,plain,
% 0.20/0.43 ( ~ greater(sk3_esk6_0,sk3_esk6_0)
% 0.20/0.43 | ~ greater(sk3_esk2_0,sk3_esk2_0)
% 0.20/0.43 | ~ reorganization_free(sk3_esk1_0,sk3_esk6_0,sk3_esk6_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_324]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_4,plain,
% 0.20/0.43 ( greater(X0,X1) | X1 = X0 | greater(X1,X0) | ~ time(X0) | ~ time(X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_12_5) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_133,plain,
% 0.20/0.43 ( greater(X0,X1) | X1 = X0 | greater(X1,X0) | ~ time(X0) | ~ time(X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_134,plain,
% 0.20/0.43 ( greater(X0,X1) | greater(X1,X0) | ~ time(X0) | ~ time(X1) | X1 = X0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_133]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_205,plain,
% 0.20/0.43 ( greater(sk3_esk7_0,X0)
% 0.20/0.43 | greater(X0,sk3_esk7_0)
% 0.20/0.43 | ~ time(X0)
% 0.20/0.43 | sk3_esk7_0 = X0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_178,c_134]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_206,plain,
% 0.20/0.43 ( greater(sk3_esk7_0,X0)
% 0.20/0.43 | greater(X0,sk3_esk7_0)
% 0.20/0.43 | ~ time(X0)
% 0.20/0.43 | sk3_esk7_0 = X0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_205]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_201,plain,
% 0.20/0.43 ( greater(sk3_esk6_0,X0)
% 0.20/0.43 | greater(X0,sk3_esk6_0)
% 0.20/0.43 | ~ time(X0)
% 0.20/0.43 | sk3_esk6_0 = X0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_174,c_134]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_202,plain,
% 0.20/0.43 ( greater(sk3_esk6_0,X0)
% 0.20/0.43 | greater(X0,sk3_esk6_0)
% 0.20/0.43 | ~ time(X0)
% 0.20/0.43 | sk3_esk6_0 = X0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_201]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_5,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | ~ greater(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_13_1) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_135,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | ~ greater(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_185,plain,
% 0.20/0.43 ( ~ greater(sk3_esk3_0,sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_159,c_135]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_186,plain,
% 0.20/0.43 ( ~ greater(sk3_esk3_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_185]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_181,plain,
% 0.20/0.43 ( ~ greater(sk3_esk4_0,sk3_esk5_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_157,c_135]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_182,plain,
% 0.20/0.43 ( ~ greater(sk3_esk4_0,sk3_esk5_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_181]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( ~ time(X0) | ~ time(X1) | greater(X0,X1) | X0 = X1 | greater(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_12_1) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_125,plain,
% 0.20/0.43 ( ~ time(X0) | ~ time(X1) | greater(X0,X1) | X0 = X1 | greater(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_126,plain,
% 0.20/0.43 ( greater(X0,X1) | greater(X1,X0) | ~ time(X0) | ~ time(X1) | X0 = X1 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_125]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_11,plain,
% 0.20/0.43 ( ~ organization(X0,X1)
% 0.20/0.43 | ~ organization(X0,X2)
% 0.20/0.43 | ~ size(X0,X3,X1)
% 0.20/0.43 | ~ size(X0,X4,X2)
% 0.20/0.43 | X1 != X2
% 0.20/0.43 | X3 = X4 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_12_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_147,plain,
% 0.20/0.43 ( ~ organization(X0,X1)
% 0.20/0.43 | ~ organization(X0,X2)
% 0.20/0.43 | ~ size(X0,X3,X1)
% 0.20/0.43 | ~ size(X0,X4,X2)
% 0.20/0.43 | X1 != X2
% 0.20/0.43 | X3 = X4 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_7,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | X0 != X1 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p', c_0_14_1) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_139,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | X0 != X1 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 23
% 0.20/0.43 % num_of_input_neg_conjectures: 9
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 1
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 1
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 20
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.001
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.033
% 0.20/0.43 % num_of_symbols: 38
% 0.20/0.43 % num_of_terms: 193
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 55
% 0.20/0.43 % prop_num_of_clauses: 24
% 0.20/0.43 % prop_preprocess_simplified: 142
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 22
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 23
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 44
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 38
% 0.20/0.43 % res_num_of_loops: 31
% 0.20/0.43 % res_forward_subset_subsumed: 15
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 0
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 20
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 88
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 2
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.44 % Status Unknown
% 0.20/0.47 % Orienting using strategy ClausalAll
% 0.20/0.47 % FOF problem with conjecture
% 0.20/0.47 % 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_9344f4.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b6da0c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_b35289 | grep -v "SZS"
% 0.20/0.50
% 0.20/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ iProver source info
% 0.20/0.50
% 0.20/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.50 % git: non_committed_changes: true
% 0.20/0.50 % git: last_make_outside_of_git: true
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.50 % --inst_prop_sim_new false
% 0.20/0.50 % --inst_orphan_elimination true
% 0.20/0.50 % --inst_learning_loop_flag true
% 0.20/0.50 % --inst_learning_start 3000
% 0.20/0.50 % --inst_learning_factor 2
% 0.20/0.50 % --inst_start_prop_sim_after_learn 3
% 0.20/0.50 % --inst_sel_renew solver
% 0.20/0.50 % --inst_lit_activity_flag true
% 0.20/0.50 % --inst_out_proof true
% 0.20/0.50
% 0.20/0.50 % ------ Resolution Options
% 0.20/0.50
% 0.20/0.50 % --resolution_flag true
% 0.20/0.50 % --res_lit_sel kbo_max
% 0.20/0.50 % --res_to_prop_solver none
% 0.20/0.50 % --res_prop_simpl_new false
% 0.20/0.50 % --res_prop_simpl_given false
% 0.20/0.50 % --res_passive_queue_type priority_queues
% 0.20/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.50 % --res_passive_queues_freq [15;5]
% 0.20/0.50 % --res_forward_subs full
% 0.20/0.50 % --res_backward_subs full
% 0.20/0.50 % --res_forward_subs_resolution true
% 0.20/0.50 % --res_backward_subs_resolution true
% 0.20/0.50 % --res_orphan_elimination false
% 0.20/0.50 % --res_time_limit 1000.
% 0.20/0.50 % --res_out_proof true
% 0.20/0.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9344f4.s
% 0.20/0.50 % --modulo true
% 0.20/0.50
% 0.20/0.50 % ------ Combination Options
% 0.20/0.50
% 0.20/0.50 % --comb_res_mult 1000
% 0.20/0.50 % --comb_inst_mult 300
% 0.20/0.50 % ------
% 0.20/0.50
% 0.20/0.50 % ------ Parsing...% successful
% 0.20/0.50
% 0.20/0.50 % ------ 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.50
% 0.20/0.50 % ------ Proving...
% 0.20/0.50 % ------ Problem Properties
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % EPR true
% 0.20/0.50 % Horn false
% 0.20/0.50 % Has equality true
% 0.20/0.50
% 0.20/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 % % ------ Current options:
% 0.20/0.50
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.53 % --inst_prop_sim_new false
% 0.20/0.53 % --inst_orphan_elimination true
% 0.20/0.53 % --inst_learning_loop_flag true
% 0.20/0.53 % --inst_learning_start 3000
% 0.20/0.53 % --inst_learning_factor 2
% 0.20/0.53 % --inst_start_prop_sim_after_learn 3
% 0.20/0.53 % --inst_sel_renew solver
% 0.20/0.53 % --inst_lit_activity_flag true
% 0.20/0.53 % --inst_out_proof true
% 0.20/0.53
% 0.20/0.53 % ------ Resolution Options
% 0.20/0.53
% 0.20/0.53 % --resolution_flag true
% 0.20/0.53 % --res_lit_sel kbo_max
% 0.20/0.53 % --res_to_prop_solver none
% 0.20/0.53 % --res_prop_simpl_new false
% 0.20/0.53 % --res_prop_simpl_given false
% 0.20/0.53 % --res_passive_queue_type priority_queues
% 0.20/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.53 % --res_passive_queues_freq [15;5]
% 0.20/0.53 % --res_forward_subs full
% 0.20/0.53 % --res_backward_subs full
% 0.20/0.53 % --res_forward_subs_resolution true
% 0.20/0.53 % --res_backward_subs_resolution true
% 0.20/0.53 % --res_orphan_elimination false
% 0.20/0.53 % --res_time_limit 1000.
% 0.20/0.53 % --res_out_proof true
% 0.20/0.53 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9344f4.s
% 0.20/0.53 % --modulo true
% 0.20/0.53
% 0.20/0.53 % ------ Combination Options
% 0.20/0.53
% 0.20/0.53 % --comb_res_mult 1000
% 0.20/0.53 % --comb_inst_mult 300
% 0.20/0.53 % ------
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 % ------ Proving...
% 0.20/0.53 %
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 % Resolution empty clause
% 0.20/0.53
% 0.20/0.53 % ------ Statistics
% 0.20/0.53
% 0.20/0.53 % ------ General
% 0.20/0.53
% 0.20/0.53 % num_of_input_clauses: 30
% 0.20/0.53 % num_of_input_neg_conjectures: 9
% 0.20/0.53 % num_of_splits: 0
% 0.20/0.53 % num_of_split_atoms: 0
% 0.20/0.53 % num_of_sem_filtered_clauses: 0
% 0.20/0.53 % num_of_subtypes: 0
% 0.20/0.53 % monotx_restored_types: 0
% 0.20/0.53 % sat_num_of_epr_types: 0
% 0.20/0.53 % sat_num_of_non_cyclic_types: 0
% 0.20/0.53 % sat_guarded_non_collapsed_types: 0
% 0.20/0.53 % is_epr: 1
% 0.20/0.53 % is_horn: 0
% 0.20/0.53 % has_eq: 1
% 0.20/0.53 % num_pure_diseq_elim: 0
% 0.20/0.53 % simp_replaced_by: 0
% 0.20/0.53 % res_preprocessed: 20
% 0.20/0.53 % prep_upred: 0
% 0.20/0.53 % prep_unflattend: 0
% 0.20/0.53 % pred_elim_cands: 0
% 0.20/0.53 % pred_elim: 0
% 0.20/0.53 % pred_elim_cl: 0
% 0.20/0.53 % pred_elim_cycles: 0
% 0.20/0.53 % forced_gc_time: 0
% 0.20/0.53 % gc_basic_clause_elim: 0
% 0.20/0.53 % parsing_time: 0.002
% 0.20/0.53 % sem_filter_time: 0.
% 0.20/0.53 % pred_elim_time: 0.
% 0.20/0.53 % out_proof_time: 0.005
% 0.20/0.53 % monotx_time: 0.
% 0.20/0.53 % subtype_inf_time: 0.
% 0.20/0.53 % unif_index_cands_time: 0.
% 0.20/0.53 % unif_index_add_time: 0.
% 0.20/0.53 % total_time: 0.052
% 0.20/0.53 % num_of_symbols: 38
% 0.20/0.53 % num_of_terms: 428
% 0.20/0.53
% 0.20/0.53 % ------ Propositional Solver
% 0.20/0.53
% 0.20/0.53 % prop_solver_calls: 1
% 0.20/0.53 % prop_fast_solver_calls: 55
% 0.20/0.53 % prop_num_of_clauses: 27
% 0.20/0.53 % prop_preprocess_simplified: 167
% 0.20/0.53 % prop_fo_subsumed: 0
% 0.20/0.53 % prop_solver_time: 0.
% 0.20/0.53 % prop_fast_solver_time: 0.
% 0.20/0.53 % prop_unsat_core_time: 0.
% 0.20/0.53
% 0.20/0.53 % ------ QBF
% 0.20/0.53
% 0.20/0.53 % qbf_q_res: 0
% 0.20/0.53 % qbf_num_tautologies: 0
% 0.20/0.53 % qbf_prep_cycles: 0
% 0.20/0.53
% 0.20/0.53 % ------ BMC1
% 0.20/0.53
% 0.20/0.53 % bmc1_current_bound: -1
% 0.20/0.53 % bmc1_last_solved_bound: -1
% 0.20/0.53 % bmc1_unsat_core_size: -1
% 0.20/0.53 % bmc1_unsat_core_parents_size: -1
% 0.20/0.53 % bmc1_merge_next_fun: 0
% 0.20/0.53 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.53
% 0.20/0.53 % ------ Instantiation
% 0.20/0.53
% 0.20/0.53 % inst_num_of_clauses: 29
% 0.20/0.53 % inst_num_in_passive: 0
% 0.20/0.53 % inst_num_in_active: 0
% 0.20/0.53 % inst_num_in_unprocessed: 30
% 0.20/0.53 % inst_num_of_loops: 0
% 0.20/0.53 % inst_num_of_learning_restarts: 0
% 0.20/0.53 % inst_num_moves_active_passive: 0
% 0.20/0.53 % inst_lit_activity: 0
% 0.20/0.53 % inst_lit_activity_moves: 0
% 0.20/0.53 % inst_num_tautologies: 0
% 0.20/0.53 % inst_num_prop_implied: 0
% 0.20/0.53 % inst_num_existing_simplified: 0
% 0.20/0.53 % inst_num_eq_res_simplified: 0
% 0.20/0.53 % inst_num_child_elim: 0
% 0.20/0.53 % inst_num_of_dismatching_blockings: 0
% 0.20/0.53 % inst_num_of_non_proper_insts: 0
% 0.20/0.53 % inst_num_of_duplicates: 0
% 0.20/0.53 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.53 % inst_dismatching_checking_time: 0.
% 0.20/0.53
% 0.20/0.53 % ------ Resolution
% 0.20/0.53
% 0.20/0.53 % res_num_of_clauses: 106
% 0.20/0.53 % res_num_in_passive: 9
% 0.20/0.53 % res_num_in_active: 85
% 0.20/0.53 % res_num_of_loops: 77
% 0.20/0.53 % res_forward_subset_subsumed: 17
% 0.20/0.53 % res_backward_subset_subsumed: 0
% 0.20/0.53 % res_forward_subsumed: 3
% 0.20/0.53 % res_backward_subsumed: 0
% 0.20/0.53 % res_forward_subsumption_resolution: 39
% 0.20/0.53 % res_backward_subsumption_resolution: 0
% 0.20/0.53 % res_clause_to_clause_subsumption: 425
% 0.20/0.53 % res_orphan_elimination: 0
% 0.20/0.53 % res_tautology_del: 0
% 0.20/0.53 % res_num_eq_res_simplified: 4
% 0.20/0.53 % res_num_sel_changes: 0
% 0.20/0.53 % res_moves_from_active_to_pass: 0
% 0.20/0.53
% 0.20/0.54 % Status Unsatisfiable
% 0.20/0.54 % SZS status Theorem
% 0.20/0.54 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------