TSTP Solution File: MGT003+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT003+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:39 EDT 2022
% Result : Theorem 0.21s 0.44s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
fof(mp5,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
input ).
fof(mp5_0,plain,
! [T,X] :
( ~ organization(X,T)
| ? [I] : inertia(X,I,T) ),
inference(orientation,[status(thm)],[mp5]) ).
fof(mp4,axiom,
! [X,T1,T2] :
( reorganization_free(X,T1,T2)
=> ( reorganization_free(X,T1,T1)
& reorganization_free(X,T2,T2) ) ),
input ).
fof(mp4_0,plain,
! [T1,T2,X] :
( ~ reorganization_free(X,T1,T2)
| ( reorganization_free(X,T1,T1)
& reorganization_free(X,T2,T2) ) ),
inference(orientation,[status(thm)],[mp4]) ).
fof(def_lhs_atom1,axiom,
! [X,T2,T1] :
( lhs_atom1(X,T2,T1)
<=> ~ reorganization_free(X,T1,T2) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [T1,T2,X] :
( lhs_atom1(X,T2,T1)
| ( reorganization_free(X,T1,T1)
& reorganization_free(X,T2,T2) ) ),
inference(fold_definition,[status(thm)],[mp4_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X,T] :
( lhs_atom2(X,T)
<=> ~ organization(X,T) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [T,X] :
( lhs_atom2(X,T)
| ? [I] : inertia(X,I,T) ),
inference(fold_definition,[status(thm)],[mp5_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3] :
( lhs_atom1(X1,X2,X3)
| ( reorganization_free(X1,X3,X3)
& reorganization_free(X1,X2,X2) ) ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_1,axiom,
! [X1,X4] :
( lhs_atom2(X1,X4)
| ? [X5] : inertia(X1,X5,X4) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_2,axiom,
! [X1,X2,X3] :
( lhs_atom1(X1,X2,X3)
| ( reorganization_free(X1,X3,X3)
& reorganization_free(X1,X2,X2) ) ),
c_0_0 ).
fof(c_0_3,axiom,
! [X1,X4] :
( lhs_atom2(X1,X4)
| ? [X5] : inertia(X1,X5,X4) ),
c_0_1 ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( ( reorganization_free(X4,X6,X6)
| lhs_atom1(X4,X5,X6) )
& ( reorganization_free(X4,X5,X5)
| lhs_atom1(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_2])]) ).
fof(c_0_5,plain,
! [X6,X7] :
( lhs_atom2(X6,X7)
| inertia(X6,esk1_2(X6,X7),X7) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,plain,
( lhs_atom1(X1,X2,X3)
| reorganization_free(X1,X3,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( lhs_atom1(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| lhs_atom2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( lhs_atom1(X1,X2,X3)
| reorganization_free(X1,X3,X3) ),
c_0_6,
[final] ).
cnf(c_0_10,plain,
( lhs_atom1(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
c_0_7,
[final] ).
cnf(c_0_11,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| lhs_atom2(X1,X2) ),
c_0_8,
[final] ).
% End CNF derivation
cnf(c_0_9_0,axiom,
( ~ reorganization_free(X1,X3,X2)
| reorganization_free(X1,X3,X3) ),
inference(unfold_definition,[status(thm)],[c_0_9,def_lhs_atom1]) ).
cnf(c_0_10_0,axiom,
( ~ reorganization_free(X1,X3,X2)
| reorganization_free(X1,X2,X2) ),
inference(unfold_definition,[status(thm)],[c_0_10,def_lhs_atom1]) ).
cnf(c_0_11_0,axiom,
( ~ organization(X1,X2)
| inertia(X1,sk1_esk1_2(X1,X2),X2) ),
inference(unfold_definition,[status(thm)],[c_0_11,def_lhs_atom2]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X1,X3)
& organization(X2,X4)
& reorganization_free(X1,X3,X3)
& reorganization_free(X2,X4,X4)
& inertia(X1,X5,X3)
& inertia(X2,X6,X4)
& survival_chance(X1,X7,X3)
& survival_chance(X2,X8,X4)
& greater(X6,X5) )
=> greater(X8,X7) ),
file('<stdin>',t1_FOL) ).
fof(c_0_1_002,hypothesis,
! [X1,X5,X6,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& inertia(X1,X5,X3)
& inertia(X1,X6,X4)
& greater(X4,X3) )
=> greater(X6,X5) ),
file('<stdin>',t2_FOL) ).
fof(c_0_2_003,conjecture,
! [X1,X7,X8,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& survival_chance(X1,X7,X3)
& survival_chance(X1,X8,X4)
& greater(X4,X3) )
=> greater(X8,X7) ),
file('<stdin>',t3_FOL) ).
fof(c_0_3_004,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X1,X3)
& organization(X2,X4)
& reorganization_free(X1,X3,X3)
& reorganization_free(X2,X4,X4)
& inertia(X1,X5,X3)
& inertia(X2,X6,X4)
& survival_chance(X1,X7,X3)
& survival_chance(X2,X8,X4)
& greater(X6,X5) )
=> greater(X8,X7) ),
c_0_0 ).
fof(c_0_4_005,hypothesis,
! [X1,X5,X6,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& inertia(X1,X5,X3)
& inertia(X1,X6,X4)
& greater(X4,X3) )
=> greater(X6,X5) ),
c_0_1 ).
fof(c_0_5_006,negated_conjecture,
~ ! [X1,X7,X8,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& survival_chance(X1,X7,X3)
& survival_chance(X1,X8,X4)
& greater(X4,X3) )
=> greater(X8,X7) ),
inference(assume_negation,[status(cth)],[c_0_2]) ).
fof(c_0_6_007,hypothesis,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ~ organization(X9,X11)
| ~ organization(X10,X12)
| ~ reorganization_free(X9,X11,X11)
| ~ reorganization_free(X10,X12,X12)
| ~ inertia(X9,X13,X11)
| ~ inertia(X10,X14,X12)
| ~ survival_chance(X9,X15,X11)
| ~ survival_chance(X10,X16,X12)
| ~ greater(X14,X13)
| greater(X16,X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_7_008,hypothesis,
! [X7,X8,X9,X10,X11] :
( ~ organization(X7,X10)
| ~ organization(X7,X11)
| ~ reorganization_free(X7,X10,X11)
| ~ inertia(X7,X8,X10)
| ~ inertia(X7,X9,X11)
| ~ greater(X11,X10)
| greater(X9,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,esk4_0)
& organization(esk1_0,esk5_0)
& reorganization_free(esk1_0,esk4_0,esk5_0)
& survival_chance(esk1_0,esk2_0,esk4_0)
& survival_chance(esk1_0,esk3_0,esk5_0)
& greater(esk5_0,esk4_0)
& ~ greater(esk3_0,esk2_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)
| ~ survival_chance(X5,X1,X6)
| ~ survival_chance(X7,X2,X8)
| ~ inertia(X5,X3,X6)
| ~ inertia(X7,X4,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_011,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X3)
| ~ inertia(X5,X2,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,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
survival_chance(esk1_0,esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
survival_chance(esk1_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
~ greater(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
organization(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
organization(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ survival_chance(X5,X1,X6)
| ~ survival_chance(X7,X2,X8)
| ~ inertia(X5,X3,X6)
| ~ inertia(X7,X4,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
c_0_9,
[final] ).
cnf(c_0_19,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X3)
| ~ inertia(X5,X2,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
c_0_10,
[final] ).
cnf(c_0_20,negated_conjecture,
reorganization_free(esk1_0,esk4_0,esk5_0),
c_0_11,
[final] ).
cnf(c_0_21,negated_conjecture,
survival_chance(esk1_0,esk2_0,esk4_0),
c_0_12,
[final] ).
cnf(c_0_22,negated_conjecture,
survival_chance(esk1_0,esk3_0,esk5_0),
c_0_13,
[final] ).
cnf(c_0_23,negated_conjecture,
~ greater(esk3_0,esk2_0),
c_0_14,
[final] ).
cnf(c_0_24,negated_conjecture,
organization(esk1_0,esk4_0),
c_0_15,
[final] ).
cnf(c_0_25,negated_conjecture,
organization(esk1_0,esk5_0),
c_0_16,
[final] ).
cnf(c_0_26,negated_conjecture,
greater(esk5_0,esk4_0),
c_0_17,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ survival_chance(X0,X7,X1)
| ~ survival_chance(X2,X6,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_18) ).
cnf(c_13,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ survival_chance(X0,X7,X1)
| ~ survival_chance(X2,X6,X3) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_45,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ survival_chance(X0,X7,X1)
| ~ survival_chance(X2,X6,X3) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_62,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ survival_chance(X0,X7,X1)
| ~ survival_chance(X2,X6,X3) ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_63,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ survival_chance(X0,X7,X1)
| ~ survival_chance(X2,X6,X3) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_90,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X5,X4)
| greater(X6,X7)
| ~ survival_chance(X0,X7,X1)
| ~ survival_chance(X2,X6,X3) ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_8,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk3_0,sk3_esk5_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_22) ).
cnf(c_23,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk3_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_50,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk3_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_57,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk3_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_68,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk3_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_100,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk3_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_218,plain,
( ~ organization(sk3_esk1_0,sk3_esk5_0)
| ~ organization(X0,X1)
| ~ inertia(sk3_esk1_0,X2,sk3_esk5_0)
| ~ inertia(X0,X3,X1)
| ~ reorganization_free(sk3_esk1_0,sk3_esk5_0,sk3_esk5_0)
| ~ reorganization_free(X0,X1,X1)
| greater(sk3_esk3_0,X4)
| ~ greater(X2,X3)
| ~ survival_chance(X0,X4,X1) ),
inference(resolution,[status(thm)],[c_90,c_100]) ).
cnf(c_219,plain,
( ~ organization(sk3_esk1_0,sk3_esk5_0)
| ~ organization(X0,X1)
| ~ inertia(sk3_esk1_0,X2,sk3_esk5_0)
| ~ inertia(X0,X3,X1)
| ~ reorganization_free(sk3_esk1_0,sk3_esk5_0,sk3_esk5_0)
| ~ reorganization_free(X0,X1,X1)
| greater(sk3_esk3_0,X4)
| ~ greater(X2,X3)
| ~ survival_chance(X0,X4,X1) ),
inference(rewriting,[status(thm)],[c_218]) ).
cnf(c_6,negated_conjecture,
reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk5_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_20) ).
cnf(c_19,negated_conjecture,
reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_48,negated_conjecture,
reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_59,negated_conjecture,
reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_66,negated_conjecture,
reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_96,negated_conjecture,
reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_1,plain,
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_10_0) ).
cnf(c_86,plain,
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X2,X1) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_122,plain,
reorganization_free(sk3_esk1_0,sk3_esk5_0,sk3_esk5_0),
inference(resolution,[status(thm)],[c_96,c_86]) ).
cnf(c_123,plain,
reorganization_free(sk3_esk1_0,sk3_esk5_0,sk3_esk5_0),
inference(rewriting,[status(thm)],[c_122]) ).
cnf(c_10,negated_conjecture,
organization(sk3_esk1_0,sk3_esk5_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_25) ).
cnf(c_27,negated_conjecture,
organization(sk3_esk1_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_52,negated_conjecture,
organization(sk3_esk1_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_55,negated_conjecture,
organization(sk3_esk1_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_70,negated_conjecture,
organization(sk3_esk1_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_104,negated_conjecture,
organization(sk3_esk1_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_251,plain,
( ~ organization(X0,X1)
| ~ inertia(sk3_esk1_0,X2,sk3_esk5_0)
| ~ inertia(X0,X3,X1)
| ~ reorganization_free(X0,X1,X1)
| greater(sk3_esk3_0,X4)
| ~ greater(X2,X3)
| ~ survival_chance(X0,X4,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_219,c_123,c_104]) ).
cnf(c_252,plain,
( ~ organization(X0,X1)
| ~ inertia(sk3_esk1_0,X2,sk3_esk5_0)
| ~ inertia(X0,X3,X1)
| ~ reorganization_free(X0,X1,X1)
| greater(sk3_esk3_0,X4)
| ~ greater(X2,X3)
| ~ survival_chance(X0,X4,X1) ),
inference(rewriting,[status(thm)],[c_251]) ).
cnf(c_7,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk2_0,sk3_esk4_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_21) ).
cnf(c_21,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk2_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_49,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk2_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_58,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk2_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_67,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk2_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_98,negated_conjecture,
survival_chance(sk3_esk1_0,sk3_esk2_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_260,plain,
( ~ organization(sk3_esk1_0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X1,sk3_esk5_0)
| ~ reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk4_0)
| greater(sk3_esk3_0,sk3_esk2_0)
| ~ greater(X1,X0) ),
inference(resolution,[status(thm)],[c_252,c_98]) ).
cnf(c_261,plain,
( ~ organization(sk3_esk1_0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X1,sk3_esk5_0)
| ~ reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk4_0)
| greater(sk3_esk3_0,sk3_esk2_0)
| ~ greater(X1,X0) ),
inference(rewriting,[status(thm)],[c_260]) ).
cnf(c_4,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_19) ).
cnf(c_15,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_46,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_61,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_64,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_92,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_160,plain,
( ~ organization(sk3_esk1_0,sk3_esk4_0)
| ~ organization(sk3_esk1_0,sk3_esk5_0)
| ~ inertia(sk3_esk1_0,X0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X1,sk3_esk5_0)
| ~ greater(sk3_esk5_0,sk3_esk4_0)
| greater(X1,X0) ),
inference(resolution,[status(thm)],[c_92,c_96]) ).
cnf(c_161,plain,
( ~ organization(sk3_esk1_0,sk3_esk4_0)
| ~ organization(sk3_esk1_0,sk3_esk5_0)
| ~ inertia(sk3_esk1_0,X0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X1,sk3_esk5_0)
| ~ greater(sk3_esk5_0,sk3_esk4_0)
| greater(X1,X0) ),
inference(rewriting,[status(thm)],[c_160]) ).
cnf(c_11,negated_conjecture,
greater(sk3_esk5_0,sk3_esk4_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_26) ).
cnf(c_29,negated_conjecture,
greater(sk3_esk5_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_53,negated_conjecture,
greater(sk3_esk5_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_54,negated_conjecture,
greater(sk3_esk5_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_71,negated_conjecture,
greater(sk3_esk5_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_106,negated_conjecture,
greater(sk3_esk5_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_9,negated_conjecture,
organization(sk3_esk1_0,sk3_esk4_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_24) ).
cnf(c_25,negated_conjecture,
organization(sk3_esk1_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_51,negated_conjecture,
organization(sk3_esk1_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_56,negated_conjecture,
organization(sk3_esk1_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_69,negated_conjecture,
organization(sk3_esk1_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_102,negated_conjecture,
organization(sk3_esk1_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_172,plain,
( ~ inertia(sk3_esk1_0,X0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X1,sk3_esk5_0)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_161,c_106,c_104,c_102]) ).
cnf(c_173,plain,
( ~ inertia(sk3_esk1_0,X0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X1,sk3_esk5_0)
| greater(X1,X0) ),
inference(rewriting,[status(thm)],[c_172]) ).
cnf(c_5,negated_conjecture,
~ greater(sk3_esk3_0,sk3_esk2_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_23) ).
cnf(c_17,negated_conjecture,
~ greater(sk3_esk3_0,sk3_esk2_0),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_47,negated_conjecture,
~ greater(sk3_esk3_0,sk3_esk2_0),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_60,negated_conjecture,
~ greater(sk3_esk3_0,sk3_esk2_0),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_65,negated_conjecture,
~ greater(sk3_esk3_0,sk3_esk2_0),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_94,negated_conjecture,
~ greater(sk3_esk3_0,sk3_esk2_0),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_2,plain,
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_9_0) ).
cnf(c_88,plain,
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_124,plain,
reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk4_0),
inference(resolution,[status(thm)],[c_96,c_88]) ).
cnf(c_125,plain,
reorganization_free(sk3_esk1_0,sk3_esk4_0,sk3_esk4_0),
inference(rewriting,[status(thm)],[c_124]) ).
cnf(c_327,plain,
( ~ inertia(sk3_esk1_0,X0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X1,sk3_esk5_0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_261,c_173,c_94,c_125,c_102]) ).
cnf(c_328,plain,
( ~ inertia(sk3_esk1_0,X0,sk3_esk4_0)
| ~ inertia(sk3_esk1_0,X1,sk3_esk5_0) ),
inference(rewriting,[status(thm)],[c_327]) ).
cnf(c_0,plain,
( inertia(X0,sk1_esk1_2(X0,X1),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p',c_0_11_0) ).
cnf(c_84,plain,
( inertia(X0,sk1_esk1_2(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_85,plain,
( ~ organization(X0,X1)
| inertia(X0,sk1_esk1_2(X0,X1),X1) ),
inference(rewriting,[status(thm)],[c_84]) ).
cnf(c_114,plain,
inertia(sk3_esk1_0,sk1_esk1_2(sk3_esk1_0,sk3_esk5_0),sk3_esk5_0),
inference(resolution,[status(thm)],[c_104,c_85]) ).
cnf(c_115,plain,
inertia(sk3_esk1_0,sk1_esk1_2(sk3_esk1_0,sk3_esk5_0),sk3_esk5_0),
inference(rewriting,[status(thm)],[c_114]) ).
cnf(c_331,plain,
~ inertia(sk3_esk1_0,X0,sk3_esk4_0),
inference(resolution,[status(thm)],[c_328,c_115]) ).
cnf(c_332,plain,
~ inertia(sk3_esk1_0,X0,sk3_esk4_0),
inference(rewriting,[status(thm)],[c_331]) ).
cnf(c_110,plain,
inertia(sk3_esk1_0,sk1_esk1_2(sk3_esk1_0,sk3_esk4_0),sk3_esk4_0),
inference(resolution,[status(thm)],[c_102,c_85]) ).
cnf(c_111,plain,
inertia(sk3_esk1_0,sk1_esk1_2(sk3_esk1_0,sk3_esk4_0),sk3_esk4_0),
inference(rewriting,[status(thm)],[c_110]) ).
cnf(c_355,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_332,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 09:32:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cd953e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e4dd7e.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_beff10 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.43 % --inst_prop_sim_new false
% 0.21/0.43 % --inst_orphan_elimination true
% 0.21/0.43 % --inst_learning_loop_flag true
% 0.21/0.43 % --inst_learning_start 3000
% 0.21/0.43 % --inst_learning_factor 2
% 0.21/0.43 % --inst_start_prop_sim_after_learn 3
% 0.21/0.43 % --inst_sel_renew solver
% 0.21/0.43 % --inst_lit_activity_flag true
% 0.21/0.43 % --inst_out_proof true
% 0.21/0.43
% 0.21/0.43 % ------ Resolution Options
% 0.21/0.43
% 0.21/0.43 % --resolution_flag true
% 0.21/0.43 % --res_lit_sel kbo_max
% 0.21/0.43 % --res_to_prop_solver none
% 0.21/0.43 % --res_prop_simpl_new false
% 0.21/0.43 % --res_prop_simpl_given false
% 0.21/0.43 % --res_passive_queue_type priority_queues
% 0.21/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.43 % --res_passive_queues_freq [15;5]
% 0.21/0.43 % --res_forward_subs full
% 0.21/0.43 % --res_backward_subs full
% 0.21/0.43 % --res_forward_subs_resolution true
% 0.21/0.43 % --res_backward_subs_resolution true
% 0.21/0.43 % --res_orphan_elimination false
% 0.21/0.43 % --res_time_limit 1000.
% 0.21/0.43 % --res_out_proof true
% 0.21/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cd953e.s
% 0.21/0.43 % --modulo true
% 0.21/0.43
% 0.21/0.43 % ------ Combination Options
% 0.21/0.43
% 0.21/0.43 % --comb_res_mult 1000
% 0.21/0.43 % --comb_inst_mult 300
% 0.21/0.43 % ------
% 0.21/0.43
% 0.21/0.43 % ------ Parsing...% successful
% 0.21/0.43
% 0.21/0.43 % ------ 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.21/0.43
% 0.21/0.43 % ------ Proving...
% 0.21/0.43 % ------ Problem Properties
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % EPR false
% 0.21/0.43 % Horn true
% 0.21/0.43 % Has equality false
% 0.21/0.43
% 0.21/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 % % ------ Current options:
% 0.21/0.43
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cd953e.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 %
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % Resolution empty clause
% 0.21/0.44
% 0.21/0.44 % ------ Statistics
% 0.21/0.44
% 0.21/0.44 % ------ General
% 0.21/0.44
% 0.21/0.44 % num_of_input_clauses: 12
% 0.21/0.44 % num_of_input_neg_conjectures: 7
% 0.21/0.44 % num_of_splits: 0
% 0.21/0.44 % num_of_split_atoms: 0
% 0.21/0.44 % num_of_sem_filtered_clauses: 0
% 0.21/0.44 % num_of_subtypes: 0
% 0.21/0.44 % monotx_restored_types: 0
% 0.21/0.44 % sat_num_of_epr_types: 0
% 0.21/0.44 % sat_num_of_non_cyclic_types: 0
% 0.21/0.44 % sat_guarded_non_collapsed_types: 0
% 0.21/0.44 % is_epr: 0
% 0.21/0.44 % is_horn: 1
% 0.21/0.44 % has_eq: 0
% 0.21/0.44 % num_pure_diseq_elim: 0
% 0.21/0.44 % simp_replaced_by: 0
% 0.21/0.44 % res_preprocessed: 16
% 0.21/0.44 % prep_upred: 0
% 0.21/0.44 % prep_unflattend: 0
% 0.21/0.44 % pred_elim_cands: 1
% 0.21/0.44 % pred_elim: 0
% 0.21/0.44 % pred_elim_cl: 0
% 0.21/0.44 % pred_elim_cycles: 1
% 0.21/0.44 % forced_gc_time: 0
% 0.21/0.44 % gc_basic_clause_elim: 0
% 0.21/0.44 % parsing_time: 0.
% 0.21/0.44 % sem_filter_time: 0.
% 0.21/0.44 % pred_elim_time: 0.
% 0.21/0.44 % out_proof_time: 0.004
% 0.21/0.44 % monotx_time: 0.
% 0.21/0.44 % subtype_inf_time: 0.
% 0.21/0.44 % unif_index_cands_time: 0.
% 0.21/0.44 % unif_index_add_time: 0.
% 0.21/0.44 % total_time: 0.032
% 0.21/0.44 % num_of_symbols: 36
% 0.21/0.44 % num_of_terms: 167
% 0.21/0.44
% 0.21/0.44 % ------ Propositional Solver
% 0.21/0.44
% 0.21/0.44 % prop_solver_calls: 1
% 0.21/0.44 % prop_fast_solver_calls: 55
% 0.21/0.44 % prop_num_of_clauses: 13
% 0.21/0.44 % prop_preprocess_simplified: 97
% 0.21/0.44 % prop_fo_subsumed: 0
% 0.21/0.44 % prop_solver_time: 0.
% 0.21/0.44 % prop_fast_solver_time: 0.
% 0.21/0.44 % prop_unsat_core_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ QBF
% 0.21/0.44
% 0.21/0.44 % qbf_q_res: 0
% 0.21/0.44 % qbf_num_tautologies: 0
% 0.21/0.44 % qbf_prep_cycles: 0
% 0.21/0.44
% 0.21/0.44 % ------ BMC1
% 0.21/0.44
% 0.21/0.44 % bmc1_current_bound: -1
% 0.21/0.44 % bmc1_last_solved_bound: -1
% 0.21/0.44 % bmc1_unsat_core_size: -1
% 0.21/0.44 % bmc1_unsat_core_parents_size: -1
% 0.21/0.44 % bmc1_merge_next_fun: 0
% 0.21/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation
% 0.21/0.44
% 0.21/0.44 % inst_num_of_clauses: 12
% 0.21/0.44 % inst_num_in_passive: 0
% 0.21/0.44 % inst_num_in_active: 0
% 0.21/0.44 % inst_num_in_unprocessed: 12
% 0.21/0.44 % inst_num_of_loops: 0
% 0.21/0.44 % inst_num_of_learning_restarts: 0
% 0.21/0.44 % inst_num_moves_active_passive: 0
% 0.21/0.44 % inst_lit_activity: 0
% 0.21/0.44 % inst_lit_activity_moves: 0
% 0.21/0.44 % inst_num_tautologies: 0
% 0.21/0.44 % inst_num_prop_implied: 0
% 0.21/0.44 % inst_num_existing_simplified: 0
% 0.21/0.44 % inst_num_eq_res_simplified: 0
% 0.21/0.44 % inst_num_child_elim: 0
% 0.21/0.44 % inst_num_of_dismatching_blockings: 0
% 0.21/0.44 % inst_num_of_non_proper_insts: 0
% 0.21/0.44 % inst_num_of_duplicates: 0
% 0.21/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.44 % inst_dismatching_checking_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Resolution
% 0.21/0.44
% 0.21/0.44 % res_num_of_clauses: 26
% 0.21/0.44 % res_num_in_passive: 4
% 0.21/0.44 % res_num_in_active: 21
% 0.21/0.44 % res_num_of_loops: 27
% 0.21/0.44 % res_forward_subset_subsumed: 4
% 0.21/0.44 % res_backward_subset_subsumed: 7
% 0.21/0.44 % res_forward_subsumed: 0
% 0.21/0.44 % res_backward_subsumed: 2
% 0.21/0.44 % res_forward_subsumption_resolution: 20
% 0.21/0.44 % res_backward_subsumption_resolution: 1
% 0.21/0.44 % res_clause_to_clause_subsumption: 51
% 0.21/0.44 % res_orphan_elimination: 0
% 0.21/0.44 % res_tautology_del: 0
% 0.21/0.44 % res_num_eq_res_simplified: 0
% 0.21/0.44 % res_num_sel_changes: 0
% 0.21/0.44 % res_moves_from_active_to_pass: 0
% 0.21/0.44
% 0.21/0.44 % Status Unsatisfiable
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------