%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n032.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 03:06:44 EDT 2022
% Result : Unsatisfiable 0.11s 0.39s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 44
% Syntax : Number of formulae : 378 ( 51 unt; 0 def)
% Number of atoms : 1123 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 1378 ( 633 ~; 745 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-1 aty)
% Number of variables : 388 ( 0 sgn 111 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X3,X4,X1] :
( r3least(X1)
| equalish(X2,X3)
| equalish(X2,X4)
| equalish(X3,X4)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
file('<stdin>',clause_25) ).
fof(c_0_1,axiom,
! [X2,X3,X1] :
( equalish(X2,X3)
| ~ e(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ c(X2)
| ~ c(X3) ),
file('<stdin>',clause_6) ).
fof(c_0_2,axiom,
! [X3,X4,X1] :
( f(X1)
| equalish(X3,X4)
| ~ r(X1,X3)
| ~ r(X1,X4)
| ~ d(X3)
| ~ d(X4) ),
file('<stdin>',clause_31) ).
fof(c_0_3,axiom,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| ~ r3least(X1)
| ~ equalish(u1r3(X1),u1r2(X1)) ),
file('<stdin>',clause_14) ).
fof(c_0_4,axiom,
! [X1] :
( e(X1)
| ~ a(u1r1(X1))
| ~ r3least(X1)
| ~ equalish(u1r3(X1),u1r2(X1)) ),
file('<stdin>',clause_9) ).
fof(c_0_5,axiom,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| r(X1,u1r3(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_18) ).
fof(c_0_6,axiom,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| r(X1,u1r2(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_17) ).
fof(c_0_7,axiom,
! [X1] :
( ~ f(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
file('<stdin>',clause_28) ).
fof(c_0_8,axiom,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r3(X1),u2r2(X1)) ),
file('<stdin>',clause_21) ).
fof(c_0_9,axiom,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r3(X1),u2r1(X1)) ),
file('<stdin>',clause_20) ).
fof(c_0_10,axiom,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r2(X1),u2r1(X1)) ),
file('<stdin>',clause_19) ).
fof(c_0_11,axiom,
! [X1] :
( e(X1)
| r(X1,u1r3(X1))
| ~ a(u1r1(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_13) ).
fof(c_0_12,axiom,
! [X1] :
( e(X1)
| r(X1,u1r2(X1))
| ~ a(u1r1(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_12) ).
fof(c_0_13,axiom,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| c(u1r3(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_16) ).
fof(c_0_14,axiom,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| c(u1r2(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_15) ).
fof(c_0_15,axiom,
! [X1] :
( e(X1)
| c(u1r3(X1))
| ~ a(u1r1(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_11) ).
fof(c_0_16,axiom,
! [X1] :
( e(X1)
| c(u1r2(X1))
| ~ a(u1r1(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_10) ).
fof(c_0_17,axiom,
! [X4,X1] :
( a(X4)
| ~ e(X1)
| ~ r(X1,X4) ),
file('<stdin>',clause_8) ).
fof(c_0_18,axiom,
! [X1] :
( r(X1,u3r2(X1))
| ~ f(X1) ),
file('<stdin>',clause_30) ).
fof(c_0_19,axiom,
! [X1] :
( r(X1,u3r1(X1))
| ~ f(X1) ),
file('<stdin>',clause_29) ).
fof(c_0_20,axiom,
! [X1] :
( r(X1,u2r3(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_24) ).
fof(c_0_21,axiom,
! [X1] :
( r(X1,u2r2(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_23) ).
fof(c_0_22,axiom,
! [X1] :
( r(X1,u2r1(X1))
| ~ r3least(X1) ),
file('<stdin>',clause_22) ).
fof(c_0_23,axiom,
! [X1] :
( d(u3r2(X1))
| ~ f(X1) ),
file('<stdin>',clause_27) ).
fof(c_0_24,axiom,
! [X1] :
( d(u3r1(X1))
| ~ f(X1) ),
file('<stdin>',clause_26) ).
fof(c_0_25,axiom,
! [X1] :
( c(X1)
| d(X1)
| ~ a(X1) ),
file('<stdin>',clause_3) ).
fof(c_0_26,axiom,
! [X1] :
( r3least(X1)
| ~ e(X1) ),
file('<stdin>',clause_7) ).
fof(c_0_27,axiom,
! [X1] :
( a(X1)
| ~ c(X1) ),
file('<stdin>',clause_5) ).
fof(c_0_28,axiom,
! [X1] :
( a(X1)
| ~ d(X1) ),
file('<stdin>',clause_4) ).
fof(c_0_29,plain,
! [X2,X3,X4,X1] :
( r3least(X1)
| equalish(X2,X3)
| equalish(X2,X4)
| equalish(X3,X4)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_30,plain,
! [X2,X3,X1] :
( equalish(X2,X3)
| ~ e(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ c(X2)
| ~ c(X3) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_31,plain,
! [X3,X4,X1] :
( f(X1)
| equalish(X3,X4)
| ~ r(X1,X3)
| ~ r(X1,X4)
| ~ d(X3)
| ~ d(X4) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_32,plain,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| ~ r3least(X1)
| ~ equalish(u1r3(X1),u1r2(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_33,plain,
! [X1] :
( e(X1)
| ~ a(u1r1(X1))
| ~ r3least(X1)
| ~ equalish(u1r3(X1),u1r2(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_34,plain,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| r(X1,u1r3(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_35,plain,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| r(X1,u1r2(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_36,plain,
! [X1] :
( ~ f(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_37,plain,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r3(X1),u2r2(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_38,plain,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r3(X1),u2r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_39,plain,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r2(X1),u2r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_40,plain,
! [X1] :
( e(X1)
| r(X1,u1r3(X1))
| ~ a(u1r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_41,plain,
! [X1] :
( e(X1)
| r(X1,u1r2(X1))
| ~ a(u1r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_42,plain,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| c(u1r3(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_43,plain,
! [X1] :
( e(X1)
| r(X1,u1r1(X1))
| c(u1r2(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_44,plain,
! [X1] :
( e(X1)
| c(u1r3(X1))
| ~ a(u1r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_45,plain,
! [X1] :
( e(X1)
| c(u1r2(X1))
| ~ a(u1r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_46,plain,
! [X4,X1] :
( a(X4)
| ~ e(X1)
| ~ r(X1,X4) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_47,plain,
! [X1] :
( r(X1,u3r2(X1))
| ~ f(X1) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_48,plain,
! [X1] :
( r(X1,u3r1(X1))
| ~ f(X1) ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_49,plain,
! [X1] :
( r(X1,u2r3(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_50,plain,
! [X1] :
( r(X1,u2r2(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_51,plain,
! [X1] :
( r(X1,u2r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_52,plain,
! [X1] :
( d(u3r2(X1))
| ~ f(X1) ),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
fof(c_0_53,plain,
! [X1] :
( d(u3r1(X1))
| ~ f(X1) ),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
fof(c_0_54,plain,
! [X1] :
( c(X1)
| d(X1)
| ~ a(X1) ),
inference(fof_simplification,[status(thm)],[c_0_25]) ).
fof(c_0_55,plain,
! [X1] :
( r3least(X1)
| ~ e(X1) ),
inference(fof_simplification,[status(thm)],[c_0_26]) ).
fof(c_0_56,plain,
! [X1] :
( a(X1)
| ~ c(X1) ),
inference(fof_simplification,[status(thm)],[c_0_27]) ).
fof(c_0_57,plain,
! [X1] :
( a(X1)
| ~ d(X1) ),
inference(fof_simplification,[status(thm)],[c_0_28]) ).
fof(c_0_58,plain,
! [X5,X6,X7,X8] :
( r3least(X8)
| equalish(X5,X6)
| equalish(X5,X7)
| equalish(X6,X7)
| ~ r(X8,X5)
| ~ r(X8,X6)
| ~ r(X8,X7) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_59,plain,
! [X4,X5,X6] :
( equalish(X4,X5)
| ~ e(X6)
| ~ r(X6,X4)
| ~ r(X6,X5)
| ~ c(X4)
| ~ c(X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_30])])]) ).
fof(c_0_60,plain,
! [X5,X6,X7] :
( f(X7)
| equalish(X5,X6)
| ~ r(X7,X5)
| ~ r(X7,X6)
| ~ d(X5)
| ~ d(X6) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_61,plain,
! [X2] :
( e(X2)
| r(X2,u1r1(X2))
| ~ r3least(X2)
| ~ equalish(u1r3(X2),u1r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_62,plain,
! [X2] :
( e(X2)
| ~ a(u1r1(X2))
| ~ r3least(X2)
| ~ equalish(u1r3(X2),u1r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_63,plain,
! [X2] :
( e(X2)
| r(X2,u1r1(X2))
| r(X2,u1r3(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_64,plain,
! [X2] :
( e(X2)
| r(X2,u1r1(X2))
| r(X2,u1r2(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_65,plain,
! [X2] :
( ~ f(X2)
| ~ equalish(u3r2(X2),u3r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_66,plain,
! [X2] :
( ~ r3least(X2)
| ~ equalish(u2r3(X2),u2r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_67,plain,
! [X2] :
( ~ r3least(X2)
| ~ equalish(u2r3(X2),u2r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_68,plain,
! [X2] :
( ~ r3least(X2)
| ~ equalish(u2r2(X2),u2r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_69,plain,
! [X2] :
( e(X2)
| r(X2,u1r3(X2))
| ~ a(u1r1(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_70,plain,
! [X2] :
( e(X2)
| r(X2,u1r2(X2))
| ~ a(u1r1(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_71,plain,
! [X2] :
( e(X2)
| r(X2,u1r1(X2))
| c(u1r3(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_72,plain,
! [X2] :
( e(X2)
| r(X2,u1r1(X2))
| c(u1r2(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_73,plain,
! [X2] :
( e(X2)
| c(u1r3(X2))
| ~ a(u1r1(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_44]) ).
fof(c_0_74,plain,
! [X2] :
( e(X2)
| c(u1r2(X2))
| ~ a(u1r1(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_45]) ).
fof(c_0_75,plain,
! [X5,X6] :
( a(X5)
| ~ e(X6)
| ~ r(X6,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_46])])]) ).
fof(c_0_76,plain,
! [X2] :
( r(X2,u3r2(X2))
| ~ f(X2) ),
inference(variable_rename,[status(thm)],[c_0_47]) ).
fof(c_0_77,plain,
! [X2] :
( r(X2,u3r1(X2))
| ~ f(X2) ),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_78,plain,
! [X2] :
( r(X2,u2r3(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_79,plain,
! [X2] :
( r(X2,u2r2(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_50]) ).
fof(c_0_80,plain,
! [X2] :
( r(X2,u2r1(X2))
| ~ r3least(X2) ),
inference(variable_rename,[status(thm)],[c_0_51]) ).
fof(c_0_81,plain,
! [X2] :
( d(u3r2(X2))
| ~ f(X2) ),
inference(variable_rename,[status(thm)],[c_0_52]) ).
fof(c_0_82,plain,
! [X2] :
( d(u3r1(X2))
| ~ f(X2) ),
inference(variable_rename,[status(thm)],[c_0_53]) ).
fof(c_0_83,plain,
! [X2] :
( c(X2)
| d(X2)
| ~ a(X2) ),
inference(variable_rename,[status(thm)],[c_0_54]) ).
fof(c_0_84,plain,
! [X2] :
( r3least(X2)
| ~ e(X2) ),
inference(variable_rename,[status(thm)],[c_0_55]) ).
fof(c_0_85,plain,
! [X2] :
( a(X2)
| ~ c(X2) ),
inference(variable_rename,[status(thm)],[c_0_56]) ).
fof(c_0_86,plain,
! [X2] :
( a(X2)
| ~ d(X2) ),
inference(variable_rename,[status(thm)],[c_0_57]) ).
cnf(c_0_87,plain,
( equalish(X3,X2)
| equalish(X4,X2)
| equalish(X4,X3)
| r3least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_88,plain,
( equalish(X2,X1)
| ~ c(X1)
| ~ c(X2)
| ~ r(X3,X1)
| ~ r(X3,X2)
| ~ e(X3) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_89,plain,
( equalish(X2,X1)
| f(X3)
| ~ d(X1)
| ~ d(X2)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_90,plain,
( r(X1,u1r1(X1))
| e(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_91,plain,
( e(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_92,plain,
( r(X1,u1r3(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_93,plain,
( r(X1,u1r2(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_94,plain,
( ~ equalish(u3r2(X1),u3r1(X1))
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_95,plain,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_96,plain,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_97,plain,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_98,plain,
( r(X1,u1r3(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_99,plain,
( r(X1,u1r2(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_100,plain,
( c(u1r3(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_101,plain,
( c(u1r2(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_102,plain,
( c(u1r3(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_103,plain,
( c(u1r2(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_104,plain,
( a(X2)
| ~ r(X1,X2)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_105,plain,
( r(X1,u3r2(X1))
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_106,plain,
( r(X1,u3r1(X1))
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_107,plain,
( r(X1,u2r3(X1))
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_108,plain,
( r(X1,u2r2(X1))
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_109,plain,
( r(X1,u2r1(X1))
| ~ r3least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_110,plain,
( d(u3r2(X1))
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_111,plain,
( d(u3r1(X1))
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_112,plain,
( d(X1)
| c(X1)
| ~ a(X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_113,plain,
( r3least(X1)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_114,plain,
( a(X1)
| ~ c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_115,plain,
( a(X1)
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_116,plain,
( equalish(X3,X2)
| equalish(X4,X2)
| equalish(X4,X3)
| r3least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
c_0_87,
[final] ).
cnf(c_0_117,plain,
( equalish(X2,X1)
| ~ c(X1)
| ~ c(X2)
| ~ r(X3,X1)
| ~ r(X3,X2)
| ~ e(X3) ),
c_0_88,
[final] ).
cnf(c_0_118,plain,
( equalish(X2,X1)
| f(X3)
| ~ d(X1)
| ~ d(X2)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
c_0_89,
[final] ).
cnf(c_0_119,plain,
( r(X1,u1r1(X1))
| e(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1) ),
c_0_90,
[final] ).
cnf(c_0_120,plain,
( e(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
c_0_91,
[final] ).
cnf(c_0_121,plain,
( r(X1,u1r3(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
c_0_92,
[final] ).
cnf(c_0_122,plain,
( r(X1,u1r2(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
c_0_93,
[final] ).
cnf(c_0_123,plain,
( ~ equalish(u3r2(X1),u3r1(X1))
| ~ f(X1) ),
c_0_94,
[final] ).
cnf(c_0_124,plain,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
c_0_95,
[final] ).
cnf(c_0_125,plain,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
c_0_96,
[final] ).
cnf(c_0_126,plain,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
c_0_97,
[final] ).
cnf(c_0_127,plain,
( r(X1,u1r3(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
c_0_98,
[final] ).
cnf(c_0_128,plain,
( r(X1,u1r2(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
c_0_99,
[final] ).
cnf(c_0_129,plain,
( c(u1r3(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
c_0_100,
[final] ).
cnf(c_0_130,plain,
( c(u1r2(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
c_0_101,
[final] ).
cnf(c_0_131,plain,
( c(u1r3(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
c_0_102,
[final] ).
cnf(c_0_132,plain,
( c(u1r2(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
c_0_103,
[final] ).
cnf(c_0_133,plain,
( a(X2)
| ~ r(X1,X2)
| ~ e(X1) ),
c_0_104,
[final] ).
cnf(c_0_134,plain,
( r(X1,u3r2(X1))
| ~ f(X1) ),
c_0_105,
[final] ).
cnf(c_0_135,plain,
( r(X1,u3r1(X1))
| ~ f(X1) ),
c_0_106,
[final] ).
cnf(c_0_136,plain,
( r(X1,u2r3(X1))
| ~ r3least(X1) ),
c_0_107,
[final] ).
cnf(c_0_137,plain,
( r(X1,u2r2(X1))
| ~ r3least(X1) ),
c_0_108,
[final] ).
cnf(c_0_138,plain,
( r(X1,u2r1(X1))
| ~ r3least(X1) ),
c_0_109,
[final] ).
cnf(c_0_139,plain,
( d(u3r2(X1))
| ~ f(X1) ),
c_0_110,
[final] ).
cnf(c_0_140,plain,
( d(u3r1(X1))
| ~ f(X1) ),
c_0_111,
[final] ).
cnf(c_0_141,plain,
( d(X1)
| c(X1)
| ~ a(X1) ),
c_0_112,
[final] ).
cnf(c_0_142,plain,
( r3least(X1)
| ~ e(X1) ),
c_0_113,
[final] ).
cnf(c_0_143,plain,
( a(X1)
| ~ c(X1) ),
c_0_114,
[final] ).
cnf(c_0_144,plain,
( a(X1)
| ~ d(X1) ),
c_0_115,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_116_0,axiom,
( equalish(X3,X2)
| equalish(X4,X2)
| equalish(X4,X3)
| r3least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_1,axiom,
( equalish(X4,X2)
| equalish(X3,X2)
| equalish(X4,X3)
| r3least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_2,axiom,
( equalish(X4,X3)
| equalish(X4,X2)
| equalish(X3,X2)
| r3least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_3,axiom,
( r3least(X1)
| equalish(X4,X3)
| equalish(X4,X2)
| equalish(X3,X2)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_4,axiom,
( ~ r(X1,X2)
| r3least(X1)
| equalish(X4,X3)
| equalish(X4,X2)
| equalish(X3,X2)
| ~ r(X1,X3)
| ~ r(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_5,axiom,
( ~ r(X1,X3)
| ~ r(X1,X2)
| r3least(X1)
| equalish(X4,X3)
| equalish(X4,X2)
| equalish(X3,X2)
| ~ r(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_6,axiom,
( ~ r(X1,X4)
| ~ r(X1,X3)
| ~ r(X1,X2)
| r3least(X1)
| equalish(X4,X3)
| equalish(X4,X2)
| equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_117_0,axiom,
( equalish(X2,X1)
| ~ c(X1)
| ~ c(X2)
| ~ r(X3,X1)
| ~ r(X3,X2)
| ~ e(X3) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_1,axiom,
( ~ c(X1)
| equalish(X2,X1)
| ~ c(X2)
| ~ r(X3,X1)
| ~ r(X3,X2)
| ~ e(X3) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_2,axiom,
( ~ c(X2)
| ~ c(X1)
| equalish(X2,X1)
| ~ r(X3,X1)
| ~ r(X3,X2)
| ~ e(X3) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_3,axiom,
( ~ r(X3,X1)
| ~ c(X2)
| ~ c(X1)
| equalish(X2,X1)
| ~ r(X3,X2)
| ~ e(X3) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_4,axiom,
( ~ r(X3,X2)
| ~ r(X3,X1)
| ~ c(X2)
| ~ c(X1)
| equalish(X2,X1)
| ~ e(X3) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_5,axiom,
( ~ e(X3)
| ~ r(X3,X2)
| ~ r(X3,X1)
| ~ c(X2)
| ~ c(X1)
| equalish(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_118_0,axiom,
( equalish(X2,X1)
| f(X3)
| ~ d(X1)
| ~ d(X2)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_1,axiom,
( f(X3)
| equalish(X2,X1)
| ~ d(X1)
| ~ d(X2)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_2,axiom,
( ~ d(X1)
| f(X3)
| equalish(X2,X1)
| ~ d(X2)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_3,axiom,
( ~ d(X2)
| ~ d(X1)
| f(X3)
| equalish(X2,X1)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_4,axiom,
( ~ r(X3,X1)
| ~ d(X2)
| ~ d(X1)
| f(X3)
| equalish(X2,X1)
| ~ r(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_5,axiom,
( ~ r(X3,X2)
| ~ r(X3,X1)
| ~ d(X2)
| ~ d(X1)
| f(X3)
| equalish(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_119_0,axiom,
( r(X1,u1r1(X1))
| e(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_1,axiom,
( e(X1)
| r(X1,u1r1(X1))
| ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_2,axiom,
( ~ equalish(u1r3(X1),u1r2(X1))
| e(X1)
| r(X1,u1r1(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_3,axiom,
( ~ r3least(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| e(X1)
| r(X1,u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_120_0,axiom,
( e(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_1,axiom,
( ~ equalish(u1r3(X1),u1r2(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_2,axiom,
( ~ r3least(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| e(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_3,axiom,
( ~ a(u1r1(X1))
| ~ r3least(X1)
| ~ equalish(u1r3(X1),u1r2(X1))
| e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_121_0,axiom,
( r(X1,u1r3(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_1,axiom,
( r(X1,u1r1(X1))
| r(X1,u1r3(X1))
| e(X1)
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_2,axiom,
( e(X1)
| r(X1,u1r1(X1))
| r(X1,u1r3(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_3,axiom,
( ~ r3least(X1)
| e(X1)
| r(X1,u1r1(X1))
| r(X1,u1r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_122_0,axiom,
( r(X1,u1r2(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_1,axiom,
( r(X1,u1r1(X1))
| r(X1,u1r2(X1))
| e(X1)
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_2,axiom,
( e(X1)
| r(X1,u1r1(X1))
| r(X1,u1r2(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_3,axiom,
( ~ r3least(X1)
| e(X1)
| r(X1,u1r1(X1))
| r(X1,u1r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_123_0,axiom,
( ~ equalish(u3r2(X1),u3r1(X1))
| ~ f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_123_1,axiom,
( ~ f(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_124_0,axiom,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_124_1,axiom,
( ~ r3least(X1)
| ~ equalish(u2r3(X1),u2r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_125_0,axiom,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_1,axiom,
( ~ r3least(X1)
| ~ equalish(u2r3(X1),u2r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_126_0,axiom,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_126_1,axiom,
( ~ r3least(X1)
| ~ equalish(u2r2(X1),u2r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_127_0,axiom,
( r(X1,u1r3(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_1,axiom,
( e(X1)
| r(X1,u1r3(X1))
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_2,axiom,
( ~ r3least(X1)
| e(X1)
| r(X1,u1r3(X1))
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_3,axiom,
( ~ a(u1r1(X1))
| ~ r3least(X1)
| e(X1)
| r(X1,u1r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_128_0,axiom,
( r(X1,u1r2(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_128_1,axiom,
( e(X1)
| r(X1,u1r2(X1))
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_128_2,axiom,
( ~ r3least(X1)
| e(X1)
| r(X1,u1r2(X1))
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_128_3,axiom,
( ~ a(u1r1(X1))
| ~ r3least(X1)
| e(X1)
| r(X1,u1r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_129_0,axiom,
( c(u1r3(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_129_1,axiom,
( r(X1,u1r1(X1))
| c(u1r3(X1))
| e(X1)
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_129_2,axiom,
( e(X1)
| r(X1,u1r1(X1))
| c(u1r3(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_129_3,axiom,
( ~ r3least(X1)
| e(X1)
| r(X1,u1r1(X1))
| c(u1r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_130_0,axiom,
( c(u1r2(X1))
| r(X1,u1r1(X1))
| e(X1)
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_130]) ).
cnf(c_0_130_1,axiom,
( r(X1,u1r1(X1))
| c(u1r2(X1))
| e(X1)
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_130]) ).
cnf(c_0_130_2,axiom,
( e(X1)
| r(X1,u1r1(X1))
| c(u1r2(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_130]) ).
cnf(c_0_130_3,axiom,
( ~ r3least(X1)
| e(X1)
| r(X1,u1r1(X1))
| c(u1r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_130]) ).
cnf(c_0_131_0,axiom,
( c(u1r3(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_131]) ).
cnf(c_0_131_1,axiom,
( e(X1)
| c(u1r3(X1))
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_131]) ).
cnf(c_0_131_2,axiom,
( ~ r3least(X1)
| e(X1)
| c(u1r3(X1))
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_131]) ).
cnf(c_0_131_3,axiom,
( ~ a(u1r1(X1))
| ~ r3least(X1)
| e(X1)
| c(u1r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_131]) ).
cnf(c_0_132_0,axiom,
( c(u1r2(X1))
| e(X1)
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_132_1,axiom,
( e(X1)
| c(u1r2(X1))
| ~ r3least(X1)
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_132_2,axiom,
( ~ r3least(X1)
| e(X1)
| c(u1r2(X1))
| ~ a(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_132_3,axiom,
( ~ a(u1r1(X1))
| ~ r3least(X1)
| e(X1)
| c(u1r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_133_0,axiom,
( a(X2)
| ~ r(X1,X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_133]) ).
cnf(c_0_133_1,axiom,
( ~ r(X1,X2)
| a(X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_133]) ).
cnf(c_0_133_2,axiom,
( ~ e(X1)
| ~ r(X1,X2)
| a(X2) ),
inference(literals_permutation,[status(thm)],[c_0_133]) ).
cnf(c_0_134_0,axiom,
( r(X1,u3r2(X1))
| ~ f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_134_1,axiom,
( ~ f(X1)
| r(X1,u3r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_135_0,axiom,
( r(X1,u3r1(X1))
| ~ f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_135_1,axiom,
( ~ f(X1)
| r(X1,u3r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_136_0,axiom,
( r(X1,u2r3(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_1,axiom,
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_137_0,axiom,
( r(X1,u2r2(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_1,axiom,
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_138_0,axiom,
( r(X1,u2r1(X1))
| ~ r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_138_1,axiom,
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_139_0,axiom,
( d(u3r2(X1))
| ~ f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_139_1,axiom,
( ~ f(X1)
| d(u3r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_140_0,axiom,
( d(u3r1(X1))
| ~ f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_140_1,axiom,
( ~ f(X1)
| d(u3r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_141_0,axiom,
( d(X1)
| c(X1)
| ~ a(X1) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_141_1,axiom,
( c(X1)
| d(X1)
| ~ a(X1) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_141_2,axiom,
( ~ a(X1)
| c(X1)
| d(X1) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_142_0,axiom,
( r3least(X1)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_1,axiom,
( ~ e(X1)
| r3least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_143_0,axiom,
( a(X1)
| ~ c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_143_1,axiom,
( ~ c(X1)
| a(X1) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_144_0,axiom,
( a(X1)
| ~ d(X1) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_144_1,axiom,
( ~ d(X1)
| a(X1) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
~ f(exist),
file('<stdin>',clause_2) ).
fof(c_0_1_002,negated_conjecture,
e(exist),
file('<stdin>',clause_1) ).
fof(c_0_2_003,negated_conjecture,
~ f(exist),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_004,negated_conjecture,
e(exist),
c_0_1 ).
fof(c_0_4_005,negated_conjecture,
~ f(exist),
c_0_2 ).
fof(c_0_5_006,negated_conjecture,
e(exist),
c_0_3 ).
cnf(c_0_6_007,negated_conjecture,
~ f(exist),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,negated_conjecture,
e(exist),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
~ f(exist),
c_0_6,
[final] ).
cnf(c_0_9_010,negated_conjecture,
e(exist),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_94,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_9) ).
cnf(c_111,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_118,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_111]) ).
cnf(c_119,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_122,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_119]) ).
cnf(c_406,plain,
e(exist),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_4,plain,
( r3least(X0)
| ~ e(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_142_1) ).
cnf(c_226,plain,
( r3least(X0)
| ~ e(X0) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_227,plain,
( ~ e(X0)
| r3least(X0) ),
inference(rewriting,[status(thm)],[c_226]) ).
cnf(c_410,plain,
r3least(exist),
inference(resolution,[status(thm)],[c_406,c_227]) ).
cnf(c_411,plain,
r3least(exist),
inference(rewriting,[status(thm)],[c_410]) ).
cnf(c_17,plain,
( r(X0,u2r3(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_136_1) ).
cnf(c_252,plain,
( r(X0,u2r3(X0))
| ~ r3least(X0) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_253,plain,
( ~ r3least(X0)
| r(X0,u2r3(X0)) ),
inference(rewriting,[status(thm)],[c_252]) ).
cnf(c_428,plain,
r(exist,u2r3(exist)),
inference(resolution,[status(thm)],[c_411,c_253]) ).
cnf(c_433,plain,
r(exist,u2r3(exist)),
inference(rewriting,[status(thm)],[c_428]) ).
cnf(c_23,plain,
( a(X0)
| ~ r(X1,X0)
| ~ e(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_133_2) ).
cnf(c_264,plain,
( a(X0)
| ~ r(X1,X0)
| ~ e(X1) ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_265,plain,
( a(X0)
| ~ e(X1)
| ~ r(X1,X0) ),
inference(rewriting,[status(thm)],[c_264]) ).
cnf(c_412,plain,
( a(X0)
| ~ r(exist,X0) ),
inference(resolution,[status(thm)],[c_406,c_265]) ).
cnf(c_413,plain,
( a(X0)
| ~ r(exist,X0) ),
inference(rewriting,[status(thm)],[c_412]) ).
cnf(c_510,plain,
a(u2r3(exist)),
inference(resolution,[status(thm)],[c_433,c_413]) ).
cnf(c_511,plain,
a(u2r3(exist)),
inference(rewriting,[status(thm)],[c_510]) ).
cnf(c_6,plain,
( d(X0)
| c(X0)
| ~ a(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_141_2) ).
cnf(c_230,plain,
( d(X0)
| c(X0)
| ~ a(X0) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_231,plain,
( d(X0)
| ~ a(X0)
| c(X0) ),
inference(rewriting,[status(thm)],[c_230]) ).
cnf(c_514,plain,
( d(u2r3(exist))
| c(u2r3(exist)) ),
inference(resolution,[status(thm)],[c_511,c_231]) ).
cnf(c_515,plain,
( d(u2r3(exist))
| c(u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_514]) ).
cnf(c_52,plain,
( ~ equalish(u2r3(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_125_1) ).
cnf(c_322,plain,
( ~ equalish(u2r3(X0),u2r1(X0))
| ~ r3least(X0) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_323,plain,
( ~ r3least(X0)
| ~ equalish(u2r3(X0),u2r1(X0)) ),
inference(rewriting,[status(thm)],[c_322]) ).
cnf(c_424,plain,
~ equalish(u2r3(exist),u2r1(exist)),
inference(resolution,[status(thm)],[c_411,c_323]) ).
cnf(c_437,plain,
~ equalish(u2r3(exist),u2r1(exist)),
inference(rewriting,[status(thm)],[c_424]) ).
cnf(c_80,plain,
( equalish(X0,X1)
| ~ c(X1)
| ~ c(X0)
| ~ r(X2,X1)
| ~ r(X2,X0)
| ~ e(X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_117_5) ).
cnf(c_378,plain,
( equalish(X0,X1)
| ~ c(X1)
| ~ c(X0)
| ~ r(X2,X1)
| ~ r(X2,X0)
| ~ e(X2) ),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_379,plain,
( ~ c(X0)
| ~ c(X1)
| ~ e(X2)
| ~ r(X2,X0)
| ~ r(X2,X1)
| equalish(X1,X0) ),
inference(rewriting,[status(thm)],[c_378]) ).
cnf(c_414,plain,
( ~ c(X0)
| ~ c(X1)
| ~ r(exist,X0)
| ~ r(exist,X1)
| equalish(X1,X0) ),
inference(resolution,[status(thm)],[c_406,c_379]) ).
cnf(c_415,plain,
( ~ c(X0)
| ~ c(X1)
| ~ r(exist,X0)
| ~ r(exist,X1)
| equalish(X1,X0) ),
inference(rewriting,[status(thm)],[c_414]) ).
cnf(c_530,plain,
( ~ c(u2r1(exist))
| ~ c(u2r3(exist))
| ~ r(exist,u2r1(exist))
| ~ r(exist,u2r3(exist)) ),
inference(resolution,[status(thm)],[c_437,c_415]) ).
cnf(c_531,plain,
( ~ c(u2r1(exist))
| ~ c(u2r3(exist))
| ~ r(exist,u2r1(exist))
| ~ r(exist,u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_530]) ).
cnf(c_13,plain,
( r(X0,u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_138_1) ).
cnf(c_244,plain,
( r(X0,u2r1(X0))
| ~ r3least(X0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_245,plain,
( ~ r3least(X0)
| r(X0,u2r1(X0)) ),
inference(rewriting,[status(thm)],[c_244]) ).
cnf(c_430,plain,
r(exist,u2r1(exist)),
inference(resolution,[status(thm)],[c_411,c_245]) ).
cnf(c_431,plain,
r(exist,u2r1(exist)),
inference(rewriting,[status(thm)],[c_430]) ).
cnf(c_601,plain,
( ~ c(u2r1(exist))
| ~ c(u2r3(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_531,c_433,c_431]) ).
cnf(c_602,plain,
( ~ c(u2r1(exist))
| ~ c(u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_601]) ).
cnf(c_640,plain,
( d(u2r3(exist))
| ~ c(u2r1(exist)) ),
inference(resolution,[status(thm)],[c_515,c_602]) ).
cnf(c_641,plain,
( d(u2r3(exist))
| ~ c(u2r1(exist)) ),
inference(rewriting,[status(thm)],[c_640]) ).
cnf(c_470,plain,
a(u2r1(exist)),
inference(resolution,[status(thm)],[c_431,c_413]) ).
cnf(c_471,plain,
a(u2r1(exist)),
inference(rewriting,[status(thm)],[c_470]) ).
cnf(c_474,plain,
( d(u2r1(exist))
| c(u2r1(exist)) ),
inference(resolution,[status(thm)],[c_471,c_231]) ).
cnf(c_475,plain,
( d(u2r1(exist))
| c(u2r1(exist)) ),
inference(rewriting,[status(thm)],[c_474]) ).
cnf(c_832,plain,
( d(u2r1(exist))
| d(u2r3(exist)) ),
inference(resolution,[status(thm)],[c_641,c_475]) ).
cnf(c_833,plain,
( d(u2r1(exist))
| d(u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_832]) ).
cnf(c_15,plain,
( r(X0,u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_137_1) ).
cnf(c_248,plain,
( r(X0,u2r2(X0))
| ~ r3least(X0) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_249,plain,
( ~ r3least(X0)
| r(X0,u2r2(X0)) ),
inference(rewriting,[status(thm)],[c_248]) ).
cnf(c_429,plain,
r(exist,u2r2(exist)),
inference(resolution,[status(thm)],[c_411,c_249]) ).
cnf(c_432,plain,
r(exist,u2r2(exist)),
inference(rewriting,[status(thm)],[c_429]) ).
cnf(c_74,plain,
( equalish(X0,X1)
| f(X2)
| ~ d(X1)
| ~ d(X0)
| ~ r(X2,X1)
| ~ r(X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_118_5) ).
cnf(c_366,plain,
( equalish(X0,X1)
| f(X2)
| ~ d(X1)
| ~ d(X0)
| ~ r(X2,X1)
| ~ r(X2,X0) ),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_367,plain,
( ~ d(X0)
| ~ d(X1)
| f(X2)
| ~ r(X2,X0)
| ~ r(X2,X1)
| equalish(X1,X0) ),
inference(rewriting,[status(thm)],[c_366]) ).
cnf(c_478,plain,
( ~ d(u2r2(exist))
| ~ d(X0)
| f(exist)
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ),
inference(resolution,[status(thm)],[c_432,c_367]) ).
cnf(c_479,plain,
( ~ d(u2r2(exist))
| ~ d(X0)
| f(exist)
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_478]) ).
cnf(c_93,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_8) ).
cnf(c_109,negated_conjecture,
~ f(exist),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_117,negated_conjecture,
~ f(exist),
inference(copy,[status(esa)],[c_109]) ).
cnf(c_120,negated_conjecture,
~ f(exist),
inference(copy,[status(esa)],[c_117]) ).
cnf(c_121,negated_conjecture,
~ f(exist),
inference(copy,[status(esa)],[c_120]) ).
cnf(c_404,negated_conjecture,
~ f(exist),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_582,plain,
( ~ d(u2r2(exist))
| ~ d(X0)
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_479,c_404]) ).
cnf(c_583,plain,
( ~ d(u2r2(exist))
| ~ d(X0)
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_582]) ).
cnf(c_54,plain,
( ~ equalish(u2r3(X0),u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_124_1) ).
cnf(c_326,plain,
( ~ equalish(u2r3(X0),u2r2(X0))
| ~ r3least(X0) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_327,plain,
( ~ r3least(X0)
| ~ equalish(u2r3(X0),u2r2(X0)) ),
inference(rewriting,[status(thm)],[c_326]) ).
cnf(c_423,plain,
~ equalish(u2r3(exist),u2r2(exist)),
inference(resolution,[status(thm)],[c_411,c_327]) ).
cnf(c_438,plain,
~ equalish(u2r3(exist),u2r2(exist)),
inference(rewriting,[status(thm)],[c_423]) ).
cnf(c_588,plain,
( ~ d(u2r2(exist))
| ~ d(u2r3(exist))
| ~ r(exist,u2r3(exist)) ),
inference(resolution,[status(thm)],[c_583,c_438]) ).
cnf(c_589,plain,
( ~ d(u2r2(exist))
| ~ d(u2r3(exist))
| ~ r(exist,u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_588]) ).
cnf(c_593,plain,
( ~ d(u2r2(exist))
| ~ d(u2r3(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_589,c_433]) ).
cnf(c_594,plain,
( ~ d(u2r2(exist))
| ~ d(u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_593]) ).
cnf(c_858,plain,
( d(u2r1(exist))
| ~ d(u2r2(exist)) ),
inference(resolution,[status(thm)],[c_833,c_594]) ).
cnf(c_861,plain,
( d(u2r1(exist))
| ~ d(u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_858]) ).
cnf(c_458,plain,
( ~ d(u2r1(exist))
| ~ d(X0)
| f(exist)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(resolution,[status(thm)],[c_431,c_367]) ).
cnf(c_459,plain,
( ~ d(u2r1(exist))
| ~ d(X0)
| f(exist)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(rewriting,[status(thm)],[c_458]) ).
cnf(c_553,plain,
( ~ d(u2r1(exist))
| ~ d(X0)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_459,c_404]) ).
cnf(c_554,plain,
( ~ d(u2r1(exist))
| ~ d(X0)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(rewriting,[status(thm)],[c_553]) ).
cnf(c_50,plain,
( ~ equalish(u2r2(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p',c_0_126_1) ).
cnf(c_318,plain,
( ~ equalish(u2r2(X0),u2r1(X0))
| ~ r3least(X0) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_319,plain,
( ~ r3least(X0)
| ~ equalish(u2r2(X0),u2r1(X0)) ),
inference(rewriting,[status(thm)],[c_318]) ).
cnf(c_425,plain,
~ equalish(u2r2(exist),u2r1(exist)),
inference(resolution,[status(thm)],[c_411,c_319]) ).
cnf(c_436,plain,
~ equalish(u2r2(exist),u2r1(exist)),
inference(rewriting,[status(thm)],[c_425]) ).
cnf(c_561,plain,
( ~ d(u2r1(exist))
| ~ d(u2r2(exist))
| ~ r(exist,u2r2(exist)) ),
inference(resolution,[status(thm)],[c_554,c_436]) ).
cnf(c_562,plain,
( ~ d(u2r1(exist))
| ~ d(u2r2(exist))
| ~ r(exist,u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_561]) ).
cnf(c_573,plain,
( ~ d(u2r1(exist))
| ~ d(u2r2(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_562,c_432]) ).
cnf(c_574,plain,
( ~ d(u2r1(exist))
| ~ d(u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_573]) ).
cnf(c_876,plain,
~ d(u2r2(exist)),
inference(forward_subsumption_resolution,[status(thm)],[c_861,c_574]) ).
cnf(c_877,plain,
~ d(u2r2(exist)),
inference(rewriting,[status(thm)],[c_876]) ).
cnf(c_490,plain,
a(u2r2(exist)),
inference(resolution,[status(thm)],[c_432,c_413]) ).
cnf(c_491,plain,
a(u2r2(exist)),
inference(rewriting,[status(thm)],[c_490]) ).
cnf(c_494,plain,
( d(u2r2(exist))
| c(u2r2(exist)) ),
inference(resolution,[status(thm)],[c_491,c_231]) ).
cnf(c_495,plain,
( d(u2r2(exist))
| c(u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_494]) ).
cnf(c_522,plain,
( ~ c(u2r1(exist))
| ~ c(u2r2(exist))
| ~ r(exist,u2r1(exist))
| ~ r(exist,u2r2(exist)) ),
inference(resolution,[status(thm)],[c_436,c_415]) ).
cnf(c_523,plain,
( ~ c(u2r1(exist))
| ~ c(u2r2(exist))
| ~ r(exist,u2r1(exist))
| ~ r(exist,u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_522]) ).
cnf(c_544,plain,
( ~ c(u2r1(exist))
| ~ c(u2r2(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_523,c_432,c_431]) ).
cnf(c_545,plain,
( ~ c(u2r1(exist))
| ~ c(u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_544]) ).
cnf(c_629,plain,
( d(u2r2(exist))
| ~ c(u2r1(exist)) ),
inference(resolution,[status(thm)],[c_495,c_545]) ).
cnf(c_630,plain,
( d(u2r2(exist))
| ~ c(u2r1(exist)) ),
inference(rewriting,[status(thm)],[c_629]) ).
cnf(c_826,plain,
( d(u2r1(exist))
| d(u2r2(exist)) ),
inference(resolution,[status(thm)],[c_630,c_475]) ).
cnf(c_827,plain,
( d(u2r1(exist))
| d(u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_826]) ).
cnf(c_882,plain,
d(u2r1(exist)),
inference(backward_subsumption_resolution,[status(thm)],[c_877,c_827]) ).
cnf(c_883,plain,
d(u2r1(exist)),
inference(rewriting,[status(thm)],[c_882]) ).
cnf(c_538,plain,
( ~ c(u2r2(exist))
| ~ c(u2r3(exist))
| ~ r(exist,u2r2(exist))
| ~ r(exist,u2r3(exist)) ),
inference(resolution,[status(thm)],[c_438,c_415]) ).
cnf(c_539,plain,
( ~ c(u2r2(exist))
| ~ c(u2r3(exist))
| ~ r(exist,u2r2(exist))
| ~ r(exist,u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_538]) ).
cnf(c_609,plain,
( ~ c(u2r2(exist))
| ~ c(u2r3(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_539,c_433,c_432]) ).
cnf(c_610,plain,
( ~ c(u2r2(exist))
| ~ c(u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_609]) ).
cnf(c_639,plain,
( d(u2r3(exist))
| ~ c(u2r2(exist)) ),
inference(resolution,[status(thm)],[c_515,c_610]) ).
cnf(c_642,plain,
( d(u2r3(exist))
| ~ c(u2r2(exist)) ),
inference(rewriting,[status(thm)],[c_639]) ).
cnf(c_838,plain,
( d(u2r2(exist))
| d(u2r3(exist)) ),
inference(resolution,[status(thm)],[c_642,c_495]) ).
cnf(c_839,plain,
( d(u2r2(exist))
| d(u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_838]) ).
cnf(c_879,plain,
d(u2r3(exist)),
inference(backward_subsumption_resolution,[status(thm)],[c_877,c_839]) ).
cnf(c_886,plain,
d(u2r3(exist)),
inference(rewriting,[status(thm)],[c_879]) ).
cnf(c_559,plain,
( ~ d(u2r1(exist))
| ~ d(u2r3(exist))
| ~ r(exist,u2r3(exist)) ),
inference(resolution,[status(thm)],[c_554,c_437]) ).
cnf(c_560,plain,
( ~ d(u2r1(exist))
| ~ d(u2r3(exist))
| ~ r(exist,u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_559]) ).
cnf(c_566,plain,
( ~ d(u2r1(exist))
| ~ d(u2r3(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_560,c_433]) ).
cnf(c_567,plain,
( ~ d(u2r1(exist))
| ~ d(u2r3(exist)) ),
inference(rewriting,[status(thm)],[c_566]) ).
cnf(c_902,plain,
~ d(u2r1(exist)),
inference(backward_subsumption_resolution,[status(thm)],[c_886,c_567]) ).
cnf(c_903,plain,
~ d(u2r1(exist)),
inference(rewriting,[status(thm)],[c_902]) ).
cnf(c_918,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_883,c_903]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.08 % Command : iprover_modulo %s %d
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Tue Jun 7 07:12:35 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.07/0.27 % Running in mono-core mode
% 0.11/0.31 % Orienting using strategy Equiv(ClausalAll)
% 0.11/0.31 % Orientation found
% 0.11/0.31 % 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_e57283.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c7899b | grep -v "SZS"
% 0.11/0.32
% 0.11/0.32 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.11/0.32
% 0.11/0.32 %
% 0.11/0.32 % ------ iProver source info
% 0.11/0.32
% 0.11/0.32 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.11/0.32 % git: non_committed_changes: true
% 0.11/0.32 % git: last_make_outside_of_git: true
% 0.11/0.32
% 0.11/0.32 %
% 0.11/0.32 % ------ Input Options
% 0.11/0.32
% 0.11/0.32 % --out_options all
% 0.11/0.32 % --tptp_safe_out true
% 0.11/0.32 % --problem_path ""
% 0.11/0.32 % --include_path ""
% 0.11/0.32 % --clausifier .//eprover
% 0.11/0.32 % --clausifier_options --tstp-format
% 0.11/0.32 % --stdin false
% 0.11/0.32 % --dbg_backtrace false
% 0.11/0.32 % --dbg_dump_prop_clauses false
% 0.11/0.32 % --dbg_dump_prop_clauses_file -
% 0.11/0.32 % --dbg_out_stat false
% 0.11/0.32
% 0.11/0.32 % ------ General Options
% 0.11/0.32
% 0.11/0.32 % --fof false
% 0.11/0.32 % --time_out_real 150.
% 0.11/0.32 % --time_out_prep_mult 0.2
% 0.11/0.32 % --time_out_virtual -1.
% 0.11/0.32 % --schedule none
% 0.11/0.32 % --ground_splitting input
% 0.11/0.32 % --splitting_nvd 16
% 0.11/0.32 % --non_eq_to_eq false
% 0.11/0.32 % --prep_gs_sim true
% 0.11/0.32 % --prep_unflatten false
% 0.11/0.32 % --prep_res_sim true
% 0.11/0.32 % --prep_upred true
% 0.11/0.32 % --res_sim_input true
% 0.11/0.32 % --clause_weak_htbl true
% 0.11/0.32 % --gc_record_bc_elim false
% 0.11/0.32 % --symbol_type_check false
% 0.11/0.32 % --clausify_out false
% 0.11/0.32 % --large_theory_mode false
% 0.11/0.32 % --prep_sem_filter none
% 0.11/0.32 % --prep_sem_filter_out false
% 0.11/0.32 % --preprocessed_out false
% 0.11/0.32 % --sub_typing false
% 0.11/0.32 % --brand_transform false
% 0.11/0.32 % --pure_diseq_elim true
% 0.11/0.32 % --min_unsat_core false
% 0.11/0.32 % --pred_elim true
% 0.11/0.32 % --add_important_lit false
% 0.11/0.32 % --soft_assumptions false
% 0.11/0.32 % --reset_solvers false
% 0.11/0.32 % --bc_imp_inh []
% 0.11/0.32 % --conj_cone_tolerance 1.5
% 0.11/0.32 % --prolific_symb_bound 500
% 0.11/0.32 % --lt_threshold 2000
% 0.11/0.32
% 0.11/0.32 % ------ SAT Options
% 0.11/0.32
% 0.11/0.32 % --sat_mode false
% 0.11/0.32 % --sat_fm_restart_options ""
% 0.11/0.32 % --sat_gr_def false
% 0.11/0.32 % --sat_epr_types true
% 0.11/0.32 % --sat_non_cyclic_types false
% 0.11/0.32 % --sat_finite_models false
% 0.11/0.32 % --sat_fm_lemmas false
% 0.11/0.32 % --sat_fm_prep false
% 0.11/0.32 % --sat_fm_uc_incr true
% 0.11/0.32 % --sat_out_model small
% 0.11/0.32 % --sat_out_clauses false
% 0.11/0.32
% 0.11/0.32 % ------ QBF Options
% 0.11/0.32
% 0.11/0.32 % --qbf_mode false
% 0.11/0.32 % --qbf_elim_univ true
% 0.11/0.32 % --qbf_sk_in true
% 0.11/0.32 % --qbf_pred_elim true
% 0.11/0.32 % --qbf_split 32
% 0.11/0.32
% 0.11/0.32 % ------ BMC1 Options
% 0.11/0.32
% 0.11/0.32 % --bmc1_incremental false
% 0.11/0.32 % --bmc1_axioms reachable_all
% 0.11/0.32 % --bmc1_min_bound 0
% 0.11/0.32 % --bmc1_max_bound -1
% 0.11/0.32 % --bmc1_max_bound_default -1
% 0.11/0.32 % --bmc1_symbol_reachability true
% 0.11/0.32 % --bmc1_property_lemmas false
% 0.11/0.32 % --bmc1_k_induction false
% 0.11/0.32 % --bmc1_non_equiv_states false
% 0.11/0.32 % --bmc1_deadlock false
% 0.11/0.32 % --bmc1_ucm false
% 0.11/0.32 % --bmc1_add_unsat_core none
% 0.11/0.32 % --bmc1_unsat_core_children false
% 0.11/0.32 % --bmc1_unsat_core_extrapolate_axioms false
% 0.11/0.32 % --bmc1_out_stat full
% 0.11/0.32 % --bmc1_ground_init false
% 0.11/0.32 % --bmc1_pre_inst_next_state false
% 0.11/0.32 % --bmc1_pre_inst_state false
% 0.11/0.32 % --bmc1_pre_inst_reach_state false
% 0.11/0.32 % --bmc1_out_unsat_core false
% 0.11/0.32 % --bmc1_aig_witness_out false
% 0.11/0.32 % --bmc1_verbose false
% 0.11/0.32 % --bmc1_dump_clauses_tptp false
% 0.11/0.33 % --bmc1_dump_unsat_core_tptp false
% 0.11/0.33 % --bmc1_dump_file -
% 0.11/0.33 % --bmc1_ucm_expand_uc_limit 128
% 0.11/0.33 % --bmc1_ucm_n_expand_iterations 6
% 0.11/0.33 % --bmc1_ucm_extend_mode 1
% 0.11/0.33 % --bmc1_ucm_init_mode 2
% 0.11/0.33 % --bmc1_ucm_cone_mode none
% 0.11/0.33 % --bmc1_ucm_reduced_relation_type 0
% 0.11/0.33 % --bmc1_ucm_relax_model 4
% 0.11/0.33 % --bmc1_ucm_full_tr_after_sat true
% 0.11/0.33 % --bmc1_ucm_expand_neg_assumptions false
% 0.11/0.33 % --bmc1_ucm_layered_model none
% 0.11/0.33 % --bmc1_ucm_max_lemma_size 10
% 0.11/0.33
% 0.11/0.33 % ------ AIG Options
% 0.11/0.33
% 0.11/0.33 % --aig_mode false
% 0.11/0.33
% 0.11/0.33 % ------ Instantiation Options
% 0.11/0.33
% 0.11/0.33 % --instantiation_flag true
% 0.11/0.33 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.11/0.33 % --inst_solver_per_active 750
% 0.11/0.33 % --inst_solver_calls_frac 0.5
% 0.11/0.33 % --inst_passive_queue_type priority_queues
% 0.11/0.33 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.11/0.33 % --inst_passive_queues_freq [25;2]
% 0.11/0.33 % --inst_dismatching true
% 0.11/0.33 % --inst_eager_unprocessed_to_passive true
% 0.11/0.33 % --inst_prop_sim_given true
% 0.11/0.33 % --inst_prop_sim_new false
% 0.11/0.33 % --inst_orphan_elimination true
% 0.11/0.33 % --inst_learning_loop_flag true
% 0.11/0.33 % --inst_learning_start 3000
% 0.11/0.33 % --inst_learning_factor 2
% 0.11/0.33 % --inst_start_prop_sim_after_learn 3
% 0.11/0.33 % --inst_sel_renew solver
% 0.11/0.33 % --inst_lit_activity_flag true
% 0.11/0.33 % --inst_out_proof true
% 0.11/0.33
% 0.11/0.33 % ------ Resolution Options
% 0.11/0.33
% 0.11/0.33 % --resolution_flag true
% 0.11/0.33 % --res_lit_sel kbo_max
% 0.11/0.33 % --res_to_prop_solver none
% 0.11/0.33 % --res_prop_simpl_new false
% 0.11/0.33 % --res_prop_simpl_given false
% 0.11/0.33 % --res_passive_queue_type priority_queues
% 0.11/0.33 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.11/0.33 % --res_passive_queues_freq [15;5]
% 0.11/0.33 % --res_forward_subs full
% 0.11/0.33 % --res_backward_subs full
% 0.11/0.33 % --res_forward_subs_resolution true
% 0.11/0.33 % --res_backward_subs_resolution true
% 0.11/0.33 % --res_orphan_elimination false
% 0.11/0.33 % --res_time_limit 1000.
% 0.11/0.33 % --res_out_proof true
% 0.11/0.33 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e57283.s
% 0.11/0.33 % --modulo true
% 0.11/0.33
% 0.11/0.33 % ------ Combination Options
% 0.11/0.33
% 0.11/0.33 % --comb_res_mult 1000
% 0.11/0.33 % --comb_inst_mult 300
% 0.11/0.33 % ------
% 0.11/0.33
% 0.11/0.33 % ------ Parsing...% successful
% 0.11/0.33
% 0.11/0.33 % ------ 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.11/0.33
% 0.11/0.33 % ------ Proving...
% 0.11/0.33 % ------ Problem Properties
% 0.11/0.33
% 0.11/0.33 %
% 0.11/0.33 % EPR false
% 0.11/0.33 % Horn false
% 0.11/0.33 % Has equality false
% 0.11/0.33
% 0.11/0.33 % % ------ Input Options Time Limit: Unbounded
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33 % % ------ Current options:
% 0.11/0.33
% 0.11/0.33 % ------ Input Options
% 0.11/0.33
% 0.11/0.33 % --out_options all
% 0.11/0.33 % --tptp_safe_out true
% 0.11/0.33 % --problem_path ""
% 0.11/0.33 % --include_path ""
% 0.11/0.33 % --clausifier .//eprover
% 0.11/0.33 % --clausifier_options --tstp-format
% 0.11/0.33 % --stdin false
% 0.11/0.33 % --dbg_backtrace false
% 0.11/0.33 % --dbg_dump_prop_clauses false
% 0.11/0.33 % --dbg_dump_prop_clauses_file -
% 0.11/0.33 % --dbg_out_stat false
% 0.11/0.33
% 0.11/0.33 % ------ General Options
% 0.11/0.33
% 0.11/0.33 % --fof false
% 0.11/0.33 % --time_out_real 150.
% 0.11/0.33 % --time_out_prep_mult 0.2
% 0.11/0.33 % --time_out_virtual -1.
% 0.11/0.33 % --schedule none
% 0.11/0.33 % --ground_splitting input
% 0.11/0.33 % --splitting_nvd 16
% 0.11/0.33 % --non_eq_to_eq false
% 0.11/0.33 % --prep_gs_sim true
% 0.11/0.33 % --prep_unflatten false
% 0.11/0.33 % --prep_res_sim true
% 0.11/0.33 % --prep_upred true
% 0.11/0.33 % --res_sim_input true
% 0.11/0.33 % --clause_weak_htbl true
% 0.11/0.33 % --gc_record_bc_elim false
% 0.11/0.33 % --symbol_type_check false
% 0.11/0.33 % --clausify_out false
% 0.11/0.33 % --large_theory_mode false
% 0.11/0.33 % --prep_sem_filter none
% 0.11/0.33 % --prep_sem_filter_out false
% 0.11/0.33 % --preprocessed_out false
% 0.11/0.33 % --sub_typing false
% 0.11/0.33 % --brand_transform false
% 0.11/0.33 % --pure_diseq_elim true
% 0.11/0.33 % --min_unsat_core false
% 0.11/0.33 % --pred_elim true
% 0.11/0.33 % --add_important_lit false
% 0.11/0.33 % --soft_assumptions false
% 0.11/0.33 % --reset_solvers false
% 0.11/0.33 % --bc_imp_inh []
% 0.11/0.33 % --conj_cone_tolerance 1.5
% 0.11/0.33 % --prolific_symb_bound 500
% 0.11/0.33 % --lt_threshold 2000
% 0.11/0.33
% 0.11/0.33 % ------ SAT Options
% 0.11/0.33
% 0.11/0.33 % --sat_mode false
% 0.11/0.33 % --sat_fm_restart_options ""
% 0.11/0.33 % --sat_gr_def false
% 0.11/0.33 % --sat_epr_types true
% 0.11/0.33 % --sat_non_cyclic_types false
% 0.11/0.33 % --sat_finite_models false
% 0.11/0.33 % --sat_fm_lemmas false
% 0.11/0.33 % --sat_fm_prep false
% 0.11/0.33 % --sat_fm_uc_incr true
% 0.11/0.33 % --sat_out_model small
% 0.11/0.33 % --sat_out_clauses false
% 0.11/0.33
% 0.11/0.33 % ------ QBF Options
% 0.11/0.33
% 0.11/0.33 % --qbf_mode false
% 0.11/0.33 % --qbf_elim_univ true
% 0.11/0.33 % --qbf_sk_in true
% 0.11/0.33 % --qbf_pred_elim true
% 0.11/0.33 % --qbf_split 32
% 0.11/0.33
% 0.11/0.33 % ------ BMC1 Options
% 0.11/0.33
% 0.11/0.33 % --bmc1_incremental false
% 0.11/0.33 % --bmc1_axioms reachable_all
% 0.11/0.33 % --bmc1_min_bound 0
% 0.11/0.33 % --bmc1_max_bound -1
% 0.11/0.33 % --bmc1_max_bound_default -1
% 0.11/0.33 % --bmc1_symbol_reachability true
% 0.11/0.33 % --bmc1_property_lemmas false
% 0.11/0.33 % --bmc1_k_induction false
% 0.11/0.33 % --bmc1_non_equiv_states false
% 0.11/0.33 % --bmc1_deadlock false
% 0.11/0.33 % --bmc1_ucm false
% 0.11/0.33 % --bmc1_add_unsat_core none
% 0.11/0.33 % --bmc1_unsat_core_children false
% 0.11/0.33 % --bmc1_unsat_core_extrapolate_axioms false
% 0.11/0.33 % --bmc1_out_stat full
% 0.11/0.33 % --bmc1_ground_init false
% 0.11/0.33 % --bmc1_pre_inst_next_state false
% 0.11/0.33 % --bmc1_pre_inst_state false
% 0.11/0.33 % --bmc1_pre_inst_reach_state false
% 0.11/0.33 % --bmc1_out_unsat_core false
% 0.11/0.33 % --bmc1_aig_witness_out false
% 0.11/0.33 % --bmc1_verbose false
% 0.11/0.33 % --bmc1_dump_clauses_tptp false
% 0.11/0.33 % --bmc1_dump_unsat_core_tptp false
% 0.11/0.33 % --bmc1_dump_file -
% 0.11/0.33 % --bmc1_ucm_expand_uc_limit 128
% 0.11/0.33 % --bmc1_ucm_n_expand_iterations 6
% 0.11/0.33 % --bmc1_ucm_extend_mode 1
% 0.11/0.33 % --bmc1_ucm_init_mode 2
% 0.11/0.33 % --bmc1_ucm_cone_mode none
% 0.11/0.33 % --bmc1_ucm_reduced_relation_type 0
% 0.11/0.33 % --bmc1_ucm_relax_model 4
% 0.11/0.33 % --bmc1_ucm_full_tr_after_sat true
% 0.11/0.33 % --bmc1_ucm_expand_neg_assumptions false
% 0.11/0.33 % --bmc1_ucm_layered_model none
% 0.11/0.33 % --bmc1_ucm_max_lemma_size 10
% 0.11/0.33
% 0.11/0.33 % ------ AIG Options
% 0.11/0.33
% 0.11/0.33 % --aig_mode false
% 0.11/0.33
% 0.11/0.33 % ------ Instantiation Options
% 0.11/0.33
% 0.11/0.33 % --instantiation_flag true
% 0.11/0.33 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.11/0.33 % --inst_solver_per_active 750
% 0.11/0.33 % --inst_solver_calls_frac 0.5
% 0.11/0.33 % --inst_passive_queue_type priority_queues
% 0.11/0.33 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.11/0.33 % --inst_passive_queues_freq [25;2]
% 0.11/0.33 % --inst_dismatching true
% 0.11/0.33 % --inst_eager_unprocessed_to_passive true
% 0.11/0.33 % --inst_prop_sim_given true
% 0.11/0.33 % --inst_prop_sim_new false
% 0.11/0.33 % --inst_orphan_elimination true
% 0.11/0.33 % --inst_learning_loop_flag true
% 0.11/0.33 % --inst_learning_start 3000
% 0.11/0.33 % --inst_learning_factor 2
% 0.11/0.33 % --inst_start_prop_sim_after_learn 3
% 0.11/0.33 % --inst_sel_renew solver
% 0.11/0.33 % --inst_lit_activity_flag true
% 0.11/0.33 % --inst_out_proof true
% 0.11/0.33
% 0.11/0.33 % ------ Resolution Options
% 0.11/0.33
% 0.11/0.33 % --resolution_flag true
% 0.11/0.33 % --res_lit_sel kbo_max
% 0.11/0.33 % --res_to_prop_solver none
% 0.11/0.33 % --res_prop_simpl_new false
% 0.11/0.33 % --res_prop_simpl_given false
% 0.11/0.33 % --res_passive_queue_type priority_queues
% 0.11/0.33 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.11/0.33 % --res_passive_queues_freq [15;5]
% 0.11/0.33 % --res_forward_subs full
% 0.11/0.33 % --res_backward_subs full
% 0.11/0.33 % --res_forward_subs_resolution true
% 0.11/0.33 % --res_backward_subs_resolution true
% 0.11/0.33 % --res_orphan_elimination false
% 0.11/0.33 % --res_time_limit 1000.
% 0.11/0.33 % --res_out_proof true
% 0.11/0.33 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e57283.s
% 0.11/0.33 % --modulo true
% 0.11/0.33
% 0.11/0.33 % ------ Combination Options
% 0.11/0.33
% 0.11/0.33 % --comb_res_mult 1000
% 0.11/0.33 % --comb_inst_mult 300
% 0.11/0.33 % ------
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33 % ------ Proving...
% 0.11/0.33 % warning: shown sat in sat incomplete mode
% 0.11/0.33 %
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33 cnf(c_84,plain,
% 0.11/0.33 ( ~ a(X0) | c(X0) | d(X0) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_141_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_386,plain,
% 0.11/0.33 ( ~ a(X0) | c(X0) | d(X0) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_84]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_387,plain,
% 0.11/0.33 ( c(X0) | d(X0) | ~ a(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_386]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_67,plain,
% 0.11/0.33 ( ~ e(X0) | ~ r(X0,X1) | a(X1) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_133_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_352,plain,
% 0.11/0.33 ( ~ e(X0) | ~ r(X0,X1) | a(X1) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_67]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_353,plain,
% 0.11/0.33 ( ~ r(X0,X1) | ~ e(X0) | a(X1) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_352]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_63,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | e(X0) | c(u1r3(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_132_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_344,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | e(X0) | c(u1r3(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_63]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_345,plain,
% 0.11/0.33 ( ~ r3least(X0) | c(u1r3(X0)) | e(X0) | ~ a(u1r1(X0)) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_344]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_59,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | e(X0) | c(u1r2(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_131_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_336,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | e(X0) | c(u1r2(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_59]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_337,plain,
% 0.11/0.33 ( ~ r3least(X0) | c(u1r2(X0)) | e(X0) | ~ a(u1r1(X0)) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_336]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_55,plain,
% 0.11/0.33 ( ~ r3least(X0) | e(X0) | r(X0,u1r1(X0)) | c(u1r3(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_130_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_328,plain,
% 0.11/0.33 ( ~ r3least(X0) | e(X0) | r(X0,u1r1(X0)) | c(u1r3(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_55]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_329,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u1r1(X0)) | c(u1r3(X0)) | e(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_328]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_51,plain,
% 0.11/0.33 ( ~ r3least(X0) | e(X0) | r(X0,u1r1(X0)) | c(u1r2(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_129_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_320,plain,
% 0.11/0.33 ( ~ r3least(X0) | e(X0) | r(X0,u1r1(X0)) | c(u1r2(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_51]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_321,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u1r1(X0)) | c(u1r2(X0)) | e(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_320]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_39,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | e(X0) | r(X0,u1r3(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_124_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_296,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | e(X0) | r(X0,u1r3(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_39]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_297,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u1r3(X0)) | e(X0) | ~ a(u1r1(X0)) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_296]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_35,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | e(X0) | r(X0,u1r2(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_123_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_288,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | e(X0) | r(X0,u1r2(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_35]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_289,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u1r2(X0)) | e(X0) | ~ a(u1r1(X0)) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_288]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_31,plain,
% 0.11/0.33 ( ~ r3least(X0) | e(X0) | r(X0,u1r1(X0)) | r(X0,u1r3(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_122_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_280,plain,
% 0.11/0.33 ( ~ r3least(X0) | e(X0) | r(X0,u1r1(X0)) | r(X0,u1r3(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_31]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_281,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u1r1(X0)) | r(X0,u1r3(X0)) | e(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_280]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_27,plain,
% 0.11/0.33 ( ~ r3least(X0) | e(X0) | r(X0,u1r1(X0)) | r(X0,u1r2(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_121_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_272,plain,
% 0.11/0.33 ( ~ r3least(X0) | e(X0) | r(X0,u1r1(X0)) | r(X0,u1r2(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_27]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_273,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u1r1(X0)) | r(X0,u1r2(X0)) | e(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_272]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_23,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | ~ equalish(u1r3(X0),u1r2(X0)) | e(X0) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_120_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_264,plain,
% 0.11/0.33 ( ~ a(u1r1(X0)) | ~ r3least(X0) | ~ equalish(u1r3(X0),u1r2(X0)) | e(X0) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_23]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_265,plain,
% 0.11/0.33 ( ~ equalish(u1r3(X0),u1r2(X0)) | ~ r3least(X0) | e(X0) | ~ a(u1r1(X0)) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_264]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_19,plain,
% 0.11/0.33 ( ~ r3least(X0)
% 0.11/0.33 | ~ equalish(u1r3(X0),u1r2(X0))
% 0.11/0.33 | e(X0)
% 0.11/0.33 | r(X0,u1r1(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_119_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_256,plain,
% 0.11/0.33 ( ~ r3least(X0)
% 0.11/0.33 | ~ equalish(u1r3(X0),u1r2(X0))
% 0.11/0.33 | e(X0)
% 0.11/0.33 | r(X0,u1r1(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_19]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_257,plain,
% 0.11/0.33 ( ~ equalish(u1r3(X0),u1r2(X0))
% 0.11/0.33 | ~ r3least(X0)
% 0.11/0.33 | r(X0,u1r1(X0))
% 0.11/0.33 | e(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_256]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_18,plain,
% 0.11/0.33 ( equalish(X0,X1) | f(X2) | ~ d(X1) | ~ d(X0) | ~ r(X2,X1) | ~ r(X2,X0) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_118_5) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_254,plain,
% 0.11/0.33 ( equalish(X0,X1) | f(X2) | ~ d(X1) | ~ d(X0) | ~ r(X2,X1) | ~ r(X2,X0) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_18]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_255,plain,
% 0.11/0.33 ( equalish(X0,X1) | ~ r(X2,X1) | ~ r(X2,X0) | f(X2) | ~ d(X1) | ~ d(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_254]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_16,plain,
% 0.11/0.33 ( ~ r(X0,X1) | ~ r(X0,X2) | equalish(X1,X2) | f(X0) | ~ d(X2) | ~ d(X1) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_118_3) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_250,plain,
% 0.11/0.33 ( ~ r(X0,X1) | ~ r(X0,X2) | equalish(X1,X2) | f(X0) | ~ d(X2) | ~ d(X1) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_16]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_251,plain,
% 0.11/0.33 ( equalish(X0,X1) | ~ r(X2,X0) | ~ r(X2,X1) | f(X2) | ~ d(X1) | ~ d(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_250]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_13,plain,
% 0.11/0.33 ( ~ r(X0,X1) | ~ r(X0,X2) | ~ d(X1) | ~ d(X2) | f(X0) | equalish(X1,X2) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_118_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_244,plain,
% 0.11/0.33 ( ~ r(X0,X1) | ~ r(X0,X2) | ~ d(X1) | ~ d(X2) | f(X0) | equalish(X1,X2) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_13]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_245,plain,
% 0.11/0.33 ( equalish(X0,X1) | ~ r(X2,X0) | ~ r(X2,X1) | f(X2) | ~ d(X0) | ~ d(X1) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_244]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_11,plain,
% 0.11/0.33 ( ~ e(X0)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | ~ c(X2)
% 0.11/0.33 | ~ c(X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ r(X0,X1) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_117_4) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_240,plain,
% 0.11/0.33 ( ~ e(X0)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | ~ c(X2)
% 0.11/0.33 | ~ c(X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ r(X0,X1) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_11]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_241,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | ~ r(X2,X1)
% 0.11/0.33 | ~ r(X2,X0)
% 0.11/0.33 | ~ c(X1)
% 0.11/0.33 | ~ c(X0)
% 0.11/0.33 | ~ e(X2) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_240]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_9,plain,
% 0.11/0.33 ( ~ e(X0)
% 0.11/0.33 | ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | ~ c(X2)
% 0.11/0.33 | ~ c(X1) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_117_2) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_236,plain,
% 0.11/0.33 ( ~ e(X0)
% 0.11/0.33 | ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | ~ c(X2)
% 0.11/0.33 | ~ c(X1) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_9]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_237,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | ~ r(X2,X0)
% 0.11/0.33 | ~ r(X2,X1)
% 0.11/0.33 | ~ c(X1)
% 0.11/0.33 | ~ c(X0)
% 0.11/0.33 | ~ e(X2) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_236]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_7,plain,
% 0.11/0.33 ( ~ e(X0)
% 0.11/0.33 | ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ c(X1)
% 0.11/0.33 | ~ c(X2)
% 0.11/0.33 | equalish(X1,X2) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_117_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_232,plain,
% 0.11/0.33 ( ~ e(X0)
% 0.11/0.33 | ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ c(X1)
% 0.11/0.33 | ~ c(X2)
% 0.11/0.33 | equalish(X1,X2) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_7]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_233,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | ~ r(X2,X0)
% 0.11/0.33 | ~ r(X2,X1)
% 0.11/0.33 | ~ c(X0)
% 0.11/0.33 | ~ c(X1)
% 0.11/0.33 | ~ e(X2) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_232]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_5,plain,
% 0.11/0.33 ( ~ r(X0,X1)
% 0.11/0.33 | equalish(X2,X3)
% 0.11/0.33 | equalish(X1,X3)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | r3least(X0)
% 0.11/0.33 | ~ r(X0,X3)
% 0.11/0.33 | ~ r(X0,X2) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_116_5) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_228,plain,
% 0.11/0.33 ( ~ r(X0,X1)
% 0.11/0.33 | equalish(X2,X3)
% 0.11/0.33 | equalish(X1,X3)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | r3least(X0)
% 0.11/0.33 | ~ r(X0,X3)
% 0.11/0.33 | ~ r(X0,X2) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_5]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_229,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | equalish(X2,X1)
% 0.11/0.33 | equalish(X2,X0)
% 0.11/0.33 | r3least(X3)
% 0.11/0.33 | ~ r(X3,X2)
% 0.11/0.33 | ~ r(X3,X1)
% 0.11/0.33 | ~ r(X3,X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_228]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_2,plain,
% 0.11/0.33 ( ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ r(X0,X3)
% 0.11/0.33 | r3least(X0)
% 0.11/0.33 | equalish(X2,X3)
% 0.11/0.33 | equalish(X1,X3)
% 0.11/0.33 | equalish(X1,X2) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_116_2) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_222,plain,
% 0.11/0.33 ( ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ r(X0,X3)
% 0.11/0.33 | r3least(X0)
% 0.11/0.33 | equalish(X2,X3)
% 0.11/0.33 | equalish(X1,X3)
% 0.11/0.33 | equalish(X1,X2) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_2]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_223,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | equalish(X2,X1)
% 0.11/0.33 | equalish(X2,X0)
% 0.11/0.33 | r3least(X3)
% 0.11/0.33 | ~ r(X3,X2)
% 0.11/0.33 | ~ r(X3,X0)
% 0.11/0.33 | ~ r(X3,X1) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_222]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_1,plain,
% 0.11/0.33 ( ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ r(X0,X3)
% 0.11/0.33 | r3least(X0)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | equalish(X2,X3)
% 0.11/0.33 | equalish(X1,X3) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_116_1) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_220,plain,
% 0.11/0.33 ( ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ r(X0,X3)
% 0.11/0.33 | r3least(X0)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | equalish(X2,X3)
% 0.11/0.33 | equalish(X1,X3) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_1]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_221,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | equalish(X0,X2)
% 0.11/0.33 | r3least(X3)
% 0.11/0.33 | ~ r(X3,X0)
% 0.11/0.33 | ~ r(X3,X1)
% 0.11/0.33 | ~ r(X3,X2) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_220]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_0,plain,
% 0.11/0.33 ( ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ r(X0,X3)
% 0.11/0.33 | r3least(X0)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | equalish(X1,X3)
% 0.11/0.33 | equalish(X2,X3) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_116_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_218,plain,
% 0.11/0.33 ( ~ r(X0,X1)
% 0.11/0.33 | ~ r(X0,X2)
% 0.11/0.33 | ~ r(X0,X3)
% 0.11/0.33 | r3least(X0)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | equalish(X1,X3)
% 0.11/0.33 | equalish(X2,X3) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_0]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_219,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | equalish(X0,X2)
% 0.11/0.33 | equalish(X1,X2)
% 0.11/0.33 | r3least(X3)
% 0.11/0.33 | ~ r(X3,X0)
% 0.11/0.33 | ~ r(X3,X1)
% 0.11/0.33 | ~ r(X3,X2) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_218]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_94,negated_conjecture,
% 0.11/0.33 ( e(exist) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_9) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_111,negated_conjecture,
% 0.11/0.33 ( e(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_94]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_118,negated_conjecture,
% 0.11/0.33 ( e(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_111]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_119,negated_conjecture,
% 0.11/0.33 ( e(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_118]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_122,negated_conjecture,
% 0.11/0.33 ( e(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_119]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_406,negated_conjecture,
% 0.11/0.33 ( e(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_122]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_93,negated_conjecture,
% 0.11/0.33 ( ~ f(exist) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_8) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_109,negated_conjecture,
% 0.11/0.33 ( ~ f(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_93]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_117,negated_conjecture,
% 0.11/0.33 ( ~ f(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_109]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_120,negated_conjecture,
% 0.11/0.33 ( ~ f(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_117]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_121,negated_conjecture,
% 0.11/0.33 ( ~ f(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_120]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_404,negated_conjecture,
% 0.11/0.33 ( ~ f(exist) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_121]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_91,plain,
% 0.11/0.33 ( ~ e(X0) | r3least(X0) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_144_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_400,plain,
% 0.11/0.33 ( ~ e(X0) | r3least(X0) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_91]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_401,plain,
% 0.11/0.33 ( r3least(X0) | ~ e(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_400]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_89,plain,
% 0.11/0.33 ( ~ c(X0) | a(X0) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_143_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_396,plain,( ~ c(X0) | a(X0) ),inference(copy,[status(esa)],[c_89]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_87,plain,
% 0.11/0.33 ( ~ d(X0) | a(X0) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_142_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_392,plain,( ~ d(X0) | a(X0) ),inference(copy,[status(esa)],[c_87]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_82,plain,
% 0.11/0.33 ( ~ f(X0) | d(u3r2(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_140_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_382,plain,
% 0.11/0.33 ( ~ f(X0) | d(u3r2(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_82]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_80,plain,
% 0.11/0.33 ( ~ f(X0) | d(u3r1(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_139_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_378,plain,
% 0.11/0.33 ( ~ f(X0) | d(u3r1(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_80]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_78,plain,
% 0.11/0.33 ( ~ f(X0) | r(X0,u3r2(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_138_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_374,plain,
% 0.11/0.33 ( ~ f(X0) | r(X0,u3r2(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_78]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_375,plain,
% 0.11/0.33 ( r(X0,u3r2(X0)) | ~ f(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_374]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_76,plain,
% 0.11/0.33 ( ~ f(X0) | r(X0,u3r1(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_137_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_370,plain,
% 0.11/0.33 ( ~ f(X0) | r(X0,u3r1(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_76]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_371,plain,
% 0.11/0.33 ( r(X0,u3r1(X0)) | ~ f(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_370]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_74,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u2r3(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_136_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_366,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u2r3(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_74]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_72,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u2r2(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_135_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_362,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u2r2(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_72]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_70,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u2r1(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_134_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_358,plain,
% 0.11/0.33 ( ~ r3least(X0) | r(X0,u2r1(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_70]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_49,plain,
% 0.11/0.33 ( ~ f(X0) | ~ equalish(u3r2(X0),u3r1(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_128_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_316,plain,
% 0.11/0.33 ( ~ f(X0) | ~ equalish(u3r2(X0),u3r1(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_49]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_317,plain,
% 0.11/0.33 ( ~ equalish(u3r2(X0),u3r1(X0)) | ~ f(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_316]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_47,plain,
% 0.11/0.33 ( ~ r3least(X0) | ~ equalish(u2r3(X0),u2r2(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_127_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_312,plain,
% 0.11/0.33 ( ~ r3least(X0) | ~ equalish(u2r3(X0),u2r2(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_47]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_313,plain,
% 0.11/0.33 ( ~ equalish(u2r3(X0),u2r2(X0)) | ~ r3least(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_312]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_45,plain,
% 0.11/0.33 ( ~ r3least(X0) | ~ equalish(u2r3(X0),u2r1(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_126_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_308,plain,
% 0.11/0.33 ( ~ r3least(X0) | ~ equalish(u2r3(X0),u2r1(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_45]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_309,plain,
% 0.11/0.33 ( ~ equalish(u2r3(X0),u2r1(X0)) | ~ r3least(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_308]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_43,plain,
% 0.11/0.33 ( ~ r3least(X0) | ~ equalish(u2r2(X0),u2r1(X0)) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_125_0) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_304,plain,
% 0.11/0.33 ( ~ r3least(X0) | ~ equalish(u2r2(X0),u2r1(X0)) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_43]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_305,plain,
% 0.11/0.33 ( ~ equalish(u2r2(X0),u2r1(X0)) | ~ r3least(X0) ),
% 0.11/0.33 inference(rewriting,[status(thm)],[c_304]) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_6,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | equalish(X2,X1)
% 0.11/0.33 | equalish(X2,X0)
% 0.11/0.33 | r3least(X3)
% 0.11/0.33 | ~ r(X3,X1)
% 0.11/0.33 | ~ r(X3,X0)
% 0.11/0.33 | ~ r(X3,X2) ),
% 0.11/0.33 file('/export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p', c_0_116_6) ).
% 0.11/0.33
% 0.11/0.33 cnf(c_230,plain,
% 0.11/0.33 ( equalish(X0,X1)
% 0.11/0.33 | equalish(X2,X1)
% 0.11/0.33 | equalish(X2,X0)
% 0.11/0.33 | r3least(X3)
% 0.11/0.33 | ~ r(X3,X1)
% 0.11/0.33 | ~ r(X3,X0)
% 0.11/0.33 | ~ r(X3,X2) ),
% 0.11/0.33 inference(copy,[status(esa)],[c_6]) ).
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33 % ------ Statistics
% 0.11/0.33
% 0.11/0.33 % ------ General
% 0.11/0.33
% 0.11/0.33 % num_of_input_clauses: 95
% 0.11/0.33 % num_of_input_neg_conjectures: 2
% 0.11/0.33 % num_of_splits: 0
% 0.11/0.33 % num_of_split_atoms: 0
% 0.11/0.33 % num_of_sem_filtered_clauses: 0
% 0.11/0.33 % num_of_subtypes: 0
% 0.11/0.33 % monotx_restored_types: 0
% 0.11/0.33 % sat_num_of_epr_types: 0
% 0.11/0.33 % sat_num_of_non_cyclic_types: 0
% 0.11/0.33 % sat_guarded_non_collapsed_types: 0
% 0.11/0.33 % is_epr: 0
% 0.11/0.33 % is_horn: 0
% 0.11/0.33 % has_eq: 0
% 0.11/0.33 % num_pure_diseq_elim: 0
% 0.11/0.33 % simp_replaced_by: 0
% 0.11/0.33 % res_preprocessed: 4
% 0.11/0.33 % prep_upred: 0
% 0.11/0.33 % prep_unflattend: 0
% 0.11/0.33 % pred_elim_cands: 0
% 0.11/0.33 % pred_elim: 0
% 0.11/0.33 % pred_elim_cl: 0
% 0.11/0.33 % pred_elim_cycles: 0
% 0.11/0.33 % forced_gc_time: 0
% 0.11/0.33 % gc_basic_clause_elim: 0
% 0.11/0.33 % parsing_time: 0.002
% 0.11/0.33 % sem_filter_time: 0.
% 0.11/0.33 % pred_elim_time: 0.
% 0.11/0.33 % out_proof_time: 0.
% 0.11/0.33 % monotx_time: 0.
% 0.11/0.33 % subtype_inf_time: 0.
% 0.11/0.33 % unif_index_cands_time: 0.
% 0.11/0.33 % unif_index_add_time: 0.
% 0.11/0.33 % total_time: 0.018
% 0.11/0.33 % num_of_symbols: 42
% 0.11/0.33 % num_of_terms: 176
% 0.11/0.33
% 0.11/0.33 % ------ Propositional Solver
% 0.11/0.33
% 0.11/0.33 % prop_solver_calls: 1
% 0.11/0.33 % prop_fast_solver_calls: 6
% 0.11/0.33 % prop_num_of_clauses: 49
% 0.11/0.33 % prop_preprocess_simplified: 343
% 0.11/0.33 % prop_fo_subsumed: 0
% 0.11/0.33 % prop_solver_time: 0.
% 0.11/0.33 % prop_fast_solver_time: 0.
% 0.11/0.33 % prop_unsat_core_time: 0.
% 0.11/0.33
% 0.11/0.33 % ------ QBF
% 0.11/0.33
% 0.11/0.33 % qbf_q_res: 0
% 0.11/0.33 % qbf_num_tautologies: 0
% 0.11/0.33 % qbf_prep_cycles: 0
% 0.11/0.33
% 0.11/0.33 % ------ BMC1
% 0.11/0.33
% 0.11/0.33 % bmc1_current_bound: -1
% 0.11/0.33 % bmc1_last_solved_bound: -1
% 0.11/0.33 % bmc1_unsat_core_size: -1
% 0.11/0.33 % bmc1_unsat_core_parents_size: -1
% 0.11/0.33 % bmc1_merge_next_fun: 0
% 0.11/0.33 % bmc1_unsat_core_clauses_time: 0.
% 0.11/0.33
% 0.11/0.33 % ------ Instantiation
% 0.11/0.33
% 0.11/0.33 % inst_num_of_clauses: 95
% 0.11/0.33 % inst_num_in_passive: 0
% 0.11/0.33 % inst_num_in_active: 0
% 0.11/0.33 % inst_num_in_unprocessed: 95
% 0.11/0.33 % inst_num_of_loops: 0
% 0.11/0.33 % inst_num_of_learning_restarts: 0
% 0.11/0.33 % inst_num_moves_active_passive: 0
% 0.11/0.33 % inst_lit_activity: 0
% 0.11/0.33 % inst_lit_activity_moves: 0
% 0.11/0.33 % inst_num_tautologies: 0
% 0.11/0.33 % inst_num_prop_implied: 0
% 0.11/0.33 % inst_num_existing_simplified: 0
% 0.11/0.33 % inst_num_eq_res_simplified: 0
% 0.11/0.33 % inst_num_child_elim: 0
% 0.11/0.33 % inst_num_of_dismatching_blockings: 0
% 0.11/0.33 % inst_num_of_non_proper_insts: 0
% 0.11/0.33 % inst_num_of_duplicates: 0
% 0.11/0.33 % inst_inst_num_from_inst_to_res: 0
% 0.11/0.33 % inst_dismatching_checking_time: 0.
% 0.11/0.33
% 0.11/0.33 % ------ Resolution
% 0.11/0.33
% 0.11/0.33 % res_num_of_clauses: 117
% 0.11/0.33 % res_num_in_passive: 0
% 0.11/0.33 % res_num_in_active: 39
% 0.11/0.33 % res_num_of_loops: 3
% 0.11/0.33 % res_forward_subset_subsumed: 56
% 0.11/0.33 % res_backward_subset_subsumed: 0
% 0.11/0.33 % res_forward_subsumed: 0
% 0.11/0.33 % res_backward_subsumed: 0
% 0.11/0.33 % res_forward_subsumption_resolution: 0
% 0.11/0.33 % res_backward_subsumption_resolution: 0
% 0.11/0.33 % res_clause_to_clause_subsumption: 0
% 0.11/0.33 % res_orphan_elimination: 0
% 0.11/0.33 % res_tautology_del: 0
% 0.11/0.33 % res_num_eq_res_simplified: 0
% 0.11/0.33 % res_num_sel_changes: 0
% 0.11/0.33 % res_moves_from_active_to_pass: 0
% 0.11/0.33
% 0.11/0.33 % Status Unknown
% 0.11/0.36 % Orienting using strategy ClausalAll
% 0.11/0.36 % Orientation found
% 0.11/0.36 % 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_e57283.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_06dfa9.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_9884fb | grep -v "SZS"
% 0.11/0.37
% 0.11/0.37 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.11/0.37
% 0.11/0.37 %
% 0.11/0.37 % ------ iProver source info
% 0.11/0.37
% 0.11/0.37 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.11/0.37 % git: non_committed_changes: true
% 0.11/0.37 % git: last_make_outside_of_git: true
% 0.11/0.37
% 0.11/0.37 %
% 0.11/0.37 % ------ Input Options
% 0.11/0.37
% 0.11/0.37 % --out_options all
% 0.11/0.37 % --tptp_safe_out true
% 0.11/0.37 % --problem_path ""
% 0.11/0.37 % --include_path ""
% 0.11/0.37 % --clausifier .//eprover
% 0.11/0.37 % --clausifier_options --tstp-format
% 0.11/0.37 % --stdin false
% 0.11/0.37 % --dbg_backtrace false
% 0.11/0.37 % --dbg_dump_prop_clauses false
% 0.11/0.37 % --dbg_dump_prop_clauses_file -
% 0.11/0.37 % --dbg_out_stat false
% 0.11/0.37
% 0.11/0.37 % ------ General Options
% 0.11/0.37
% 0.11/0.37 % --fof false
% 0.11/0.37 % --time_out_real 150.
% 0.11/0.37 % --time_out_prep_mult 0.2
% 0.11/0.37 % --time_out_virtual -1.
% 0.11/0.37 % --schedule none
% 0.11/0.37 % --ground_splitting input
% 0.11/0.37 % --splitting_nvd 16
% 0.11/0.37 % --non_eq_to_eq false
% 0.11/0.37 % --prep_gs_sim true
% 0.11/0.37 % --prep_unflatten false
% 0.11/0.37 % --prep_res_sim true
% 0.11/0.37 % --prep_upred true
% 0.11/0.37 % --res_sim_input true
% 0.11/0.37 % --clause_weak_htbl true
% 0.11/0.37 % --gc_record_bc_elim false
% 0.11/0.37 % --symbol_type_check false
% 0.11/0.37 % --clausify_out false
% 0.11/0.37 % --large_theory_mode false
% 0.11/0.37 % --prep_sem_filter none
% 0.11/0.37 % --prep_sem_filter_out false
% 0.11/0.37 % --preprocessed_out false
% 0.11/0.37 % --sub_typing false
% 0.11/0.37 % --brand_transform false
% 0.11/0.37 % --pure_diseq_elim true
% 0.11/0.37 % --min_unsat_core false
% 0.11/0.37 % --pred_elim true
% 0.11/0.37 % --add_important_lit false
% 0.11/0.37 % --soft_assumptions false
% 0.11/0.37 % --reset_solvers false
% 0.11/0.37 % --bc_imp_inh []
% 0.11/0.37 % --conj_cone_tolerance 1.5
% 0.11/0.37 % --prolific_symb_bound 500
% 0.11/0.37 % --lt_threshold 2000
% 0.11/0.37
% 0.11/0.37 % ------ SAT Options
% 0.11/0.37
% 0.11/0.37 % --sat_mode false
% 0.11/0.37 % --sat_fm_restart_options ""
% 0.11/0.37 % --sat_gr_def false
% 0.11/0.37 % --sat_epr_types true
% 0.11/0.37 % --sat_non_cyclic_types false
% 0.11/0.37 % --sat_finite_models false
% 0.11/0.37 % --sat_fm_lemmas false
% 0.11/0.37 % --sat_fm_prep false
% 0.11/0.37 % --sat_fm_uc_incr true
% 0.11/0.37 % --sat_out_model small
% 0.11/0.37 % --sat_out_clauses false
% 0.11/0.37
% 0.11/0.37 % ------ QBF Options
% 0.11/0.37
% 0.11/0.37 % --qbf_mode false
% 0.11/0.37 % --qbf_elim_univ true
% 0.11/0.37 % --qbf_sk_in true
% 0.11/0.37 % --qbf_pred_elim true
% 0.11/0.37 % --qbf_split 32
% 0.11/0.37
% 0.11/0.37 % ------ BMC1 Options
% 0.11/0.37
% 0.11/0.37 % --bmc1_incremental false
% 0.11/0.37 % --bmc1_axioms reachable_all
% 0.11/0.37 % --bmc1_min_bound 0
% 0.11/0.37 % --bmc1_max_bound -1
% 0.11/0.37 % --bmc1_max_bound_default -1
% 0.11/0.37 % --bmc1_symbol_reachability true
% 0.11/0.37 % --bmc1_property_lemmas false
% 0.11/0.37 % --bmc1_k_induction false
% 0.11/0.37 % --bmc1_non_equiv_states false
% 0.11/0.37 % --bmc1_deadlock false
% 0.11/0.37 % --bmc1_ucm false
% 0.11/0.37 % --bmc1_add_unsat_core none
% 0.11/0.37 % --bmc1_unsat_core_children false
% 0.11/0.37 % --bmc1_unsat_core_extrapolate_axioms false
% 0.11/0.37 % --bmc1_out_stat full
% 0.11/0.37 % --bmc1_ground_init false
% 0.11/0.37 % --bmc1_pre_inst_next_state false
% 0.11/0.37 % --bmc1_pre_inst_state false
% 0.11/0.37 % --bmc1_pre_inst_reach_state false
% 0.11/0.37 % --bmc1_out_unsat_core false
% 0.11/0.37 % --bmc1_aig_witness_out false
% 0.11/0.37 % --bmc1_verbose false
% 0.11/0.37 % --bmc1_dump_clauses_tptp false
% 0.11/0.38 % --bmc1_dump_unsat_core_tptp false
% 0.11/0.38 % --bmc1_dump_file -
% 0.11/0.38 % --bmc1_ucm_expand_uc_limit 128
% 0.11/0.38 % --bmc1_ucm_n_expand_iterations 6
% 0.11/0.38 % --bmc1_ucm_extend_mode 1
% 0.11/0.38 % --bmc1_ucm_init_mode 2
% 0.11/0.38 % --bmc1_ucm_cone_mode none
% 0.11/0.38 % --bmc1_ucm_reduced_relation_type 0
% 0.11/0.38 % --bmc1_ucm_relax_model 4
% 0.11/0.38 % --bmc1_ucm_full_tr_after_sat true
% 0.11/0.38 % --bmc1_ucm_expand_neg_assumptions false
% 0.11/0.38 % --bmc1_ucm_layered_model none
% 0.11/0.38 % --bmc1_ucm_max_lemma_size 10
% 0.11/0.38
% 0.11/0.38 % ------ AIG Options
% 0.11/0.38
% 0.11/0.38 % --aig_mode false
% 0.11/0.38
% 0.11/0.38 % ------ Instantiation Options
% 0.11/0.38
% 0.11/0.38 % --instantiation_flag true
% 0.11/0.38 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.11/0.38 % --inst_solver_per_active 750
% 0.11/0.38 % --inst_solver_calls_frac 0.5
% 0.11/0.38 % --inst_passive_queue_type priority_queues
% 0.11/0.38 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.11/0.38 % --inst_passive_queues_freq [25;2]
% 0.11/0.38 % --inst_dismatching true
% 0.11/0.38 % --inst_eager_unprocessed_to_passive true
% 0.11/0.38 % --inst_prop_sim_given true
% 0.11/0.38 % --inst_prop_sim_new false
% 0.11/0.38 % --inst_orphan_elimination true
% 0.11/0.38 % --inst_learning_loop_flag true
% 0.11/0.38 % --inst_learning_start 3000
% 0.11/0.38 % --inst_learning_factor 2
% 0.11/0.38 % --inst_start_prop_sim_after_learn 3
% 0.11/0.38 % --inst_sel_renew solver
% 0.11/0.38 % --inst_lit_activity_flag true
% 0.11/0.38 % --inst_out_proof true
% 0.11/0.38
% 0.11/0.38 % ------ Resolution Options
% 0.11/0.38
% 0.11/0.38 % --resolution_flag true
% 0.11/0.38 % --res_lit_sel kbo_max
% 0.11/0.38 % --res_to_prop_solver none
% 0.11/0.38 % --res_prop_simpl_new false
% 0.11/0.38 % --res_prop_simpl_given false
% 0.11/0.38 % --res_passive_queue_type priority_queues
% 0.11/0.38 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.11/0.38 % --res_passive_queues_freq [15;5]
% 0.11/0.38 % --res_forward_subs full
% 0.11/0.38 % --res_backward_subs full
% 0.11/0.38 % --res_forward_subs_resolution true
% 0.11/0.38 % --res_backward_subs_resolution true
% 0.11/0.38 % --res_orphan_elimination false
% 0.11/0.38 % --res_time_limit 1000.
% 0.11/0.38 % --res_out_proof true
% 0.11/0.38 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e57283.s
% 0.11/0.38 % --modulo true
% 0.11/0.38
% 0.11/0.38 % ------ Combination Options
% 0.11/0.38
% 0.11/0.38 % --comb_res_mult 1000
% 0.11/0.38 % --comb_inst_mult 300
% 0.11/0.38 % ------
% 0.11/0.38
% 0.11/0.38 % ------ Parsing...% successful
% 0.11/0.38
% 0.11/0.38 % ------ 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.11/0.38
% 0.11/0.38 % ------ Proving...
% 0.11/0.38 % ------ Problem Properties
% 0.11/0.38
% 0.11/0.38 %
% 0.11/0.38 % EPR false
% 0.11/0.38 % Horn false
% 0.11/0.38 % Has equality false
% 0.11/0.38
% 0.11/0.38 % % ------ Input Options Time Limit: Unbounded
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 % % ------ Current options:
% 0.11/0.38
% 0.11/0.38 % ------ Input Options
% 0.11/0.38
% 0.11/0.38 % --out_options all
% 0.11/0.38 % --tptp_safe_out true
% 0.11/0.38 % --problem_path ""
% 0.11/0.38 % --include_path ""
% 0.11/0.38 % --clausifier .//eprover
% 0.11/0.38 % --clausifier_options --tstp-format
% 0.11/0.38 % --stdin false
% 0.11/0.38 % --dbg_backtrace false
% 0.11/0.38 % --dbg_dump_prop_clauses false
% 0.11/0.38 % --dbg_dump_prop_clauses_file -
% 0.11/0.38 % --dbg_out_stat false
% 0.11/0.38
% 0.11/0.38 % ------ General Options
% 0.11/0.38
% 0.11/0.38 % --fof false
% 0.11/0.38 % --time_out_real 150.
% 0.11/0.38 % --time_out_prep_mult 0.2
% 0.11/0.38 % --time_out_virtual -1.
% 0.11/0.38 % --schedule none
% 0.11/0.38 % --ground_splitting input
% 0.11/0.38 % --splitting_nvd 16
% 0.11/0.38 % --non_eq_to_eq false
% 0.11/0.38 % --prep_gs_sim true
% 0.11/0.38 % --prep_unflatten false
% 0.11/0.38 % --prep_res_sim true
% 0.11/0.38 % --prep_upred true
% 0.11/0.38 % --res_sim_input true
% 0.11/0.38 % --clause_weak_htbl true
% 0.11/0.38 % --gc_record_bc_elim false
% 0.11/0.38 % --symbol_type_check false
% 0.11/0.38 % --clausify_out false
% 0.11/0.38 % --large_theory_mode false
% 0.11/0.38 % --prep_sem_filter none
% 0.11/0.38 % --prep_sem_filter_out false
% 0.11/0.38 % --preprocessed_out false
% 0.11/0.38 % --sub_typing false
% 0.11/0.38 % --brand_transform false
% 0.11/0.38 % --pure_diseq_elim true
% 0.11/0.38 % --min_unsat_core false
% 0.11/0.38 % --pred_elim true
% 0.11/0.38 % --add_important_lit false
% 0.11/0.38 % --soft_assumptions false
% 0.11/0.38 % --reset_solvers false
% 0.11/0.38 % --bc_imp_inh []
% 0.11/0.38 % --conj_cone_tolerance 1.5
% 0.11/0.38 % --prolific_symb_bound 500
% 0.11/0.38 % --lt_threshold 2000
% 0.11/0.38
% 0.11/0.38 % ------ SAT Options
% 0.11/0.38
% 0.11/0.38 % --sat_mode false
% 0.11/0.38 % --sat_fm_restart_options ""
% 0.11/0.38 % --sat_gr_def false
% 0.11/0.38 % --sat_epr_types true
% 0.11/0.38 % --sat_non_cyclic_types false
% 0.11/0.38 % --sat_finite_models false
% 0.11/0.38 % --sat_fm_lemmas false
% 0.11/0.38 % --sat_fm_prep false
% 0.11/0.38 % --sat_fm_uc_incr true
% 0.11/0.38 % --sat_out_model small
% 0.11/0.38 % --sat_out_clauses false
% 0.11/0.38
% 0.11/0.38 % ------ QBF Options
% 0.11/0.38
% 0.11/0.38 % --qbf_mode false
% 0.11/0.38 % --qbf_elim_univ true
% 0.11/0.38 % --qbf_sk_in true
% 0.11/0.38 % --qbf_pred_elim true
% 0.11/0.38 % --qbf_split 32
% 0.11/0.38
% 0.11/0.38 % ------ BMC1 Options
% 0.11/0.38
% 0.11/0.38 % --bmc1_incremental false
% 0.11/0.38 % --bmc1_axioms reachable_all
% 0.11/0.38 % --bmc1_min_bound 0
% 0.11/0.38 % --bmc1_max_bound -1
% 0.11/0.38 % --bmc1_max_bound_default -1
% 0.11/0.38 % --bmc1_symbol_reachability true
% 0.11/0.38 % --bmc1_property_lemmas false
% 0.11/0.38 % --bmc1_k_induction false
% 0.11/0.38 % --bmc1_non_equiv_states false
% 0.11/0.38 % --bmc1_deadlock false
% 0.11/0.38 % --bmc1_ucm false
% 0.11/0.38 % --bmc1_add_unsat_core none
% 0.11/0.38 % --bmc1_unsat_core_children false
% 0.11/0.38 % --bmc1_unsat_core_extrapolate_axioms false
% 0.11/0.38 % --bmc1_out_stat full
% 0.11/0.38 % --bmc1_ground_init false
% 0.11/0.38 % --bmc1_pre_inst_next_state false
% 0.11/0.38 % --bmc1_pre_inst_state false
% 0.11/0.38 % --bmc1_pre_inst_reach_state false
% 0.11/0.38 % --bmc1_out_unsat_core false
% 0.11/0.38 % --bmc1_aig_witness_out false
% 0.11/0.38 % --bmc1_verbose false
% 0.11/0.38 % --bmc1_dump_clauses_tptp false
% 0.11/0.38 % --bmc1_dump_unsat_core_tptp false
% 0.11/0.38 % --bmc1_dump_file -
% 0.11/0.38 % --bmc1_ucm_expand_uc_limit 128
% 0.11/0.38 % --bmc1_ucm_n_expand_iterations 6
% 0.11/0.38 % --bmc1_ucm_extend_mode 1
% 0.11/0.38 % --bmc1_ucm_init_mode 2
% 0.11/0.38 % --bmc1_ucm_cone_mode none
% 0.11/0.38 % --bmc1_ucm_reduced_relation_type 0
% 0.11/0.38 % --bmc1_ucm_relax_model 4
% 0.11/0.38 % --bmc1_ucm_full_tr_after_sat true
% 0.11/0.38 % --bmc1_ucm_expand_neg_assumptions false
% 0.11/0.38 % --bmc1_ucm_layered_model none
% 0.11/0.38 % --bmc1_ucm_max_lemma_size 10
% 0.11/0.38
% 0.11/0.38 % ------ AIG Options
% 0.11/0.38
% 0.11/0.38 % --aig_mode false
% 0.11/0.38
% 0.11/0.38 % ------ Instantiation Options
% 0.11/0.38
% 0.11/0.38 % --instantiation_flag true
% 0.11/0.38 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.11/0.38 % --inst_solver_per_active 750
% 0.11/0.38 % --inst_solver_calls_frac 0.5
% 0.11/0.38 % --inst_passive_queue_type priority_queues
% 0.11/0.38 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.11/0.38 % --inst_passive_queues_freq [25;2]
% 0.11/0.38 % --inst_dismatching true
% 0.11/0.38 % --inst_eager_unprocessed_to_passive true
% 0.11/0.38 % --inst_prop_sim_given true
% 0.11/0.39 % --inst_prop_sim_new false
% 0.11/0.39 % --inst_orphan_elimination true
% 0.11/0.39 % --inst_learning_loop_flag true
% 0.11/0.39 % --inst_learning_start 3000
% 0.11/0.39 % --inst_learning_factor 2
% 0.11/0.39 % --inst_start_prop_sim_after_learn 3
% 0.11/0.39 % --inst_sel_renew solver
% 0.11/0.39 % --inst_lit_activity_flag true
% 0.11/0.39 % --inst_out_proof true
% 0.11/0.39
% 0.11/0.39 % ------ Resolution Options
% 0.11/0.39
% 0.11/0.39 % --resolution_flag true
% 0.11/0.39 % --res_lit_sel kbo_max
% 0.11/0.39 % --res_to_prop_solver none
% 0.11/0.39 % --res_prop_simpl_new false
% 0.11/0.39 % --res_prop_simpl_given false
% 0.11/0.39 % --res_passive_queue_type priority_queues
% 0.11/0.39 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.11/0.39 % --res_passive_queues_freq [15;5]
% 0.11/0.39 % --res_forward_subs full
% 0.11/0.39 % --res_backward_subs full
% 0.11/0.39 % --res_forward_subs_resolution true
% 0.11/0.39 % --res_backward_subs_resolution true
% 0.11/0.39 % --res_orphan_elimination false
% 0.11/0.39 % --res_time_limit 1000.
% 0.11/0.39 % --res_out_proof true
% 0.11/0.39 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e57283.s
% 0.11/0.39 % --modulo true
% 0.11/0.39
% 0.11/0.39 % ------ Combination Options
% 0.11/0.39
% 0.11/0.39 % --comb_res_mult 1000
% 0.11/0.39 % --comb_inst_mult 300
% 0.11/0.39 % ------
% 0.11/0.39
% 0.11/0.39
% 0.11/0.39
% 0.11/0.39 % ------ Proving...
% 0.11/0.39 %
% 0.11/0.39
% 0.11/0.39
% 0.11/0.39 % Resolution empty clause
% 0.11/0.39
% 0.11/0.39 % ------ Statistics
% 0.11/0.39
% 0.11/0.39 % ------ General
% 0.11/0.39
% 0.11/0.39 % num_of_input_clauses: 95
% 0.11/0.39 % num_of_input_neg_conjectures: 2
% 0.11/0.39 % num_of_splits: 0
% 0.11/0.39 % num_of_split_atoms: 0
% 0.11/0.39 % num_of_sem_filtered_clauses: 0
% 0.11/0.39 % num_of_subtypes: 0
% 0.11/0.39 % monotx_restored_types: 0
% 0.11/0.39 % sat_num_of_epr_types: 0
% 0.11/0.39 % sat_num_of_non_cyclic_types: 0
% 0.11/0.39 % sat_guarded_non_collapsed_types: 0
% 0.11/0.39 % is_epr: 0
% 0.11/0.39 % is_horn: 0
% 0.11/0.39 % has_eq: 0
% 0.11/0.39 % num_pure_diseq_elim: 0
% 0.11/0.39 % simp_replaced_by: 0
% 0.11/0.39 % res_preprocessed: 4
% 0.11/0.39 % prep_upred: 0
% 0.11/0.39 % prep_unflattend: 0
% 0.11/0.39 % pred_elim_cands: 0
% 0.11/0.39 % pred_elim: 0
% 0.11/0.39 % pred_elim_cl: 0
% 0.11/0.39 % pred_elim_cycles: 0
% 0.11/0.39 % forced_gc_time: 0
% 0.11/0.39 % gc_basic_clause_elim: 0
% 0.11/0.39 % parsing_time: 0.003
% 0.11/0.39 % sem_filter_time: 0.
% 0.11/0.39 % pred_elim_time: 0.
% 0.11/0.39 % out_proof_time: 0.002
% 0.11/0.39 % monotx_time: 0.
% 0.11/0.39 % subtype_inf_time: 0.
% 0.11/0.39 % unif_index_cands_time: 0.
% 0.11/0.39 % unif_index_add_time: 0.
% 0.11/0.39 % total_time: 0.024
% 0.11/0.39 % num_of_symbols: 42
% 0.11/0.39 % num_of_terms: 241
% 0.11/0.39
% 0.11/0.39 % ------ Propositional Solver
% 0.11/0.39
% 0.11/0.39 % prop_solver_calls: 1
% 0.11/0.39 % prop_fast_solver_calls: 6
% 0.11/0.39 % prop_num_of_clauses: 49
% 0.11/0.39 % prop_preprocess_simplified: 343
% 0.11/0.39 % prop_fo_subsumed: 0
% 0.11/0.39 % prop_solver_time: 0.
% 0.11/0.39 % prop_fast_solver_time: 0.
% 0.11/0.39 % prop_unsat_core_time: 0.
% 0.11/0.39
% 0.11/0.39 % ------ QBF
% 0.11/0.39
% 0.11/0.39 % qbf_q_res: 0
% 0.11/0.39 % qbf_num_tautologies: 0
% 0.11/0.39 % qbf_prep_cycles: 0
% 0.11/0.39
% 0.11/0.39 % ------ BMC1
% 0.11/0.39
% 0.11/0.39 % bmc1_current_bound: -1
% 0.11/0.39 % bmc1_last_solved_bound: -1
% 0.11/0.39 % bmc1_unsat_core_size: -1
% 0.11/0.39 % bmc1_unsat_core_parents_size: -1
% 0.11/0.39 % bmc1_merge_next_fun: 0
% 0.11/0.39 % bmc1_unsat_core_clauses_time: 0.
% 0.11/0.39
% 0.11/0.39 % ------ Instantiation
% 0.11/0.39
% 0.11/0.39 % inst_num_of_clauses: 95
% 0.11/0.39 % inst_num_in_passive: 0
% 0.11/0.39 % inst_num_in_active: 0
% 0.11/0.39 % inst_num_in_unprocessed: 95
% 0.11/0.39 % inst_num_of_loops: 0
% 0.11/0.39 % inst_num_of_learning_restarts: 0
% 0.11/0.39 % inst_num_moves_active_passive: 0
% 0.11/0.39 % inst_lit_activity: 0
% 0.11/0.39 % inst_lit_activity_moves: 0
% 0.11/0.39 % inst_num_tautologies: 0
% 0.11/0.39 % inst_num_prop_implied: 0
% 0.11/0.39 % inst_num_existing_simplified: 0
% 0.11/0.39 % inst_num_eq_res_simplified: 0
% 0.11/0.39 % inst_num_child_elim: 0
% 0.11/0.39 % inst_num_of_dismatching_blockings: 0
% 0.11/0.39 % inst_num_of_non_proper_insts: 0
% 0.11/0.39 % inst_num_of_duplicates: 0
% 0.11/0.39 % inst_inst_num_from_inst_to_res: 0
% 0.11/0.39 % inst_dismatching_checking_time: 0.
% 0.11/0.39
% 0.11/0.39 % ------ Resolution
% 0.11/0.39
% 0.11/0.39 % res_num_of_clauses: 148
% 0.11/0.39 % res_num_in_passive: 6
% 0.11/0.39 % res_num_in_active: 67
% 0.11/0.39 % res_num_of_loops: 58
% 0.11/0.39 % res_forward_subset_subsumed: 102
% 0.11/0.39 % res_backward_subset_subsumed: 13
% 0.11/0.39 % res_forward_subsumed: 9
% 0.11/0.39 % res_backward_subsumed: 1
% 0.11/0.39 % res_forward_subsumption_resolution: 14
% 0.11/0.39 % res_backward_subsumption_resolution: 7
% 0.11/0.39 % res_clause_to_clause_subsumption: 85
% 0.11/0.39 % res_orphan_elimination: 0
% 0.11/0.39 % res_tautology_del: 3
% 0.11/0.39 % res_num_eq_res_simplified: 0
% 0.11/0.39 % res_num_sel_changes: 0
% 0.11/0.39 % res_moves_from_active_to_pass: 0
% 0.11/0.39
% 0.11/0.39 % Status Unsatisfiable
% 0.11/0.39 % SZS status Unsatisfiable
% 0.11/0.39 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------