TSTP Solution File: MGT048-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT048-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n021.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:14:00 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 26
% Syntax : Number of formulae : 180 ( 36 unt; 0 def)
% Number of atoms : 429 ( 79 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 496 ( 247 ~; 249 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 326 ( 12 sgn 114 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3] :
( ~ organization(X3)
| ~ greater(stock_of_knowledge(X3,X2),stock_of_knowledge(X3,X1))
| ~ smaller_or_equal(internal_friction(X3,X2),internal_friction(X3,X1))
| greater(capability(X3,X2),capability(X3,X1)) ),
file('<stdin>',assumption_5_32) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( ~ organization(X3)
| ~ smaller_or_equal(stock_of_knowledge(X3,X2),stock_of_knowledge(X3,X1))
| ~ greater(internal_friction(X3,X2),internal_friction(X3,X1))
| smaller(capability(X3,X2),capability(X3,X1)) ),
file('<stdin>',assumption_5_33) ).
fof(c_0_2,axiom,
! [X1,X2,X3] :
( ~ organization(X3)
| ~ greater(age(X3,X2),age(X3,X1))
| greater(internal_friction(X3,X2),internal_friction(X3,X1)) ),
file('<stdin>',assumption_12_36) ).
fof(c_0_3,axiom,
! [X1,X2,X3] :
( ~ organization(X3)
| stock_of_knowledge(X3,X2) != stock_of_knowledge(X3,X1)
| internal_friction(X3,X2) != internal_friction(X3,X1)
| capability(X3,X2) = capability(X3,X1) ),
file('<stdin>',assumption_5_34) ).
fof(c_0_4,axiom,
! [X1,X2,X3] :
( ~ greater(X3,X2)
| ~ greater(X2,X1)
| greater(X3,X1) ),
file('<stdin>',meaning_postulate_greater_transitive_10) ).
fof(c_0_5,axiom,
! [X2,X3] :
( ~ greater(X3,X2)
| ~ greater(X2,X3) ),
file('<stdin>',meaning_postulate_greater_strict_9) ).
fof(c_0_6,axiom,
! [X2,X3] :
( ~ smaller_or_equal(X3,X2)
| smaller(X3,X2)
| X3 = X2 ),
file('<stdin>',definition_smaller_or_equal_1) ).
fof(c_0_7,axiom,
! [X2,X3] :
( ~ greater_or_equal(X3,X2)
| greater(X3,X2)
| X3 = X2 ),
file('<stdin>',definition_greater_or_equal_4) ).
fof(c_0_8,axiom,
! [X2,X3] :
( ~ smaller(X3,X2)
| smaller_or_equal(X3,X2) ),
file('<stdin>',definition_smaller_or_equal_2) ).
fof(c_0_9,axiom,
! [X2,X3] :
( ~ greater(X3,X2)
| greater_or_equal(X3,X2) ),
file('<stdin>',definition_greater_or_equal_5) ).
fof(c_0_10,axiom,
! [X2,X3] :
( ~ smaller(X3,X2)
| greater(X2,X3) ),
file('<stdin>',definition_smaller_7) ).
fof(c_0_11,axiom,
! [X2,X3] :
( ~ greater(X3,X2)
| smaller(X2,X3) ),
file('<stdin>',definition_smaller_8) ).
fof(c_0_12,axiom,
! [X1,X2,X3] :
( ~ organization(X3)
| stock_of_knowledge(X3,X2) = stock_of_knowledge(X3,X1) ),
file('<stdin>',assumption_10_35) ).
fof(c_0_13,axiom,
! [X2,X3] :
( smaller(X3,X2)
| X3 = X2
| greater(X3,X2) ),
file('<stdin>',meaning_postulate_greater_comparable_11) ).
fof(c_0_14,axiom,
! [X2,X3] :
( X3 != X2
| smaller_or_equal(X3,X2) ),
file('<stdin>',definition_smaller_or_equal_3) ).
fof(c_0_15,axiom,
! [X2,X3] :
( X3 != X2
| greater_or_equal(X3,X2) ),
file('<stdin>',definition_greater_or_equal_6) ).
fof(c_0_16,plain,
! [X1,X2,X3] :
( ~ organization(X3)
| ~ greater(stock_of_knowledge(X3,X2),stock_of_knowledge(X3,X1))
| ~ smaller_or_equal(internal_friction(X3,X2),internal_friction(X3,X1))
| greater(capability(X3,X2),capability(X3,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_17,plain,
! [X1,X2,X3] :
( ~ organization(X3)
| ~ smaller_or_equal(stock_of_knowledge(X3,X2),stock_of_knowledge(X3,X1))
| ~ greater(internal_friction(X3,X2),internal_friction(X3,X1))
| smaller(capability(X3,X2),capability(X3,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_18,plain,
! [X1,X2,X3] :
( ~ organization(X3)
| ~ greater(age(X3,X2),age(X3,X1))
| greater(internal_friction(X3,X2),internal_friction(X3,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_19,plain,
! [X1,X2,X3] :
( ~ organization(X3)
| stock_of_knowledge(X3,X2) != stock_of_knowledge(X3,X1)
| internal_friction(X3,X2) != internal_friction(X3,X1)
| capability(X3,X2) = capability(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_20,plain,
! [X1,X2,X3] :
( ~ greater(X3,X2)
| ~ greater(X2,X1)
| greater(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_21,plain,
! [X2,X3] :
( ~ greater(X3,X2)
| ~ greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_22,plain,
! [X2,X3] :
( ~ smaller_or_equal(X3,X2)
| smaller(X3,X2)
| X3 = X2 ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_23,plain,
! [X2,X3] :
( ~ greater_or_equal(X3,X2)
| greater(X3,X2)
| X3 = X2 ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_24,plain,
! [X2,X3] :
( ~ smaller(X3,X2)
| smaller_or_equal(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_25,plain,
! [X2,X3] :
( ~ greater(X3,X2)
| greater_or_equal(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_26,plain,
! [X2,X3] :
( ~ smaller(X3,X2)
| greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_27,plain,
! [X2,X3] :
( ~ greater(X3,X2)
| smaller(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_28,plain,
! [X1,X2,X3] :
( ~ organization(X3)
| stock_of_knowledge(X3,X2) = stock_of_knowledge(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_29,axiom,
! [X2,X3] :
( smaller(X3,X2)
| X3 = X2
| greater(X3,X2) ),
c_0_13 ).
fof(c_0_30,axiom,
! [X2,X3] :
( X3 != X2
| smaller_or_equal(X3,X2) ),
c_0_14 ).
fof(c_0_31,axiom,
! [X2,X3] :
( X3 != X2
| greater_or_equal(X3,X2) ),
c_0_15 ).
fof(c_0_32,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| ~ greater(stock_of_knowledge(X6,X5),stock_of_knowledge(X6,X4))
| ~ smaller_or_equal(internal_friction(X6,X5),internal_friction(X6,X4))
| greater(capability(X6,X5),capability(X6,X4)) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_33,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| ~ smaller_or_equal(stock_of_knowledge(X6,X5),stock_of_knowledge(X6,X4))
| ~ greater(internal_friction(X6,X5),internal_friction(X6,X4))
| smaller(capability(X6,X5),capability(X6,X4)) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_34,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| ~ greater(age(X6,X5),age(X6,X4))
| greater(internal_friction(X6,X5),internal_friction(X6,X4)) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_35,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| stock_of_knowledge(X6,X5) != stock_of_knowledge(X6,X4)
| internal_friction(X6,X5) != internal_friction(X6,X4)
| capability(X6,X5) = capability(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_36,plain,
! [X4,X5,X6] :
( ~ greater(X6,X5)
| ~ greater(X5,X4)
| greater(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_37,plain,
! [X4,X5] :
( ~ greater(X5,X4)
| ~ greater(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_38,plain,
! [X4,X5] :
( ~ smaller_or_equal(X5,X4)
| smaller(X5,X4)
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_39,plain,
! [X4,X5] :
( ~ greater_or_equal(X5,X4)
| greater(X5,X4)
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_40,plain,
! [X4,X5] :
( ~ smaller(X5,X4)
| smaller_or_equal(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_41,plain,
! [X4,X5] :
( ~ greater(X5,X4)
| greater_or_equal(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_42,plain,
! [X4,X5] :
( ~ smaller(X5,X4)
| greater(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_43,plain,
! [X4,X5] :
( ~ greater(X5,X4)
| smaller(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_44,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| stock_of_knowledge(X6,X5) = stock_of_knowledge(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_45,plain,
! [X4,X5] :
( smaller(X5,X4)
| X5 = X4
| greater(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_46,plain,
! [X4,X5] :
( X5 != X4
| smaller_or_equal(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_47,plain,
! [X4,X5] :
( X5 != X4
| greater_or_equal(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
cnf(c_0_48,plain,
( 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))
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_49,plain,
( 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))
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_50,plain,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,plain,
( capability(X1,X2) = capability(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_52,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_53,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_54,plain,
( X1 = X2
| smaller(X1,X2)
| ~ smaller_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_55,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_56,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_57,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_58,plain,
( greater(X1,X2)
| ~ smaller(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_59,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_60,plain,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_61,plain,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_62,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_63,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_64,plain,
( 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))
| ~ organization(X1) ),
c_0_48,
[final] ).
cnf(c_0_65,plain,
( 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))
| ~ organization(X1) ),
c_0_49,
[final] ).
cnf(c_0_66,plain,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
c_0_50,
[final] ).
cnf(c_0_67,plain,
( capability(X1,X2) = capability(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
c_0_51,
[final] ).
cnf(c_0_68,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
c_0_52,
[final] ).
cnf(c_0_69,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
c_0_53,
[final] ).
cnf(c_0_70,plain,
( X1 = X2
| smaller(X1,X2)
| ~ smaller_or_equal(X1,X2) ),
c_0_54,
[final] ).
cnf(c_0_71,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
c_0_55,
[final] ).
cnf(c_0_72,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
c_0_56,
[final] ).
cnf(c_0_73,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
c_0_57,
[final] ).
cnf(c_0_74,plain,
( greater(X1,X2)
| ~ smaller(X2,X1) ),
c_0_58,
[final] ).
cnf(c_0_75,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
c_0_59,
[final] ).
cnf(c_0_76,plain,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
c_0_60,
[final] ).
cnf(c_0_77,plain,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
c_0_61,
[final] ).
cnf(c_0_78,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
c_0_62,
[final] ).
cnf(c_0_79,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
c_0_63,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_64_0,axiom,
( 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))
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_1,axiom,
( ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| greater(capability(X1,X2),capability(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_2,axiom,
( ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| greater(capability(X1,X2),capability(X1,X3))
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_3,axiom,
( ~ organization(X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| greater(capability(X1,X2),capability(X1,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_65_0,axiom,
( 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))
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_1,axiom,
( ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| smaller(capability(X1,X2),capability(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_2,axiom,
( ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| smaller(capability(X1,X2),capability(X1,X3))
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_3,axiom,
( ~ organization(X1)
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| smaller(capability(X1,X2),capability(X1,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_66_0,axiom,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_1,axiom,
( ~ greater(age(X1,X2),age(X1,X3))
| greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_2,axiom,
( ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3))
| greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_67_0,axiom,
( capability(X1,X2) = capability(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_67_1,axiom,
( internal_friction(X1,X2) != internal_friction(X1,X3)
| capability(X1,X2) = capability(X1,X3)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_67_2,axiom,
( stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3)
| capability(X1,X2) = capability(X1,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_67_3,axiom,
( ~ organization(X1)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3)
| capability(X1,X2) = capability(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_68_0,axiom,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_1,axiom,
( ~ greater(X3,X2)
| greater(X1,X2)
| ~ greater(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_2,axiom,
( ~ greater(X1,X3)
| ~ greater(X3,X2)
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_69_0,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_69_1,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_70_0,axiom,
( X1 = X2
| smaller(X1,X2)
| ~ smaller_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_1,axiom,
( smaller(X1,X2)
| X1 = X2
| ~ smaller_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_2,axiom,
( ~ smaller_or_equal(X1,X2)
| smaller(X1,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_71_0,axiom,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_1,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_2,axiom,
( ~ greater_or_equal(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_72_0,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_1,axiom,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_73_0,axiom,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_1,axiom,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_74_0,axiom,
( greater(X1,X2)
| ~ smaller(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_1,axiom,
( ~ smaller(X2,X1)
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_75_0,axiom,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_1,axiom,
( ~ greater(X2,X1)
| smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_76_0,axiom,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_1,axiom,
( ~ organization(X1)
| stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_77_0,axiom,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_1,axiom,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_2,axiom,
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_78_0,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( X1 != X2
| greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
file('<stdin>',lemma_5_39) ).
fof(c_0_1_002,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('<stdin>',lemma_5_38) ).
fof(c_0_2_003,negated_conjecture,
organization(sk1),
file('<stdin>',lemma_5_37) ).
fof(c_0_3_004,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4_005,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
c_0_1 ).
fof(c_0_5_006,negated_conjecture,
organization(sk1),
c_0_2 ).
fof(c_0_6_007,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
c_0_3 ).
fof(c_0_7_008,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
c_0_4 ).
fof(c_0_8_009,negated_conjecture,
organization(sk1),
c_0_5 ).
cnf(c_0_9_010,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_011,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11_012,negated_conjecture,
organization(sk1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12_013,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
c_0_9,
[final] ).
cnf(c_0_13_014,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
c_0_10,
[final] ).
cnf(c_0_14_015,negated_conjecture,
organization(sk1),
c_0_11,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_43,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
file('/export/starexec/sandbox/tmp/iprover_modulo_dca551.p',c_0_12) ).
cnf(c_61,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_73,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_78,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_79,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_214,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_4,plain,
( ~ organization(X0)
| ~ smaller_or_equal(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ greater(internal_friction(X0,X1),internal_friction(X0,X2))
| smaller(capability(X0,X1),capability(X0,X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dca551.p',c_0_65_0) ).
cnf(c_136,plain,
( ~ organization(X0)
| ~ smaller_or_equal(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ greater(internal_friction(X0,X1),internal_friction(X0,X2))
| smaller(capability(X0,X1),capability(X0,X2)) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_137,plain,
( ~ greater(internal_friction(X0,X1),internal_friction(X0,X2))
| ~ smaller_or_equal(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ organization(X0)
| smaller(capability(X0,X1),capability(X0,X2)) ),
inference(rewriting,[status(thm)],[c_136]) ).
cnf(c_232,plain,
( ~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| ~ smaller_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| ~ organization(sk1) ),
inference(resolution,[status(thm)],[c_214,c_137]) ).
cnf(c_233,plain,
( ~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| ~ smaller_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| ~ organization(sk1) ),
inference(rewriting,[status(thm)],[c_232]) ).
cnf(c_45,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox/tmp/iprover_modulo_dca551.p',c_0_14) ).
cnf(c_65,negated_conjecture,
organization(sk1),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_75,negated_conjecture,
organization(sk1),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_76,negated_conjecture,
organization(sk1),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_81,negated_conjecture,
organization(sk1),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_218,negated_conjecture,
organization(sk1),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_279,plain,
( ~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| ~ smaller_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_233,c_218]) ).
cnf(c_280,plain,
( ~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| ~ smaller_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) ),
inference(rewriting,[status(thm)],[c_279]) ).
cnf(c_39,plain,
( X0 != X1
| smaller_or_equal(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dca551.p',c_0_78_0) ).
cnf(c_206,plain,
( X0 != X1
| smaller_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_207,plain,
( smaller_or_equal(X0,X1)
| X0 != X1 ),
inference(rewriting,[status(thm)],[c_206]) ).
cnf(c_283,plain,
( ~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| stock_of_knowledge(sk1,sk3) != stock_of_knowledge(sk1,sk2) ),
inference(resolution,[status(thm)],[c_280,c_207]) ).
cnf(c_286,plain,
( ~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| stock_of_knowledge(sk1,sk3) != stock_of_knowledge(sk1,sk2) ),
inference(rewriting,[status(thm)],[c_283]) ).
cnf(c_34,plain,
( ~ organization(X0)
| stock_of_knowledge(X0,X1) = stock_of_knowledge(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dca551.p',c_0_76_0) ).
cnf(c_196,plain,
( ~ organization(X0)
| stock_of_knowledge(X0,X1) = stock_of_knowledge(X0,X2) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_385,plain,
( ~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| ~ organization(sk1) ),
inference(resolution,[status(thm)],[c_286,c_196]) ).
cnf(c_386,plain,
( ~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| ~ organization(sk1) ),
inference(rewriting,[status(thm)],[c_385]) ).
cnf(c_594,plain,
~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(forward_subsumption_resolution,[status(thm)],[c_386,c_218]) ).
cnf(c_595,plain,
~ greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(rewriting,[status(thm)],[c_594]) ).
cnf(c_8,plain,
( ~ organization(X0)
| ~ greater(age(X0,X1),age(X0,X2))
| greater(internal_friction(X0,X1),internal_friction(X0,X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dca551.p',c_0_66_0) ).
cnf(c_144,plain,
( ~ organization(X0)
| ~ greater(age(X0,X1),age(X0,X2))
| greater(internal_friction(X0,X1),internal_friction(X0,X2)) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_145,plain,
( greater(internal_friction(X0,X1),internal_friction(X0,X2))
| ~ greater(age(X0,X1),age(X0,X2))
| ~ organization(X0) ),
inference(rewriting,[status(thm)],[c_144]) ).
cnf(c_597,plain,
( ~ greater(age(sk1,sk3),age(sk1,sk2))
| ~ organization(sk1) ),
inference(resolution,[status(thm)],[c_595,c_145]) ).
cnf(c_598,plain,
( ~ greater(age(sk1,sk3),age(sk1,sk2))
| ~ organization(sk1) ),
inference(rewriting,[status(thm)],[c_597]) ).
cnf(c_44,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox/tmp/iprover_modulo_dca551.p',c_0_13) ).
cnf(c_63,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_74,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_77,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_80,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_216,plain,
greater(age(sk1,sk3),age(sk1,sk2)),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_607,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_598,c_218,c_216]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT048-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n021.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 10:32:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.13/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.40 % Orientation found
% 0.13/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_785945.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_dca551.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_a36d19 | grep -v "SZS"
% 0.13/0.42
% 0.13/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.13/0.42
% 0.13/0.42 %
% 0.13/0.42 % ------ iProver source info
% 0.13/0.42
% 0.13/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.13/0.42 % git: non_committed_changes: true
% 0.13/0.42 % git: last_make_outside_of_git: true
% 0.13/0.42
% 0.13/0.42 %
% 0.13/0.42 % ------ Input Options
% 0.13/0.42
% 0.13/0.42 % --out_options all
% 0.13/0.42 % --tptp_safe_out true
% 0.13/0.42 % --problem_path ""
% 0.13/0.42 % --include_path ""
% 0.13/0.42 % --clausifier .//eprover
% 0.13/0.42 % --clausifier_options --tstp-format
% 0.13/0.42 % --stdin false
% 0.13/0.42 % --dbg_backtrace false
% 0.13/0.42 % --dbg_dump_prop_clauses false
% 0.13/0.42 % --dbg_dump_prop_clauses_file -
% 0.13/0.42 % --dbg_out_stat false
% 0.13/0.42
% 0.13/0.42 % ------ General Options
% 0.13/0.42
% 0.13/0.42 % --fof false
% 0.13/0.42 % --time_out_real 150.
% 0.13/0.42 % --time_out_prep_mult 0.2
% 0.13/0.42 % --time_out_virtual -1.
% 0.13/0.42 % --schedule none
% 0.13/0.42 % --ground_splitting input
% 0.13/0.42 % --splitting_nvd 16
% 0.13/0.42 % --non_eq_to_eq false
% 0.13/0.42 % --prep_gs_sim true
% 0.13/0.42 % --prep_unflatten false
% 0.13/0.42 % --prep_res_sim true
% 0.13/0.42 % --prep_upred true
% 0.13/0.42 % --res_sim_input true
% 0.13/0.42 % --clause_weak_htbl true
% 0.13/0.42 % --gc_record_bc_elim false
% 0.13/0.42 % --symbol_type_check false
% 0.13/0.42 % --clausify_out false
% 0.13/0.42 % --large_theory_mode false
% 0.13/0.42 % --prep_sem_filter none
% 0.13/0.42 % --prep_sem_filter_out false
% 0.13/0.42 % --preprocessed_out false
% 0.13/0.42 % --sub_typing false
% 0.13/0.42 % --brand_transform false
% 0.13/0.42 % --pure_diseq_elim true
% 0.13/0.42 % --min_unsat_core false
% 0.13/0.42 % --pred_elim true
% 0.13/0.42 % --add_important_lit false
% 0.13/0.42 % --soft_assumptions false
% 0.13/0.42 % --reset_solvers false
% 0.13/0.42 % --bc_imp_inh []
% 0.13/0.42 % --conj_cone_tolerance 1.5
% 0.13/0.42 % --prolific_symb_bound 500
% 0.13/0.42 % --lt_threshold 2000
% 0.13/0.42
% 0.13/0.42 % ------ SAT Options
% 0.13/0.42
% 0.13/0.42 % --sat_mode false
% 0.13/0.42 % --sat_fm_restart_options ""
% 0.13/0.42 % --sat_gr_def false
% 0.13/0.42 % --sat_epr_types true
% 0.13/0.42 % --sat_non_cyclic_types false
% 0.13/0.42 % --sat_finite_models false
% 0.13/0.42 % --sat_fm_lemmas false
% 0.13/0.42 % --sat_fm_prep false
% 0.13/0.42 % --sat_fm_uc_incr true
% 0.13/0.42 % --sat_out_model small
% 0.13/0.42 % --sat_out_clauses false
% 0.13/0.42
% 0.13/0.42 % ------ QBF Options
% 0.13/0.42
% 0.13/0.42 % --qbf_mode false
% 0.13/0.42 % --qbf_elim_univ true
% 0.13/0.42 % --qbf_sk_in true
% 0.13/0.42 % --qbf_pred_elim true
% 0.13/0.42 % --qbf_split 32
% 0.13/0.42
% 0.13/0.42 % ------ BMC1 Options
% 0.13/0.42
% 0.13/0.42 % --bmc1_incremental false
% 0.13/0.42 % --bmc1_axioms reachable_all
% 0.13/0.42 % --bmc1_min_bound 0
% 0.13/0.42 % --bmc1_max_bound -1
% 0.13/0.42 % --bmc1_max_bound_default -1
% 0.13/0.42 % --bmc1_symbol_reachability true
% 0.13/0.42 % --bmc1_property_lemmas false
% 0.13/0.42 % --bmc1_k_induction false
% 0.13/0.42 % --bmc1_non_equiv_states false
% 0.13/0.42 % --bmc1_deadlock false
% 0.13/0.42 % --bmc1_ucm false
% 0.13/0.42 % --bmc1_add_unsat_core none
% 0.13/0.42 % --bmc1_unsat_core_children false
% 0.13/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.13/0.42 % --bmc1_out_stat full
% 0.13/0.42 % --bmc1_ground_init false
% 0.13/0.42 % --bmc1_pre_inst_next_state false
% 0.13/0.42 % --bmc1_pre_inst_state false
% 0.13/0.42 % --bmc1_pre_inst_reach_state false
% 0.13/0.42 % --bmc1_out_unsat_core false
% 0.13/0.42 % --bmc1_aig_witness_out false
% 0.13/0.42 % --bmc1_verbose false
% 0.13/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_785945.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_785945.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: 46
% 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.
% 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.024
% 0.19/0.43 % num_of_symbols: 37
% 0.19/0.43 % num_of_terms: 267
% 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: 37
% 0.19/0.43 % prop_preprocess_simplified: 165
% 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: 45
% 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: 46
% 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: 121
% 0.19/0.43 % res_num_in_passive: 46
% 0.19/0.43 % res_num_in_active: 48
% 0.19/0.43 % res_num_of_loops: 39
% 0.19/0.43 % res_forward_subset_subsumed: 50
% 0.19/0.43 % res_backward_subset_subsumed: 5
% 0.19/0.43 % res_forward_subsumed: 5
% 0.19/0.43 % res_backward_subsumed: 0
% 0.19/0.43 % res_forward_subsumption_resolution: 5
% 0.19/0.43 % res_backward_subsumption_resolution: 0
% 0.19/0.43 % res_clause_to_clause_subsumption: 293
% 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 Unsatisfiable
% 0.19/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------