TSTP Solution File: MGT044+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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:59 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : CNFRefutation 0.19s
% 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(assumption_9,axiom,
! [X,T0,T] :
( organization(X)
=> internal_friction(X,T) = internal_friction(X,T0) ),
input ).
fof(assumption_9_0,plain,
! [T,T0,X] :
( ~ organization(X)
| internal_friction(X,T) = internal_friction(X,T0) ),
inference(orientation,[status(thm)],[assumption_9]) ).
fof(assumption_7,axiom,
! [X,T0,T] :
( ( organization(X)
& greater(age(X,T),age(X,T0)) )
=> greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) ),
input ).
fof(assumption_7_0,plain,
! [T,T0,X] :
( greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
| ~ ( organization(X)
& greater(age(X,T),age(X,T0)) ) ),
inference(orientation,[status(thm)],[assumption_7]) ).
fof(assumption_5,axiom,
! [X,T0,T] :
( organization(X)
=> ( ( ( greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
& smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) )
=> greater(capability(X,T),capability(X,T0)) )
& ( ( smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
& greater(internal_friction(X,T),internal_friction(X,T0)) )
=> smaller(capability(X,T),capability(X,T0)) )
& ( ( stock_of_knowledge(X,T) = stock_of_knowledge(X,T0)
& internal_friction(X,T) = internal_friction(X,T0) )
=> capability(X,T) = capability(X,T0) ) ) ),
input ).
fof(assumption_5_0,plain,
! [T,T0,X] :
( ~ organization(X)
| ( ( ( greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
& smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) )
=> greater(capability(X,T),capability(X,T0)) )
& ( ( smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
& greater(internal_friction(X,T),internal_friction(X,T0)) )
=> smaller(capability(X,T),capability(X,T0)) )
& ( ( stock_of_knowledge(X,T) = stock_of_knowledge(X,T0)
& internal_friction(X,T) = internal_friction(X,T0) )
=> capability(X,T) = capability(X,T0) ) ) ),
inference(orientation,[status(thm)],[assumption_5]) ).
fof(meaning_postulate_greater_transitive,axiom,
! [X,Y,Z] :
( ( greater(X,Y)
& greater(Y,Z) )
=> greater(X,Z) ),
input ).
fof(meaning_postulate_greater_transitive_0,plain,
! [X,Y,Z] :
( greater(X,Z)
| ~ ( greater(X,Y)
& greater(Y,Z) ) ),
inference(orientation,[status(thm)],[meaning_postulate_greater_transitive]) ).
fof(definition_smaller,axiom,
! [X,Y] :
( smaller(X,Y)
<=> greater(Y,X) ),
input ).
fof(definition_smaller_0,plain,
! [X,Y] :
( smaller(X,Y)
| ~ greater(Y,X) ),
inference(orientation,[status(thm)],[definition_smaller]) ).
fof(definition_smaller_1,plain,
! [X,Y] :
( ~ smaller(X,Y)
| greater(Y,X) ),
inference(orientation,[status(thm)],[definition_smaller]) ).
fof(definition_greater_or_equal,axiom,
! [X,Y] :
( greater_or_equal(X,Y)
<=> ( greater(X,Y)
| X = Y ) ),
input ).
fof(definition_greater_or_equal_0,plain,
! [X,Y] :
( greater_or_equal(X,Y)
| ~ ( greater(X,Y)
| X = Y ) ),
inference(orientation,[status(thm)],[definition_greater_or_equal]) ).
fof(definition_greater_or_equal_1,plain,
! [X,Y] :
( ~ greater_or_equal(X,Y)
| greater(X,Y)
| X = Y ),
inference(orientation,[status(thm)],[definition_greater_or_equal]) ).
fof(definition_smaller_or_equal,axiom,
! [X,Y] :
( smaller_or_equal(X,Y)
<=> ( smaller(X,Y)
| X = Y ) ),
input ).
fof(definition_smaller_or_equal_0,plain,
! [X,Y] :
( smaller_or_equal(X,Y)
| ~ ( smaller(X,Y)
| X = Y ) ),
inference(orientation,[status(thm)],[definition_smaller_or_equal]) ).
fof(definition_smaller_or_equal_1,plain,
! [X,Y] :
( ~ smaller_or_equal(X,Y)
| smaller(X,Y)
| X = Y ),
inference(orientation,[status(thm)],[definition_smaller_or_equal]) ).
fof(def_lhs_atom1,axiom,
! [Y,X] :
( lhs_atom1(Y,X)
<=> ~ smaller_or_equal(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X,Y] :
( lhs_atom1(Y,X)
| smaller(X,Y)
| X = Y ),
inference(fold_definition,[status(thm)],[definition_smaller_or_equal_1,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Y,X] :
( lhs_atom2(Y,X)
<=> smaller_or_equal(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X,Y] :
( lhs_atom2(Y,X)
| ~ ( smaller(X,Y)
| X = Y ) ),
inference(fold_definition,[status(thm)],[definition_smaller_or_equal_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [Y,X] :
( lhs_atom3(Y,X)
<=> ~ greater_or_equal(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [X,Y] :
( lhs_atom3(Y,X)
| greater(X,Y)
| X = Y ),
inference(fold_definition,[status(thm)],[definition_greater_or_equal_1,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [Y,X] :
( lhs_atom4(Y,X)
<=> greater_or_equal(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [X,Y] :
( lhs_atom4(Y,X)
| ~ ( greater(X,Y)
| X = Y ) ),
inference(fold_definition,[status(thm)],[definition_greater_or_equal_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [Y,X] :
( lhs_atom5(Y,X)
<=> ~ smaller(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [X,Y] :
( lhs_atom5(Y,X)
| greater(Y,X) ),
inference(fold_definition,[status(thm)],[definition_smaller_1,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [Y,X] :
( lhs_atom6(Y,X)
<=> smaller(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [X,Y] :
( lhs_atom6(Y,X)
| ~ greater(Y,X) ),
inference(fold_definition,[status(thm)],[definition_smaller_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [Z,X] :
( lhs_atom7(Z,X)
<=> greater(X,Z) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [X,Y,Z] :
( lhs_atom7(Z,X)
| ~ ( greater(X,Y)
& greater(Y,Z) ) ),
inference(fold_definition,[status(thm)],[meaning_postulate_greater_transitive_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [X] :
( lhs_atom8(X)
<=> ~ organization(X) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
! [T,T0,X] :
( lhs_atom8(X)
| ( ( ( greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
& smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) )
=> greater(capability(X,T),capability(X,T0)) )
& ( ( smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
& greater(internal_friction(X,T),internal_friction(X,T0)) )
=> smaller(capability(X,T),capability(X,T0)) )
& ( ( stock_of_knowledge(X,T) = stock_of_knowledge(X,T0)
& internal_friction(X,T) = internal_friction(X,T0) )
=> capability(X,T) = capability(X,T0) ) ) ),
inference(fold_definition,[status(thm)],[assumption_5_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [X,T0,T] :
( lhs_atom9(X,T0,T)
<=> greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
! [T,T0,X] :
( lhs_atom9(X,T0,T)
| ~ ( organization(X)
& greater(age(X,T),age(X,T0)) ) ),
inference(fold_definition,[status(thm)],[assumption_7_0,def_lhs_atom9]) ).
fof(to_be_clausified_9,plain,
! [T,T0,X] :
( lhs_atom8(X)
| internal_friction(X,T) = internal_friction(X,T0) ),
inference(fold_definition,[status(thm)],[assumption_9_0,def_lhs_atom8]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X4,X5] :
( lhs_atom8(X2)
| ( ( ( greater(stock_of_knowledge(X2,X5),stock_of_knowledge(X2,X4))
& smaller_or_equal(internal_friction(X2,X5),internal_friction(X2,X4)) )
=> greater(capability(X2,X5),capability(X2,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X2,X5),stock_of_knowledge(X2,X4))
& greater(internal_friction(X2,X5),internal_friction(X2,X4)) )
=> smaller(capability(X2,X5),capability(X2,X4)) )
& ( ( stock_of_knowledge(X2,X5) = stock_of_knowledge(X2,X4)
& internal_friction(X2,X5) = internal_friction(X2,X4) )
=> capability(X2,X5) = capability(X2,X4) ) ) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_1,axiom,
! [X2,X4,X5] :
( lhs_atom9(X2,X4,X5)
| ~ ( organization(X2)
& greater(age(X2,X5),age(X2,X4)) ) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_2,axiom,
! [X3,X1,X2] :
( lhs_atom7(X3,X2)
| ~ ( greater(X2,X1)
& greater(X1,X3) ) ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_3,axiom,
! [X1,X2] :
( lhs_atom6(X1,X2)
| ~ greater(X1,X2) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_4,axiom,
! [X1,X2] :
( lhs_atom4(X1,X2)
| ~ ( greater(X2,X1)
| X2 = X1 ) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_5,axiom,
! [X1,X2] :
( lhs_atom2(X1,X2)
| ~ ( smaller(X2,X1)
| X2 = X1 ) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_6,axiom,
! [X2,X4,X5] :
( lhs_atom8(X2)
| internal_friction(X2,X5) = internal_friction(X2,X4) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_7,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| greater(X2,X1)
| X2 = X1 ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_8,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| smaller(X2,X1)
| X2 = X1 ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_9,axiom,
! [X1,X2] :
( lhs_atom5(X1,X2)
| greater(X1,X2) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_10,axiom,
! [X2,X4,X5] :
( lhs_atom8(X2)
| ( ( ( greater(stock_of_knowledge(X2,X5),stock_of_knowledge(X2,X4))
& smaller_or_equal(internal_friction(X2,X5),internal_friction(X2,X4)) )
=> greater(capability(X2,X5),capability(X2,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X2,X5),stock_of_knowledge(X2,X4))
& greater(internal_friction(X2,X5),internal_friction(X2,X4)) )
=> smaller(capability(X2,X5),capability(X2,X4)) )
& ( ( stock_of_knowledge(X2,X5) = stock_of_knowledge(X2,X4)
& internal_friction(X2,X5) = internal_friction(X2,X4) )
=> capability(X2,X5) = capability(X2,X4) ) ) ),
c_0_0 ).
fof(c_0_11,axiom,
! [X2,X4,X5] :
( lhs_atom9(X2,X4,X5)
| ~ ( organization(X2)
& greater(age(X2,X5),age(X2,X4)) ) ),
c_0_1 ).
fof(c_0_12,axiom,
! [X3,X1,X2] :
( lhs_atom7(X3,X2)
| ~ ( greater(X2,X1)
& greater(X1,X3) ) ),
c_0_2 ).
fof(c_0_13,plain,
! [X1,X2] :
( lhs_atom6(X1,X2)
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_14,axiom,
! [X1,X2] :
( lhs_atom4(X1,X2)
| ~ ( greater(X2,X1)
| X2 = X1 ) ),
c_0_4 ).
fof(c_0_15,axiom,
! [X1,X2] :
( lhs_atom2(X1,X2)
| ~ ( smaller(X2,X1)
| X2 = X1 ) ),
c_0_5 ).
fof(c_0_16,axiom,
! [X2,X4,X5] :
( lhs_atom8(X2)
| internal_friction(X2,X5) = internal_friction(X2,X4) ),
c_0_6 ).
fof(c_0_17,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| greater(X2,X1)
| X2 = X1 ),
c_0_7 ).
fof(c_0_18,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| smaller(X2,X1)
| X2 = X1 ),
c_0_8 ).
fof(c_0_19,axiom,
! [X1,X2] :
( lhs_atom5(X1,X2)
| greater(X1,X2) ),
c_0_9 ).
fof(c_0_20,plain,
! [X6,X7,X8,X9,X10,X11,X12] :
( ( ~ greater(stock_of_knowledge(X6,X8),stock_of_knowledge(X6,X7))
| ~ smaller_or_equal(internal_friction(X6,X8),internal_friction(X6,X7))
| greater(capability(X6,X8),capability(X6,X7))
| lhs_atom8(X6) )
& ( ~ smaller_or_equal(stock_of_knowledge(X6,X10),stock_of_knowledge(X6,X9))
| ~ greater(internal_friction(X6,X10),internal_friction(X6,X9))
| smaller(capability(X6,X10),capability(X6,X9))
| lhs_atom8(X6) )
& ( stock_of_knowledge(X6,X12) != stock_of_knowledge(X6,X11)
| internal_friction(X6,X12) != internal_friction(X6,X11)
| capability(X6,X12) = capability(X6,X11)
| lhs_atom8(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_21,plain,
! [X6,X7,X8] :
( lhs_atom9(X6,X7,X8)
| ~ organization(X6)
| ~ greater(age(X6,X8),age(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( lhs_atom7(X4,X6)
| ~ greater(X6,X5)
| ~ greater(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
fof(c_0_23,plain,
! [X3,X4] :
( lhs_atom6(X3,X4)
| ~ greater(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_24,plain,
! [X3,X4] :
( ( ~ greater(X4,X3)
| lhs_atom4(X3,X4) )
& ( X4 != X3
| lhs_atom4(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ( ~ smaller(X4,X3)
| lhs_atom2(X3,X4) )
& ( X4 != X3
| lhs_atom2(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_26,plain,
! [X6,X7,X8] :
( lhs_atom8(X6)
| internal_friction(X6,X8) = internal_friction(X6,X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_16])])]) ).
fof(c_0_27,plain,
! [X3,X4] :
( lhs_atom3(X3,X4)
| greater(X4,X3)
| X4 = X3 ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_28,plain,
! [X3,X4] :
( lhs_atom1(X3,X4)
| smaller(X4,X3)
| X4 = X3 ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_29,plain,
! [X3,X4] :
( lhs_atom5(X3,X4)
| greater(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( lhs_atom8(X1)
| greater(capability(X1,X2),capability(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( lhs_atom8(X1)
| smaller(capability(X1,X2),capability(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
( lhs_atom9(X1,X3,X2)
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( lhs_atom8(X1)
| capability(X1,X2) = capability(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_34,plain,
( lhs_atom7(X2,X3)
| ~ greater(X1,X2)
| ~ greater(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
( lhs_atom6(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
( lhs_atom4(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
( lhs_atom2(X1,X2)
| ~ smaller(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| lhs_atom8(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( X1 = X2
| greater(X1,X2)
| lhs_atom3(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,plain,
( X1 = X2
| smaller(X1,X2)
| lhs_atom1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
( greater(X1,X2)
| lhs_atom5(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,plain,
( lhs_atom4(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_43,plain,
( lhs_atom2(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_44,plain,
( lhs_atom8(X1)
| greater(capability(X1,X2),capability(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
c_0_30,
[final] ).
cnf(c_0_45,plain,
( lhs_atom8(X1)
| smaller(capability(X1,X2),capability(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
c_0_31,
[final] ).
cnf(c_0_46,plain,
( lhs_atom9(X1,X3,X2)
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
c_0_32,
[final] ).
cnf(c_0_47,plain,
( lhs_atom8(X1)
| capability(X1,X2) = capability(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3) ),
c_0_33,
[final] ).
cnf(c_0_48,plain,
( lhs_atom7(X2,X3)
| ~ greater(X1,X2)
| ~ greater(X3,X1) ),
c_0_34,
[final] ).
cnf(c_0_49,plain,
( lhs_atom6(X1,X2)
| ~ greater(X1,X2) ),
c_0_35,
[final] ).
cnf(c_0_50,plain,
( lhs_atom4(X1,X2)
| ~ greater(X2,X1) ),
c_0_36,
[final] ).
cnf(c_0_51,plain,
( lhs_atom2(X1,X2)
| ~ smaller(X2,X1) ),
c_0_37,
[final] ).
cnf(c_0_52,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| lhs_atom8(X1) ),
c_0_38,
[final] ).
cnf(c_0_53,plain,
( X1 = X2
| greater(X1,X2)
| lhs_atom3(X2,X1) ),
c_0_39,
[final] ).
cnf(c_0_54,plain,
( X1 = X2
| smaller(X1,X2)
| lhs_atom1(X2,X1) ),
c_0_40,
[final] ).
cnf(c_0_55,plain,
( greater(X1,X2)
| lhs_atom5(X1,X2) ),
c_0_41,
[final] ).
cnf(c_0_56,plain,
( lhs_atom4(X1,X2)
| X2 != X1 ),
c_0_42,
[final] ).
cnf(c_0_57,plain,
( lhs_atom2(X1,X2)
| X2 != X1 ),
c_0_43,
[final] ).
% End CNF derivation
cnf(c_0_44_0,axiom,
( ~ organization(X1)
| greater(capability(X1,X2),capability(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
inference(unfold_definition,[status(thm)],[c_0_44,def_lhs_atom8]) ).
cnf(c_0_45_0,axiom,
( ~ organization(X1)
| smaller(capability(X1,X2),capability(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
inference(unfold_definition,[status(thm)],[c_0_45,def_lhs_atom8]) ).
cnf(c_0_46_0,axiom,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
inference(unfold_definition,[status(thm)],[c_0_46,def_lhs_atom9]) ).
cnf(c_0_47_0,axiom,
( ~ organization(X1)
| capability(X1,X2) = capability(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_47,def_lhs_atom8]) ).
cnf(c_0_48_0,axiom,
( greater(X3,X2)
| ~ greater(X1,X2)
| ~ greater(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_48,def_lhs_atom7]) ).
cnf(c_0_49_0,axiom,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_49,def_lhs_atom6]) ).
cnf(c_0_50_0,axiom,
( greater_or_equal(X2,X1)
| ~ greater(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_50,def_lhs_atom4]) ).
cnf(c_0_51_0,axiom,
( smaller_or_equal(X2,X1)
| ~ smaller(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_51,def_lhs_atom2]) ).
cnf(c_0_52_0,axiom,
( ~ organization(X1)
| internal_friction(X1,X2) = internal_friction(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_52,def_lhs_atom8]) ).
cnf(c_0_53_0,axiom,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_53,def_lhs_atom3]) ).
cnf(c_0_54_0,axiom,
( ~ smaller_or_equal(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_54,def_lhs_atom1]) ).
cnf(c_0_55_0,axiom,
( ~ smaller(X2,X1)
| greater(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_55,def_lhs_atom5]) ).
cnf(c_0_56_0,axiom,
( greater_or_equal(X2,X1)
| X2 != X1 ),
inference(unfold_definition,[status(thm)],[c_0_56,def_lhs_atom4]) ).
cnf(c_0_57_0,axiom,
( smaller_or_equal(X2,X1)
| X2 != X1 ),
inference(unfold_definition,[status(thm)],[c_0_57,def_lhs_atom2]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& greater(X2,X1) ),
file('<stdin>',meaning_postulate_greater_strict) ).
fof(c_0_1_002,axiom,
! [X1,X2] :
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('<stdin>',meaning_postulate_greater_comparable) ).
fof(c_0_2_003,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& greater(X2,X1) ),
c_0_0 ).
fof(c_0_3_004,axiom,
! [X1,X2] :
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_1 ).
fof(c_0_4_005,plain,
! [X3,X4] :
( ~ greater(X3,X4)
| ~ greater(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_5_006,plain,
! [X3,X4] :
( smaller(X3,X4)
| X3 = X4
| greater(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_3]) ).
cnf(c_0_6_007,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,plain,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
c_0_6,
[final] ).
cnf(c_0_9_010,plain,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
c_0_7,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_8_0,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_8]) ).
cnf(c_0_8_1,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_8]) ).
cnf(c_0_9_0,axiom,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_9]) ).
cnf(c_0_9_1,axiom,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_9]) ).
cnf(c_0_9_2,axiom,
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_9]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_011,conjecture,
! [X1,X2,X3] :
( ( organization(X1)
& greater(age(X1,X3),age(X1,X2)) )
=> greater(capability(X1,X3),capability(X1,X2)) ),
file('<stdin>',lemma_3) ).
fof(c_0_1_012,negated_conjecture,
~ ! [X1,X2,X3] :
( ( organization(X1)
& greater(age(X1,X3),age(X1,X2)) )
=> greater(capability(X1,X3),capability(X1,X2)) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_013,negated_conjecture,
( organization(esk1_0)
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& ~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_014,negated_conjecture,
~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_015,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_016,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_017,negated_conjecture,
~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
c_0_3,
[final] ).
cnf(c_0_7_018,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
c_0_4,
[final] ).
cnf(c_0_8_019,negated_conjecture,
organization(esk1_0),
c_0_5,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_21,negated_conjecture,
organization(sk3_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_55e9b2.p',c_0_8) ).
cnf(c_41,negated_conjecture,
organization(sk3_esk1_0),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_51,negated_conjecture,
organization(sk3_esk1_0),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_52,negated_conjecture,
organization(sk3_esk1_0),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_57,negated_conjecture,
organization(sk3_esk1_0),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_122,negated_conjecture,
organization(sk3_esk1_0),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_18,plain,
( ~ greater(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ smaller_or_equal(internal_friction(X0,X1),internal_friction(X0,X2))
| greater(capability(X0,X1),capability(X0,X2))
| ~ organization(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_55e9b2.p',c_0_44_0) ).
cnf(c_116,plain,
( ~ greater(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ smaller_or_equal(internal_friction(X0,X1),internal_friction(X0,X2))
| greater(capability(X0,X1),capability(X0,X2))
| ~ organization(X0) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_117,plain,
( greater(capability(X0,X1),capability(X0,X2))
| ~ greater(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ smaller_or_equal(internal_friction(X0,X1),internal_friction(X0,X2))
| ~ organization(X0) ),
inference(rewriting,[status(thm)],[c_116]) ).
cnf(c_126,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(stock_of_knowledge(sk3_esk1_0,X0),stock_of_knowledge(sk3_esk1_0,X1))
| ~ smaller_or_equal(internal_friction(sk3_esk1_0,X0),internal_friction(sk3_esk1_0,X1)) ),
inference(resolution,[status(thm)],[c_122,c_117]) ).
cnf(c_133,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(stock_of_knowledge(sk3_esk1_0,X0),stock_of_knowledge(sk3_esk1_0,X1))
| ~ smaller_or_equal(internal_friction(sk3_esk1_0,X0),internal_friction(sk3_esk1_0,X1)) ),
inference(rewriting,[status(thm)],[c_126]) ).
cnf(c_5,plain,
( X0 != X1
| smaller_or_equal(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_55e9b2.p',c_0_57_0) ).
cnf(c_90,plain,
( X0 != X1
| smaller_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_91,plain,
( smaller_or_equal(X0,X1)
| X0 != X1 ),
inference(rewriting,[status(thm)],[c_90]) ).
cnf(c_181,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(stock_of_knowledge(sk3_esk1_0,X0),stock_of_knowledge(sk3_esk1_0,X1))
| internal_friction(sk3_esk1_0,X0) != internal_friction(sk3_esk1_0,X1) ),
inference(resolution,[status(thm)],[c_133,c_91]) ).
cnf(c_182,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(stock_of_knowledge(sk3_esk1_0,X0),stock_of_knowledge(sk3_esk1_0,X1))
| internal_friction(sk3_esk1_0,X0) != internal_friction(sk3_esk1_0,X1) ),
inference(rewriting,[status(thm)],[c_181]) ).
cnf(c_10,plain,
( internal_friction(X0,X1) = internal_friction(X0,X2)
| ~ organization(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_55e9b2.p',c_0_52_0) ).
cnf(c_100,plain,
( internal_friction(X0,X1) = internal_friction(X0,X2)
| ~ organization(X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_101,plain,
( ~ organization(X0)
| internal_friction(X0,X1) = internal_friction(X0,X2) ),
inference(rewriting,[status(thm)],[c_100]) ).
cnf(c_129,plain,
internal_friction(sk3_esk1_0,X0) = internal_friction(sk3_esk1_0,X1),
inference(resolution,[status(thm)],[c_122,c_101]) ).
cnf(c_130,plain,
internal_friction(sk3_esk1_0,X0) = internal_friction(sk3_esk1_0,X1),
inference(rewriting,[status(thm)],[c_129]) ).
cnf(c_256,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(stock_of_knowledge(sk3_esk1_0,X0),stock_of_knowledge(sk3_esk1_0,X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_182,c_130]) ).
cnf(c_257,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(stock_of_knowledge(sk3_esk1_0,X0),stock_of_knowledge(sk3_esk1_0,X1)) ),
inference(rewriting,[status(thm)],[c_256]) ).
cnf(c_16,plain,
( ~ organization(X0)
| ~ greater(age(X0,X1),age(X0,X2))
| greater(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_55e9b2.p',c_0_46_0) ).
cnf(c_112,plain,
( ~ organization(X0)
| ~ greater(age(X0,X1),age(X0,X2))
| greater(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2)) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_113,plain,
( greater(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ greater(age(X0,X1),age(X0,X2))
| ~ organization(X0) ),
inference(rewriting,[status(thm)],[c_112]) ).
cnf(c_264,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(age(sk3_esk1_0,X0),age(sk3_esk1_0,X1))
| ~ organization(sk3_esk1_0) ),
inference(resolution,[status(thm)],[c_257,c_113]) ).
cnf(c_265,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(age(sk3_esk1_0,X0),age(sk3_esk1_0,X1))
| ~ organization(sk3_esk1_0) ),
inference(rewriting,[status(thm)],[c_264]) ).
cnf(c_305,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(age(sk3_esk1_0,X0),age(sk3_esk1_0,X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_265,c_122]) ).
cnf(c_306,plain,
( greater(capability(sk3_esk1_0,X0),capability(sk3_esk1_0,X1))
| ~ greater(age(sk3_esk1_0,X0),age(sk3_esk1_0,X1)) ),
inference(rewriting,[status(thm)],[c_305]) ).
cnf(c_20,negated_conjecture,
greater(age(sk3_esk1_0,sk3_esk3_0),age(sk3_esk1_0,sk3_esk2_0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_55e9b2.p',c_0_7) ).
cnf(c_39,negated_conjecture,
greater(age(sk3_esk1_0,sk3_esk3_0),age(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_50,negated_conjecture,
greater(age(sk3_esk1_0,sk3_esk3_0),age(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_53,negated_conjecture,
greater(age(sk3_esk1_0,sk3_esk3_0),age(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_56,negated_conjecture,
greater(age(sk3_esk1_0,sk3_esk3_0),age(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_120,negated_conjecture,
greater(age(sk3_esk1_0,sk3_esk3_0),age(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_313,plain,
greater(capability(sk3_esk1_0,sk3_esk3_0),capability(sk3_esk1_0,sk3_esk2_0)),
inference(resolution,[status(thm)],[c_306,c_120]) ).
cnf(c_314,plain,
greater(capability(sk3_esk1_0,sk3_esk3_0),capability(sk3_esk1_0,sk3_esk2_0)),
inference(rewriting,[status(thm)],[c_313]) ).
cnf(c_19,negated_conjecture,
~ greater(capability(sk3_esk1_0,sk3_esk3_0),capability(sk3_esk1_0,sk3_esk2_0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_55e9b2.p',c_0_6) ).
cnf(c_37,negated_conjecture,
~ greater(capability(sk3_esk1_0,sk3_esk3_0),capability(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_49,negated_conjecture,
~ greater(capability(sk3_esk1_0,sk3_esk3_0),capability(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_54,negated_conjecture,
~ greater(capability(sk3_esk1_0,sk3_esk3_0),capability(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_55,negated_conjecture,
~ greater(capability(sk3_esk1_0,sk3_esk3_0),capability(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_118,negated_conjecture,
~ greater(capability(sk3_esk1_0,sk3_esk3_0),capability(sk3_esk1_0,sk3_esk2_0)),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_316,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_314,c_118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n020.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:25:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.39 % FOF problem with conjecture
% 0.19/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_b1f28f.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_55e9b2.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_759a97 | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b1f28f.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42 % ------ Parsing...% successful
% 0.19/0.42
% 0.19/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.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 % ------ Problem Properties
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % EPR false
% 0.19/0.42 % Horn false
% 0.19/0.42 % Has equality true
% 0.19/0.42
% 0.19/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % % ------ Current options:
% 0.19/0.42
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.43 % --inst_prop_sim_new false
% 0.19/0.43 % --inst_orphan_elimination true
% 0.19/0.43 % --inst_learning_loop_flag true
% 0.19/0.43 % --inst_learning_start 3000
% 0.19/0.43 % --inst_learning_factor 2
% 0.19/0.43 % --inst_start_prop_sim_after_learn 3
% 0.19/0.43 % --inst_sel_renew solver
% 0.19/0.43 % --inst_lit_activity_flag true
% 0.19/0.43 % --inst_out_proof true
% 0.19/0.43
% 0.19/0.43 % ------ Resolution Options
% 0.19/0.43
% 0.19/0.43 % --resolution_flag true
% 0.19/0.43 % --res_lit_sel kbo_max
% 0.19/0.43 % --res_to_prop_solver none
% 0.19/0.43 % --res_prop_simpl_new false
% 0.19/0.43 % --res_prop_simpl_given false
% 0.19/0.43 % --res_passive_queue_type priority_queues
% 0.19/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.43 % --res_passive_queues_freq [15;5]
% 0.19/0.43 % --res_forward_subs full
% 0.19/0.43 % --res_backward_subs full
% 0.19/0.43 % --res_forward_subs_resolution true
% 0.19/0.43 % --res_backward_subs_resolution true
% 0.19/0.43 % --res_orphan_elimination false
% 0.19/0.43 % --res_time_limit 1000.
% 0.19/0.43 % --res_out_proof true
% 0.19/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b1f28f.s
% 0.19/0.43 % --modulo true
% 0.19/0.43
% 0.19/0.43 % ------ Combination Options
% 0.19/0.43
% 0.19/0.43 % --comb_res_mult 1000
% 0.19/0.43 % --comb_inst_mult 300
% 0.19/0.43 % ------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % ------ Proving...
% 0.19/0.43 %
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % Resolution empty clause
% 0.19/0.43
% 0.19/0.43 % ------ Statistics
% 0.19/0.43
% 0.19/0.43 % ------ General
% 0.19/0.43
% 0.19/0.43 % num_of_input_clauses: 22
% 0.19/0.43 % num_of_input_neg_conjectures: 3
% 0.19/0.43 % num_of_splits: 0
% 0.19/0.43 % num_of_split_atoms: 0
% 0.19/0.43 % num_of_sem_filtered_clauses: 0
% 0.19/0.43 % num_of_subtypes: 0
% 0.19/0.43 % monotx_restored_types: 0
% 0.19/0.43 % sat_num_of_epr_types: 0
% 0.19/0.43 % sat_num_of_non_cyclic_types: 0
% 0.19/0.43 % sat_guarded_non_collapsed_types: 0
% 0.19/0.43 % is_epr: 0
% 0.19/0.43 % is_horn: 0
% 0.19/0.43 % has_eq: 1
% 0.19/0.43 % num_pure_diseq_elim: 0
% 0.19/0.43 % simp_replaced_by: 0
% 0.19/0.43 % res_preprocessed: 6
% 0.19/0.43 % prep_upred: 0
% 0.19/0.43 % prep_unflattend: 0
% 0.19/0.43 % pred_elim_cands: 0
% 0.19/0.43 % pred_elim: 0
% 0.19/0.43 % pred_elim_cl: 0
% 0.19/0.43 % pred_elim_cycles: 0
% 0.19/0.43 % forced_gc_time: 0
% 0.19/0.43 % gc_basic_clause_elim: 0
% 0.19/0.43 % parsing_time: 0.001
% 0.19/0.43 % sem_filter_time: 0.
% 0.19/0.43 % pred_elim_time: 0.
% 0.19/0.43 % out_proof_time: 0.002
% 0.19/0.43 % monotx_time: 0.
% 0.19/0.43 % subtype_inf_time: 0.
% 0.19/0.43 % unif_index_cands_time: 0.
% 0.19/0.43 % unif_index_add_time: 0.
% 0.19/0.43 % total_time: 0.03
% 0.19/0.43 % num_of_symbols: 37
% 0.19/0.43 % num_of_terms: 199
% 0.19/0.43
% 0.19/0.43 % ------ Propositional Solver
% 0.19/0.43
% 0.19/0.43 % prop_solver_calls: 1
% 0.19/0.43 % prop_fast_solver_calls: 9
% 0.19/0.43 % prop_num_of_clauses: 34
% 0.19/0.43 % prop_preprocess_simplified: 72
% 0.19/0.43 % prop_fo_subsumed: 0
% 0.19/0.43 % prop_solver_time: 0.
% 0.19/0.43 % prop_fast_solver_time: 0.
% 0.19/0.43 % prop_unsat_core_time: 0.
% 0.19/0.43
% 0.19/0.43 % ------ QBF
% 0.19/0.43
% 0.19/0.43 % qbf_q_res: 0
% 0.19/0.43 % qbf_num_tautologies: 0
% 0.19/0.43 % qbf_prep_cycles: 0
% 0.19/0.43
% 0.19/0.43 % ------ BMC1
% 0.19/0.43
% 0.19/0.43 % bmc1_current_bound: -1
% 0.19/0.43 % bmc1_last_solved_bound: -1
% 0.19/0.43 % bmc1_unsat_core_size: -1
% 0.19/0.43 % bmc1_unsat_core_parents_size: -1
% 0.19/0.43 % bmc1_merge_next_fun: 0
% 0.19/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation
% 0.19/0.43
% 0.19/0.43 % inst_num_of_clauses: 21
% 0.19/0.43 % inst_num_in_passive: 0
% 0.19/0.43 % inst_num_in_active: 0
% 0.19/0.43 % inst_num_in_unprocessed: 22
% 0.19/0.43 % inst_num_of_loops: 0
% 0.19/0.43 % inst_num_of_learning_restarts: 0
% 0.19/0.43 % inst_num_moves_active_passive: 0
% 0.19/0.43 % inst_lit_activity: 0
% 0.19/0.43 % inst_lit_activity_moves: 0
% 0.19/0.43 % inst_num_tautologies: 0
% 0.19/0.43 % inst_num_prop_implied: 0
% 0.19/0.43 % inst_num_existing_simplified: 0
% 0.19/0.43 % inst_num_eq_res_simplified: 0
% 0.19/0.43 % inst_num_child_elim: 0
% 0.19/0.43 % inst_num_of_dismatching_blockings: 0
% 0.19/0.43 % inst_num_of_non_proper_insts: 0
% 0.19/0.43 % inst_num_of_duplicates: 0
% 0.19/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.19/0.43 % inst_dismatching_checking_time: 0.
% 0.19/0.43
% 0.19/0.43 % ------ Resolution
% 0.19/0.43
% 0.19/0.43 % res_num_of_clauses: 65
% 0.19/0.43 % res_num_in_passive: 14
% 0.19/0.43 % res_num_in_active: 38
% 0.19/0.43 % res_num_of_loops: 25
% 0.19/0.43 % res_forward_subset_subsumed: 4
% 0.19/0.43 % res_backward_subset_subsumed: 2
% 0.19/0.43 % res_forward_subsumed: 0
% 0.19/0.43 % res_backward_subsumed: 0
% 0.19/0.43 % res_forward_subsumption_resolution: 4
% 0.19/0.43 % res_backward_subsumption_resolution: 0
% 0.19/0.43 % res_clause_to_clause_subsumption: 91
% 0.19/0.43 % res_orphan_elimination: 0
% 0.19/0.43 % res_tautology_del: 0
% 0.19/0.43 % res_num_eq_res_simplified: 0
% 0.19/0.43 % res_num_sel_changes: 0
% 0.19/0.43 % res_moves_from_active_to_pass: 0
% 0.19/0.43
% 0.19/0.43 % Status Unsatisfiable
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------