TSTP Solution File: KRS015-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : KRS015-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n018.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:46 EDT 2022
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 37
% Syntax : Number of formulae : 287 ( 30 unt; 0 def)
% Number of atoms : 981 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 1203 ( 509 ~; 694 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-1 aty)
% Number of variables : 428 ( 64 sgn 123 !; 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,
! [X5,X1] :
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X5) ),
file('<stdin>',clause_26) ).
fof(c_0_1,axiom,
! [X5,X1] :
( e(X1)
| r(X1,u4r1(X1))
| ~ d(u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X5) ),
file('<stdin>',clause_24) ).
fof(c_0_2,axiom,
! [X5,X1] :
( e(X1)
| s(X1,u4r2(X1))
| ~ c(u4r1(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X5) ),
file('<stdin>',clause_22) ).
fof(c_0_3,axiom,
! [X5,X1] :
( e(X1)
| ~ c(u4r1(X1))
| ~ d(u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X5) ),
file('<stdin>',clause_20) ).
fof(c_0_4,axiom,
! [X5,X1] :
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ r(X1,X5) ),
file('<stdin>',clause_25) ).
fof(c_0_5,axiom,
! [X5,X1] :
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ d(u4r2(X1))
| ~ r(X1,X5) ),
file('<stdin>',clause_23) ).
fof(c_0_6,axiom,
! [X5,X1] :
( e(X1)
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ c(u4r1(X1))
| ~ r(X1,X5) ),
file('<stdin>',clause_21) ).
fof(c_0_7,axiom,
! [X5,X1] :
( e(X1)
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ c(u4r1(X1))
| ~ d(u4r2(X1))
| ~ r(X1,X5) ),
file('<stdin>',clause_19) ).
fof(c_0_8,axiom,
! [X2,X3,X1] :
( equalish(X2,X3)
| ~ t1most(X1)
| ~ t(X1,X2)
| ~ t(X1,X3) ),
file('<stdin>',clause_10) ).
fof(c_0_9,axiom,
! [X2,X3,X1] :
( t2least(X1)
| equalish(X2,X3)
| ~ t(X1,X2)
| ~ t(X1,X3) ),
file('<stdin>',clause_7) ).
fof(c_0_10,axiom,
! [X1] :
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('<stdin>',clause_4) ).
fof(c_0_11,axiom,
! [X1] :
( t1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
file('<stdin>',clause_11) ).
fof(c_0_12,axiom,
! [X4,X1] :
( r(X1,X4)
| ~ e(X1)
| ~ s(X1,X4) ),
file('<stdin>',clause_16) ).
fof(c_0_13,axiom,
! [X4,X1] :
( s(X1,X4)
| ~ e(X1)
| ~ r(X1,X4) ),
file('<stdin>',clause_15) ).
fof(c_0_14,axiom,
! [X3,X1] :
( c(X3)
| ~ e(X1)
| ~ r(X1,X3) ),
file('<stdin>',clause_18) ).
fof(c_0_15,axiom,
! [X2,X1] :
( d(X2)
| ~ e(X1)
| ~ s(X1,X2) ),
file('<stdin>',clause_17) ).
fof(c_0_16,axiom,
! [X1] :
( r(X1,u4r4(X1))
| ~ e(X1) ),
file('<stdin>',clause_14) ).
fof(c_0_17,axiom,
! [X1] :
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
file('<stdin>',clause_6) ).
fof(c_0_18,axiom,
! [X1] :
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
file('<stdin>',clause_5) ).
fof(c_0_19,axiom,
! [X1] :
( t1most(X1)
| t(X1,u3r2(X1)) ),
file('<stdin>',clause_13) ).
fof(c_0_20,axiom,
! [X1] :
( t1most(X1)
| t(X1,u3r1(X1)) ),
file('<stdin>',clause_12) ).
fof(c_0_21,axiom,
! [X1] :
( d(X1)
| ~ t1most(X1) ),
file('<stdin>',clause_9) ).
fof(c_0_22,axiom,
! [X1] :
( t1most(X1)
| ~ d(X1) ),
file('<stdin>',clause_8) ).
fof(c_0_23,axiom,
! [X1] :
( c(X1)
| ~ t2least(X1) ),
file('<stdin>',clause_3) ).
fof(c_0_24,axiom,
! [X1] :
( t2least(X1)
| ~ c(X1) ),
file('<stdin>',clause_2) ).
fof(c_0_25,plain,
! [X5,X1] :
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_26,plain,
! [X5,X1] :
( e(X1)
| r(X1,u4r1(X1))
| ~ d(u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_27,plain,
! [X5,X1] :
( e(X1)
| s(X1,u4r2(X1))
| ~ c(u4r1(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_28,plain,
! [X5,X1] :
( e(X1)
| ~ c(u4r1(X1))
| ~ d(u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_29,plain,
! [X5,X1] :
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ r(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_30,plain,
! [X5,X1] :
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ d(u4r2(X1))
| ~ r(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_31,plain,
! [X5,X1] :
( e(X1)
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ c(u4r1(X1))
| ~ r(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_32,plain,
! [X5,X1] :
( e(X1)
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ c(u4r1(X1))
| ~ d(u4r2(X1))
| ~ r(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_33,plain,
! [X2,X3,X1] :
( equalish(X2,X3)
| ~ t1most(X1)
| ~ t(X1,X2)
| ~ t(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_34,plain,
! [X2,X3,X1] :
( t2least(X1)
| equalish(X2,X3)
| ~ t(X1,X2)
| ~ t(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_35,plain,
! [X1] :
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_36,plain,
! [X1] :
( t1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_37,plain,
! [X4,X1] :
( r(X1,X4)
| ~ e(X1)
| ~ s(X1,X4) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_38,plain,
! [X4,X1] :
( s(X1,X4)
| ~ e(X1)
| ~ r(X1,X4) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_39,plain,
! [X3,X1] :
( c(X3)
| ~ e(X1)
| ~ r(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_40,plain,
! [X2,X1] :
( d(X2)
| ~ e(X1)
| ~ s(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_41,plain,
! [X1] :
( r(X1,u4r4(X1))
| ~ e(X1) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_42,plain,
! [X1] :
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_43,plain,
! [X1] :
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_44,axiom,
! [X1] :
( t1most(X1)
| t(X1,u3r2(X1)) ),
c_0_19 ).
fof(c_0_45,axiom,
! [X1] :
( t1most(X1)
| t(X1,u3r1(X1)) ),
c_0_20 ).
fof(c_0_46,plain,
! [X1] :
( d(X1)
| ~ t1most(X1) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_47,plain,
! [X1] :
( t1most(X1)
| ~ d(X1) ),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_48,plain,
! [X1] :
( c(X1)
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
fof(c_0_49,plain,
! [X1] :
( t2least(X1)
| ~ c(X1) ),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
fof(c_0_50,plain,
! [X6,X7] :
( e(X7)
| r(X7,u4r1(X7))
| s(X7,u4r2(X7))
| ~ r(X7,u4r3(X7))
| ~ s(X7,u4r3(X7))
| ~ r(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_51,plain,
! [X6,X7] :
( e(X7)
| r(X7,u4r1(X7))
| ~ d(u4r2(X7))
| ~ r(X7,u4r3(X7))
| ~ s(X7,u4r3(X7))
| ~ r(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_52,plain,
! [X6,X7] :
( e(X7)
| s(X7,u4r2(X7))
| ~ c(u4r1(X7))
| ~ r(X7,u4r3(X7))
| ~ s(X7,u4r3(X7))
| ~ r(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_53,plain,
! [X6,X7] :
( e(X7)
| ~ c(u4r1(X7))
| ~ d(u4r2(X7))
| ~ r(X7,u4r3(X7))
| ~ s(X7,u4r3(X7))
| ~ r(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_54,plain,
! [X6,X7] :
( e(X7)
| r(X7,u4r1(X7))
| s(X7,u4r2(X7))
| s(X7,u4r3(X7))
| r(X7,u4r3(X7))
| ~ r(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_55,plain,
! [X6,X7] :
( e(X7)
| r(X7,u4r1(X7))
| s(X7,u4r3(X7))
| r(X7,u4r3(X7))
| ~ d(u4r2(X7))
| ~ r(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_56,plain,
! [X6,X7] :
( e(X7)
| s(X7,u4r2(X7))
| s(X7,u4r3(X7))
| r(X7,u4r3(X7))
| ~ c(u4r1(X7))
| ~ r(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_57,plain,
! [X6,X7] :
( e(X7)
| s(X7,u4r3(X7))
| r(X7,u4r3(X7))
| ~ c(u4r1(X7))
| ~ d(u4r2(X7))
| ~ r(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_58,plain,
! [X4,X5,X6] :
( equalish(X4,X5)
| ~ t1most(X6)
| ~ t(X6,X4)
| ~ t(X6,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_33])])]) ).
fof(c_0_59,plain,
! [X4,X5,X6] :
( t2least(X6)
| equalish(X4,X5)
| ~ t(X6,X4)
| ~ t(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_60,plain,
! [X2] :
( ~ t2least(X2)
| ~ equalish(u1r2(X2),u1r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_61,plain,
! [X2] :
( t1most(X2)
| ~ equalish(u3r2(X2),u3r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_62,plain,
! [X5,X6] :
( r(X6,X5)
| ~ e(X6)
| ~ s(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_63,plain,
! [X5,X6] :
( s(X6,X5)
| ~ e(X6)
| ~ r(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_64,plain,
! [X4,X5] :
( c(X4)
| ~ e(X5)
| ~ r(X5,X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_39])])]) ).
fof(c_0_65,plain,
! [X3,X4] :
( d(X3)
| ~ e(X4)
| ~ s(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_40])])]) ).
fof(c_0_66,plain,
! [X2] :
( r(X2,u4r4(X2))
| ~ e(X2) ),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_67,plain,
! [X2] :
( t(X2,u1r2(X2))
| ~ t2least(X2) ),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_68,plain,
! [X2] :
( t(X2,u1r1(X2))
| ~ t2least(X2) ),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_69,plain,
! [X2] :
( t1most(X2)
| t(X2,u3r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_44]) ).
fof(c_0_70,plain,
! [X2] :
( t1most(X2)
| t(X2,u3r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_45]) ).
fof(c_0_71,plain,
! [X2] :
( d(X2)
| ~ t1most(X2) ),
inference(variable_rename,[status(thm)],[c_0_46]) ).
fof(c_0_72,plain,
! [X2] :
( t1most(X2)
| ~ d(X2) ),
inference(variable_rename,[status(thm)],[c_0_47]) ).
fof(c_0_73,plain,
! [X2] :
( c(X2)
| ~ t2least(X2) ),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_74,plain,
! [X2] :
( t2least(X2)
| ~ c(X2) ),
inference(variable_rename,[status(thm)],[c_0_49]) ).
cnf(c_0_75,plain,
( s(X1,u4r2(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_76,plain,
( r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_77,plain,
( s(X1,u4r2(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ c(u4r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_78,plain,
( e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_79,plain,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| s(X1,u4r2(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_80,plain,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_81,plain,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| s(X1,u4r2(X1))
| e(X1)
| ~ r(X1,X2)
| ~ c(u4r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_82,plain,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_83,plain,
( equalish(X3,X2)
| ~ t(X1,X2)
| ~ t(X1,X3)
| ~ t1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_84,plain,
( equalish(X3,X2)
| t2least(X1)
| ~ t(X1,X2)
| ~ t(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_85,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_86,plain,
( t1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_87,plain,
( r(X1,X2)
| ~ s(X1,X2)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_88,plain,
( s(X1,X2)
| ~ r(X1,X2)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_89,plain,
( c(X2)
| ~ r(X1,X2)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_90,plain,
( d(X2)
| ~ s(X1,X2)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_91,plain,
( r(X1,u4r4(X1))
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_92,plain,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_93,plain,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_94,plain,
( t(X1,u3r2(X1))
| t1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_95,plain,
( t(X1,u3r1(X1))
| t1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_96,plain,
( d(X1)
| ~ t1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_97,plain,
( t1most(X1)
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_98,plain,
( c(X1)
| ~ t2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_99,plain,
( t2least(X1)
| ~ c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_100,plain,
( s(X1,u4r2(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1)) ),
c_0_75,
[final] ).
cnf(c_0_101,plain,
( r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1)) ),
c_0_76,
[final] ).
cnf(c_0_102,plain,
( s(X1,u4r2(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ c(u4r1(X1)) ),
c_0_77,
[final] ).
cnf(c_0_103,plain,
( e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
c_0_78,
[final] ).
cnf(c_0_104,plain,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| s(X1,u4r2(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2) ),
c_0_79,
[final] ).
cnf(c_0_105,plain,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1)) ),
c_0_80,
[final] ).
cnf(c_0_106,plain,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| s(X1,u4r2(X1))
| e(X1)
| ~ r(X1,X2)
| ~ c(u4r1(X1)) ),
c_0_81,
[final] ).
cnf(c_0_107,plain,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
c_0_82,
[final] ).
cnf(c_0_108,plain,
( equalish(X3,X2)
| ~ t(X1,X2)
| ~ t(X1,X3)
| ~ t1most(X1) ),
c_0_83,
[final] ).
cnf(c_0_109,plain,
( equalish(X3,X2)
| t2least(X1)
| ~ t(X1,X2)
| ~ t(X1,X3) ),
c_0_84,
[final] ).
cnf(c_0_110,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
c_0_85,
[final] ).
cnf(c_0_111,plain,
( t1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
c_0_86,
[final] ).
cnf(c_0_112,plain,
( r(X1,X2)
| ~ s(X1,X2)
| ~ e(X1) ),
c_0_87,
[final] ).
cnf(c_0_113,plain,
( s(X1,X2)
| ~ r(X1,X2)
| ~ e(X1) ),
c_0_88,
[final] ).
cnf(c_0_114,plain,
( c(X2)
| ~ r(X1,X2)
| ~ e(X1) ),
c_0_89,
[final] ).
cnf(c_0_115,plain,
( d(X2)
| ~ s(X1,X2)
| ~ e(X1) ),
c_0_90,
[final] ).
cnf(c_0_116,plain,
( r(X1,u4r4(X1))
| ~ e(X1) ),
c_0_91,
[final] ).
cnf(c_0_117,plain,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
c_0_92,
[final] ).
cnf(c_0_118,plain,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
c_0_93,
[final] ).
cnf(c_0_119,plain,
( t(X1,u3r2(X1))
| t1most(X1) ),
c_0_94,
[final] ).
cnf(c_0_120,plain,
( t(X1,u3r1(X1))
| t1most(X1) ),
c_0_95,
[final] ).
cnf(c_0_121,plain,
( d(X1)
| ~ t1most(X1) ),
c_0_96,
[final] ).
cnf(c_0_122,plain,
( t1most(X1)
| ~ d(X1) ),
c_0_97,
[final] ).
cnf(c_0_123,plain,
( c(X1)
| ~ t2least(X1) ),
c_0_98,
[final] ).
cnf(c_0_124,plain,
( t2least(X1)
| ~ c(X1) ),
c_0_99,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_100_0,axiom,
( s(X1,u4r2(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_1,axiom,
( r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_2,axiom,
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_3,axiom,
( ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_4,axiom,
( ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| ~ r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_5,axiom,
( ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_101_0,axiom,
( r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_1,axiom,
( e(X1)
| r(X1,u4r1(X1))
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_2,axiom,
( ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_3,axiom,
( ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_4,axiom,
( ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_5,axiom,
( ~ d(u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_102_0,axiom,
( s(X1,u4r2(X1))
| e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_1,axiom,
( e(X1)
| s(X1,u4r2(X1))
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_2,axiom,
( ~ r(X1,X2)
| e(X1)
| s(X1,u4r2(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_3,axiom,
( ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| s(X1,u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_4,axiom,
( ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| s(X1,u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_5,axiom,
( ~ c(u4r1(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| s(X1,u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_103_0,axiom,
( e(X1)
| ~ r(X1,X2)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_103_1,axiom,
( ~ r(X1,X2)
| e(X1)
| ~ s(X1,u4r3(X1))
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_103_2,axiom,
( ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| ~ r(X1,u4r3(X1))
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_103_3,axiom,
( ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_103_4,axiom,
( ~ d(u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1)
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_103_5,axiom,
( ~ c(u4r1(X1))
| ~ d(u4r2(X1))
| ~ r(X1,u4r3(X1))
| ~ s(X1,u4r3(X1))
| ~ r(X1,X2)
| e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_104_0,axiom,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| s(X1,u4r2(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_1,axiom,
( s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| s(X1,u4r2(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_2,axiom,
( s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_3,axiom,
( r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| e(X1)
| ~ r(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_4,axiom,
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ r(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_5,axiom,
( ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_105_0,axiom,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_1,axiom,
( s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| r(X1,u4r1(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_2,axiom,
( r(X1,u4r1(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_3,axiom,
( e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ r(X1,X2)
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_4,axiom,
( ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ d(u4r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_5,axiom,
( ~ d(u4r2(X1))
| ~ r(X1,X2)
| e(X1)
| r(X1,u4r1(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_106_0,axiom,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| s(X1,u4r2(X1))
| e(X1)
| ~ r(X1,X2)
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_106_1,axiom,
( s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| s(X1,u4r2(X1))
| e(X1)
| ~ r(X1,X2)
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_106_2,axiom,
( s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| e(X1)
| ~ r(X1,X2)
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_106_3,axiom,
( e(X1)
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ r(X1,X2)
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_106_4,axiom,
( ~ r(X1,X2)
| e(X1)
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_106_5,axiom,
( ~ c(u4r1(X1))
| ~ r(X1,X2)
| e(X1)
| s(X1,u4r2(X1))
| s(X1,u4r3(X1))
| r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_107_0,axiom,
( r(X1,u4r3(X1))
| s(X1,u4r3(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_107_1,axiom,
( s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| e(X1)
| ~ r(X1,X2)
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_107_2,axiom,
( e(X1)
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ r(X1,X2)
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_107_3,axiom,
( ~ r(X1,X2)
| e(X1)
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ d(u4r2(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_107_4,axiom,
( ~ d(u4r2(X1))
| ~ r(X1,X2)
| e(X1)
| s(X1,u4r3(X1))
| r(X1,u4r3(X1))
| ~ c(u4r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_107_5,axiom,
( ~ c(u4r1(X1))
| ~ d(u4r2(X1))
| ~ r(X1,X2)
| e(X1)
| s(X1,u4r3(X1))
| r(X1,u4r3(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_108_0,axiom,
( equalish(X3,X2)
| ~ t(X1,X2)
| ~ t(X1,X3)
| ~ t1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_108_1,axiom,
( ~ t(X1,X2)
| equalish(X3,X2)
| ~ t(X1,X3)
| ~ t1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_108_2,axiom,
( ~ t(X1,X3)
| ~ t(X1,X2)
| equalish(X3,X2)
| ~ t1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_108_3,axiom,
( ~ t1most(X1)
| ~ t(X1,X3)
| ~ t(X1,X2)
| equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_109_0,axiom,
( equalish(X3,X2)
| t2least(X1)
| ~ t(X1,X2)
| ~ t(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_109_1,axiom,
( t2least(X1)
| equalish(X3,X2)
| ~ t(X1,X2)
| ~ t(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_109_2,axiom,
( ~ t(X1,X2)
| t2least(X1)
| equalish(X3,X2)
| ~ t(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_109_3,axiom,
( ~ t(X1,X3)
| ~ t(X1,X2)
| t2least(X1)
| equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_110_0,axiom,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_110_1,axiom,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_111_0,axiom,
( t1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_1,axiom,
( ~ equalish(u3r2(X1),u3r1(X1))
| t1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_112_0,axiom,
( r(X1,X2)
| ~ s(X1,X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_1,axiom,
( ~ s(X1,X2)
| r(X1,X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_2,axiom,
( ~ e(X1)
| ~ s(X1,X2)
| r(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_113_0,axiom,
( s(X1,X2)
| ~ r(X1,X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_113_1,axiom,
( ~ r(X1,X2)
| s(X1,X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_113_2,axiom,
( ~ e(X1)
| ~ r(X1,X2)
| s(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_114_0,axiom,
( c(X2)
| ~ r(X1,X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_114_1,axiom,
( ~ r(X1,X2)
| c(X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_114_2,axiom,
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_115_0,axiom,
( d(X2)
| ~ s(X1,X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_1,axiom,
( ~ s(X1,X2)
| d(X2)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_2,axiom,
( ~ e(X1)
| ~ s(X1,X2)
| d(X2) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_116_0,axiom,
( r(X1,u4r4(X1))
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_1,axiom,
( ~ e(X1)
| r(X1,u4r4(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_117_0,axiom,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_1,axiom,
( ~ t2least(X1)
| t(X1,u1r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_118_0,axiom,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_1,axiom,
( ~ t2least(X1)
| t(X1,u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_119_0,axiom,
( t(X1,u3r2(X1))
| t1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_1,axiom,
( t1most(X1)
| t(X1,u3r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_120_0,axiom,
( t(X1,u3r1(X1))
| t1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_1,axiom,
( t1most(X1)
| t(X1,u3r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_121_0,axiom,
( d(X1)
| ~ t1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_1,axiom,
( ~ t1most(X1)
| d(X1) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_122_0,axiom,
( t1most(X1)
| ~ d(X1) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_1,axiom,
( ~ d(X1)
| t1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_123_0,axiom,
( c(X1)
| ~ t2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_123_1,axiom,
( ~ t2least(X1)
| c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_124_0,axiom,
( t2least(X1)
| ~ c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_124_1,axiom,
( ~ c(X1)
| t2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
e(exist),
file('<stdin>',clause_1) ).
fof(c_0_1_002,negated_conjecture,
e(exist),
c_0_0 ).
fof(c_0_2_003,negated_conjecture,
e(exist),
c_0_1 ).
cnf(c_0_3_004,negated_conjecture,
e(exist),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
e(exist),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_90,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_4) ).
cnf(c_108,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_112,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_113,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_112]) ).
cnf(c_114,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_113]) ).
cnf(c_386,plain,
e(exist),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_21,plain,
( c(X0)
| ~ r(X1,X0)
| ~ e(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_114_2) ).
cnf(c_248,plain,
( c(X0)
| ~ r(X1,X0)
| ~ e(X1) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_249,plain,
( c(X0)
| ~ e(X1)
| ~ r(X1,X0) ),
inference(rewriting,[status(thm)],[c_248]) ).
cnf(c_396,plain,
( c(X0)
| ~ r(exist,X0) ),
inference(resolution,[status(thm)],[c_386,c_249]) ).
cnf(c_399,plain,
( c(X0)
| ~ r(exist,X0) ),
inference(rewriting,[status(thm)],[c_396]) ).
cnf(c_16,plain,
( r(X0,u4r4(X0))
| ~ e(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_116_1) ).
cnf(c_238,plain,
( r(X0,u4r4(X0))
| ~ e(X0) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_239,plain,
( ~ e(X0)
| r(X0,u4r4(X0)) ),
inference(rewriting,[status(thm)],[c_238]) ).
cnf(c_392,plain,
r(exist,u4r4(exist)),
inference(resolution,[status(thm)],[c_386,c_239]) ).
cnf(c_393,plain,
r(exist,u4r4(exist)),
inference(rewriting,[status(thm)],[c_392]) ).
cnf(c_412,plain,
c(u4r4(exist)),
inference(resolution,[status(thm)],[c_399,c_393]) ).
cnf(c_413,plain,
c(u4r4(exist)),
inference(rewriting,[status(thm)],[c_412]) ).
cnf(c_0,plain,
( t2least(X0)
| ~ c(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_124_1) ).
cnf(c_206,plain,
( t2least(X0)
| ~ c(X0) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_207,plain,
( ~ c(X0)
| t2least(X0) ),
inference(rewriting,[status(thm)],[c_206]) ).
cnf(c_428,plain,
t2least(u4r4(exist)),
inference(resolution,[status(thm)],[c_413,c_207]) ).
cnf(c_429,plain,
t2least(u4r4(exist)),
inference(rewriting,[status(thm)],[c_428]) ).
cnf(c_12,plain,
( t(X0,u1r1(X0))
| ~ t2least(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_118_1) ).
cnf(c_230,plain,
( t(X0,u1r1(X0))
| ~ t2least(X0) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_231,plain,
( ~ t2least(X0)
| t(X0,u1r1(X0)) ),
inference(rewriting,[status(thm)],[c_230]) ).
cnf(c_444,plain,
t(u4r4(exist),u1r1(u4r4(exist))),
inference(resolution,[status(thm)],[c_429,c_231]) ).
cnf(c_447,plain,
t(u4r4(exist),u1r1(u4r4(exist))),
inference(rewriting,[status(thm)],[c_444]) ).
cnf(c_40,plain,
( ~ t1most(X0)
| ~ t(X0,X1)
| equalish(X1,X2)
| ~ t(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_108_1) ).
cnf(c_286,plain,
( ~ t1most(X0)
| ~ t(X0,X1)
| equalish(X1,X2)
| ~ t(X0,X2) ),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_287,plain,
( ~ t1most(X0)
| ~ t(X0,X1)
| ~ t(X0,X2)
| equalish(X1,X2) ),
inference(rewriting,[status(thm)],[c_286]) ).
cnf(c_458,plain,
( ~ t1most(u4r4(exist))
| ~ t(u4r4(exist),X0)
| equalish(X0,u1r1(u4r4(exist))) ),
inference(resolution,[status(thm)],[c_447,c_287]) ).
cnf(c_461,plain,
( ~ t1most(u4r4(exist))
| ~ t(u4r4(exist),X0)
| equalish(X0,u1r1(u4r4(exist))) ),
inference(rewriting,[status(thm)],[c_458]) ).
cnf(c_24,plain,
( s(X0,X1)
| ~ r(X0,X1)
| ~ e(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_113_2) ).
cnf(c_254,plain,
( s(X0,X1)
| ~ r(X0,X1)
| ~ e(X0) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_255,plain,
( ~ e(X0)
| ~ r(X0,X1)
| s(X0,X1) ),
inference(rewriting,[status(thm)],[c_254]) ).
cnf(c_391,plain,
( ~ r(exist,X0)
| s(exist,X0) ),
inference(resolution,[status(thm)],[c_386,c_255]) ).
cnf(c_394,plain,
( ~ r(exist,X0)
| s(exist,X0) ),
inference(rewriting,[status(thm)],[c_391]) ).
cnf(c_18,plain,
( d(X0)
| ~ s(X1,X0)
| ~ e(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_115_2) ).
cnf(c_242,plain,
( d(X0)
| ~ s(X1,X0)
| ~ e(X1) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_243,plain,
( d(X0)
| ~ e(X1)
| ~ s(X1,X0) ),
inference(rewriting,[status(thm)],[c_242]) ).
cnf(c_397,plain,
( d(X0)
| ~ s(exist,X0) ),
inference(resolution,[status(thm)],[c_386,c_243]) ).
cnf(c_398,plain,
( d(X0)
| ~ s(exist,X0) ),
inference(rewriting,[status(thm)],[c_397]) ).
cnf(c_418,plain,
( d(X0)
| ~ r(exist,X0) ),
inference(resolution,[status(thm)],[c_394,c_398]) ).
cnf(c_419,plain,
( d(X0)
| ~ r(exist,X0) ),
inference(rewriting,[status(thm)],[c_418]) ).
cnf(c_434,plain,
d(u4r4(exist)),
inference(resolution,[status(thm)],[c_419,c_393]) ).
cnf(c_435,plain,
d(u4r4(exist)),
inference(rewriting,[status(thm)],[c_434]) ).
cnf(c_4,plain,
( t1most(X0)
| ~ d(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_122_1) ).
cnf(c_214,plain,
( t1most(X0)
| ~ d(X0) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_215,plain,
( ~ d(X0)
| t1most(X0) ),
inference(rewriting,[status(thm)],[c_214]) ).
cnf(c_438,plain,
t1most(u4r4(exist)),
inference(resolution,[status(thm)],[c_435,c_215]) ).
cnf(c_439,plain,
t1most(u4r4(exist)),
inference(rewriting,[status(thm)],[c_438]) ).
cnf(c_477,plain,
( ~ t(u4r4(exist),X0)
| equalish(X0,u1r1(u4r4(exist))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_461,c_439]) ).
cnf(c_478,plain,
( ~ t(u4r4(exist),X0)
| equalish(X0,u1r1(u4r4(exist))) ),
inference(rewriting,[status(thm)],[c_477]) ).
cnf(c_32,plain,
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ t2least(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_110_1) ).
cnf(c_270,plain,
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ t2least(X0) ),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_271,plain,
( ~ t2least(X0)
| ~ equalish(u1r2(X0),u1r1(X0)) ),
inference(rewriting,[status(thm)],[c_270]) ).
cnf(c_442,plain,
~ equalish(u1r2(u4r4(exist)),u1r1(u4r4(exist))),
inference(resolution,[status(thm)],[c_429,c_271]) ).
cnf(c_449,plain,
~ equalish(u1r2(u4r4(exist)),u1r1(u4r4(exist))),
inference(rewriting,[status(thm)],[c_442]) ).
cnf(c_481,plain,
~ t(u4r4(exist),u1r2(u4r4(exist))),
inference(resolution,[status(thm)],[c_478,c_449]) ).
cnf(c_482,plain,
~ t(u4r4(exist),u1r2(u4r4(exist))),
inference(rewriting,[status(thm)],[c_481]) ).
cnf(c_14,plain,
( t(X0,u1r2(X0))
| ~ t2least(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p',c_0_117_1) ).
cnf(c_234,plain,
( t(X0,u1r2(X0))
| ~ t2least(X0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_235,plain,
( ~ t2least(X0)
| t(X0,u1r2(X0)) ),
inference(rewriting,[status(thm)],[c_234]) ).
cnf(c_443,plain,
t(u4r4(exist),u1r2(u4r4(exist))),
inference(resolution,[status(thm)],[c_429,c_235]) ).
cnf(c_448,plain,
t(u4r4(exist),u1r2(u4r4(exist))),
inference(rewriting,[status(thm)],[c_443]) ).
cnf(c_491,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_482,c_448]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS015-1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.11 % Command : iprover_modulo %s %d
% 0.13/0.32 % Computer : n018.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Tue Jun 7 05:50:20 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % Running in mono-core mode
% 0.13/0.38 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.38 % Orientation found
% 0.13/0.38 % 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/sandbox2/tmp/iprover_proof_09d458.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_88ea77 | grep -v "SZS"
% 0.18/0.41
% 0.18/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % ------ iProver source info
% 0.18/0.41
% 0.18/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.18/0.41 % git: non_committed_changes: true
% 0.18/0.41 % git: last_make_outside_of_git: true
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % ------ Input Options
% 0.18/0.41
% 0.18/0.41 % --out_options all
% 0.18/0.41 % --tptp_safe_out true
% 0.18/0.41 % --problem_path ""
% 0.18/0.41 % --include_path ""
% 0.18/0.41 % --clausifier .//eprover
% 0.18/0.41 % --clausifier_options --tstp-format
% 0.18/0.41 % --stdin false
% 0.18/0.41 % --dbg_backtrace false
% 0.18/0.41 % --dbg_dump_prop_clauses false
% 0.18/0.41 % --dbg_dump_prop_clauses_file -
% 0.18/0.41 % --dbg_out_stat false
% 0.18/0.41
% 0.18/0.41 % ------ General Options
% 0.18/0.41
% 0.18/0.41 % --fof false
% 0.18/0.41 % --time_out_real 150.
% 0.18/0.41 % --time_out_prep_mult 0.2
% 0.18/0.41 % --time_out_virtual -1.
% 0.18/0.41 % --schedule none
% 0.18/0.41 % --ground_splitting input
% 0.18/0.41 % --splitting_nvd 16
% 0.18/0.41 % --non_eq_to_eq false
% 0.18/0.41 % --prep_gs_sim true
% 0.18/0.41 % --prep_unflatten false
% 0.18/0.41 % --prep_res_sim true
% 0.18/0.41 % --prep_upred true
% 0.18/0.41 % --res_sim_input true
% 0.18/0.41 % --clause_weak_htbl true
% 0.18/0.41 % --gc_record_bc_elim false
% 0.18/0.41 % --symbol_type_check false
% 0.18/0.41 % --clausify_out false
% 0.18/0.41 % --large_theory_mode false
% 0.18/0.41 % --prep_sem_filter none
% 0.18/0.41 % --prep_sem_filter_out false
% 0.18/0.41 % --preprocessed_out false
% 0.18/0.41 % --sub_typing false
% 0.18/0.41 % --brand_transform false
% 0.18/0.41 % --pure_diseq_elim true
% 0.18/0.41 % --min_unsat_core false
% 0.18/0.41 % --pred_elim true
% 0.18/0.41 % --add_important_lit false
% 0.18/0.41 % --soft_assumptions false
% 0.18/0.41 % --reset_solvers false
% 0.18/0.41 % --bc_imp_inh []
% 0.18/0.41 % --conj_cone_tolerance 1.5
% 0.18/0.41 % --prolific_symb_bound 500
% 0.18/0.41 % --lt_threshold 2000
% 0.18/0.41
% 0.18/0.41 % ------ SAT Options
% 0.18/0.41
% 0.18/0.41 % --sat_mode false
% 0.18/0.41 % --sat_fm_restart_options ""
% 0.18/0.41 % --sat_gr_def false
% 0.18/0.41 % --sat_epr_types true
% 0.18/0.41 % --sat_non_cyclic_types false
% 0.18/0.41 % --sat_finite_models false
% 0.18/0.41 % --sat_fm_lemmas false
% 0.18/0.41 % --sat_fm_prep false
% 0.18/0.41 % --sat_fm_uc_incr true
% 0.18/0.41 % --sat_out_model small
% 0.18/0.41 % --sat_out_clauses false
% 0.18/0.41
% 0.18/0.41 % ------ QBF Options
% 0.18/0.41
% 0.18/0.41 % --qbf_mode false
% 0.18/0.41 % --qbf_elim_univ true
% 0.18/0.41 % --qbf_sk_in true
% 0.18/0.41 % --qbf_pred_elim true
% 0.18/0.41 % --qbf_split 32
% 0.18/0.41
% 0.18/0.41 % ------ BMC1 Options
% 0.18/0.41
% 0.18/0.41 % --bmc1_incremental false
% 0.18/0.41 % --bmc1_axioms reachable_all
% 0.18/0.41 % --bmc1_min_bound 0
% 0.18/0.41 % --bmc1_max_bound -1
% 0.18/0.41 % --bmc1_max_bound_default -1
% 0.18/0.41 % --bmc1_symbol_reachability true
% 0.18/0.41 % --bmc1_property_lemmas false
% 0.18/0.41 % --bmc1_k_induction false
% 0.18/0.41 % --bmc1_non_equiv_states false
% 0.18/0.41 % --bmc1_deadlock false
% 0.18/0.41 % --bmc1_ucm false
% 0.18/0.41 % --bmc1_add_unsat_core none
% 0.18/0.41 % --bmc1_unsat_core_children false
% 0.18/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.41 % --bmc1_out_stat full
% 0.18/0.41 % --bmc1_ground_init false
% 0.18/0.41 % --bmc1_pre_inst_next_state false
% 0.18/0.41 % --bmc1_pre_inst_state false
% 0.18/0.41 % --bmc1_pre_inst_reach_state false
% 0.18/0.41 % --bmc1_out_unsat_core false
% 0.18/0.41 % --bmc1_aig_witness_out false
% 0.18/0.41 % --bmc1_verbose false
% 0.18/0.41 % --bmc1_dump_clauses_tptp false
% 0.18/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.42 % --bmc1_dump_file -
% 0.18/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.42 % --bmc1_ucm_extend_mode 1
% 0.18/0.42 % --bmc1_ucm_init_mode 2
% 0.18/0.42 % --bmc1_ucm_cone_mode none
% 0.18/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.42 % --bmc1_ucm_relax_model 4
% 0.18/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.42 % --bmc1_ucm_layered_model none
% 0.18/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.42
% 0.18/0.42 % ------ AIG Options
% 0.18/0.42
% 0.18/0.42 % --aig_mode false
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation Options
% 0.18/0.42
% 0.18/0.42 % --instantiation_flag true
% 0.18/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.42 % --inst_solver_per_active 750
% 0.18/0.42 % --inst_solver_calls_frac 0.5
% 0.18/0.42 % --inst_passive_queue_type priority_queues
% 0.18/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.42 % --inst_passive_queues_freq [25;2]
% 0.18/0.42 % --inst_dismatching true
% 0.18/0.42 % --inst_eager_unprocessed_to_passive true
% 0.18/0.42 % --inst_prop_sim_given true
% 0.18/0.42 % --inst_prop_sim_new false
% 0.18/0.42 % --inst_orphan_elimination true
% 0.18/0.42 % --inst_learning_loop_flag true
% 0.18/0.42 % --inst_learning_start 3000
% 0.18/0.42 % --inst_learning_factor 2
% 0.18/0.42 % --inst_start_prop_sim_after_learn 3
% 0.18/0.42 % --inst_sel_renew solver
% 0.18/0.42 % --inst_lit_activity_flag true
% 0.18/0.42 % --inst_out_proof true
% 0.18/0.42
% 0.18/0.42 % ------ Resolution Options
% 0.18/0.42
% 0.18/0.42 % --resolution_flag true
% 0.18/0.42 % --res_lit_sel kbo_max
% 0.18/0.42 % --res_to_prop_solver none
% 0.18/0.42 % --res_prop_simpl_new false
% 0.18/0.42 % --res_prop_simpl_given false
% 0.18/0.42 % --res_passive_queue_type priority_queues
% 0.18/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.42 % --res_passive_queues_freq [15;5]
% 0.18/0.42 % --res_forward_subs full
% 0.18/0.42 % --res_backward_subs full
% 0.18/0.42 % --res_forward_subs_resolution true
% 0.18/0.42 % --res_backward_subs_resolution true
% 0.18/0.42 % --res_orphan_elimination false
% 0.18/0.42 % --res_time_limit 1000.
% 0.18/0.42 % --res_out_proof true
% 0.18/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_09d458.s
% 0.18/0.42 % --modulo true
% 0.18/0.42
% 0.18/0.42 % ------ Combination Options
% 0.18/0.42
% 0.18/0.42 % --comb_res_mult 1000
% 0.18/0.42 % --comb_inst_mult 300
% 0.18/0.42 % ------
% 0.18/0.42
% 0.18/0.42 % ------ Parsing...% successful
% 0.18/0.42
% 0.18/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.18/0.42
% 0.18/0.42 % ------ Proving...
% 0.18/0.42 % ------ Problem Properties
% 0.18/0.42
% 0.18/0.42 %
% 0.18/0.42 % EPR false
% 0.18/0.42 % Horn false
% 0.18/0.42 % Has equality false
% 0.18/0.42
% 0.18/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % % ------ Current options:
% 0.18/0.42
% 0.18/0.42 % ------ Input Options
% 0.18/0.42
% 0.18/0.42 % --out_options all
% 0.18/0.42 % --tptp_safe_out true
% 0.18/0.42 % --problem_path ""
% 0.18/0.42 % --include_path ""
% 0.18/0.42 % --clausifier .//eprover
% 0.18/0.42 % --clausifier_options --tstp-format
% 0.18/0.42 % --stdin false
% 0.18/0.42 % --dbg_backtrace false
% 0.18/0.42 % --dbg_dump_prop_clauses false
% 0.18/0.42 % --dbg_dump_prop_clauses_file -
% 0.18/0.42 % --dbg_out_stat false
% 0.18/0.42
% 0.18/0.42 % ------ General Options
% 0.18/0.42
% 0.18/0.42 % --fof false
% 0.18/0.42 % --time_out_real 150.
% 0.18/0.42 % --time_out_prep_mult 0.2
% 0.18/0.42 % --time_out_virtual -1.
% 0.18/0.42 % --schedule none
% 0.18/0.42 % --ground_splitting input
% 0.18/0.42 % --splitting_nvd 16
% 0.18/0.42 % --non_eq_to_eq false
% 0.18/0.42 % --prep_gs_sim true
% 0.18/0.42 % --prep_unflatten false
% 0.18/0.42 % --prep_res_sim true
% 0.18/0.42 % --prep_upred true
% 0.18/0.42 % --res_sim_input true
% 0.18/0.42 % --clause_weak_htbl true
% 0.18/0.42 % --gc_record_bc_elim false
% 0.18/0.42 % --symbol_type_check false
% 0.18/0.42 % --clausify_out false
% 0.18/0.42 % --large_theory_mode false
% 0.18/0.42 % --prep_sem_filter none
% 0.18/0.42 % --prep_sem_filter_out false
% 0.18/0.42 % --preprocessed_out false
% 0.18/0.42 % --sub_typing false
% 0.18/0.42 % --brand_transform false
% 0.18/0.42 % --pure_diseq_elim true
% 0.18/0.42 % --min_unsat_core false
% 0.18/0.42 % --pred_elim true
% 0.18/0.42 % --add_important_lit false
% 0.18/0.42 % --soft_assumptions false
% 0.18/0.42 % --reset_solvers false
% 0.18/0.42 % --bc_imp_inh []
% 0.18/0.42 % --conj_cone_tolerance 1.5
% 0.18/0.42 % --prolific_symb_bound 500
% 0.18/0.42 % --lt_threshold 2000
% 0.18/0.42
% 0.18/0.42 % ------ SAT Options
% 0.18/0.42
% 0.18/0.42 % --sat_mode false
% 0.18/0.42 % --sat_fm_restart_options ""
% 0.18/0.42 % --sat_gr_def false
% 0.18/0.42 % --sat_epr_types true
% 0.18/0.42 % --sat_non_cyclic_types false
% 0.18/0.42 % --sat_finite_models false
% 0.18/0.42 % --sat_fm_lemmas false
% 0.18/0.42 % --sat_fm_prep false
% 0.18/0.42 % --sat_fm_uc_incr true
% 0.18/0.42 % --sat_out_model small
% 0.18/0.42 % --sat_out_clauses false
% 0.18/0.42
% 0.18/0.42 % ------ QBF Options
% 0.18/0.42
% 0.18/0.42 % --qbf_mode false
% 0.18/0.42 % --qbf_elim_univ true
% 0.18/0.42 % --qbf_sk_in true
% 0.18/0.42 % --qbf_pred_elim true
% 0.18/0.42 % --qbf_split 32
% 0.18/0.42
% 0.18/0.42 % ------ BMC1 Options
% 0.18/0.42
% 0.18/0.42 % --bmc1_incremental false
% 0.18/0.42 % --bmc1_axioms reachable_all
% 0.18/0.42 % --bmc1_min_bound 0
% 0.18/0.42 % --bmc1_max_bound -1
% 0.18/0.42 % --bmc1_max_bound_default -1
% 0.18/0.42 % --bmc1_symbol_reachability true
% 0.18/0.42 % --bmc1_property_lemmas false
% 0.18/0.42 % --bmc1_k_induction false
% 0.18/0.42 % --bmc1_non_equiv_states false
% 0.18/0.42 % --bmc1_deadlock false
% 0.18/0.42 % --bmc1_ucm false
% 0.18/0.42 % --bmc1_add_unsat_core none
% 0.18/0.42 % --bmc1_unsat_core_children false
% 0.18/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.42 % --bmc1_out_stat full
% 0.18/0.42 % --bmc1_ground_init false
% 0.18/0.42 % --bmc1_pre_inst_next_state false
% 0.18/0.42 % --bmc1_pre_inst_state false
% 0.18/0.42 % --bmc1_pre_inst_reach_state false
% 0.18/0.42 % --bmc1_out_unsat_core false
% 0.18/0.42 % --bmc1_aig_witness_out false
% 0.18/0.42 % --bmc1_verbose false
% 0.18/0.42 % --bmc1_dump_clauses_tptp false
% 0.18/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.42 % --bmc1_dump_file -
% 0.18/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.42 % --bmc1_ucm_extend_mode 1
% 0.18/0.42 % --bmc1_ucm_init_mode 2
% 0.18/0.42 % --bmc1_ucm_cone_mode none
% 0.18/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.42 % --bmc1_ucm_relax_model 4
% 0.18/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.42 % --bmc1_ucm_layered_model none
% 0.18/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.42
% 0.18/0.42 % ------ AIG Options
% 0.18/0.42
% 0.18/0.42 % --aig_mode false
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation Options
% 0.18/0.42
% 0.18/0.42 % --instantiation_flag true
% 0.18/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.42 % --inst_solver_per_active 750
% 0.18/0.42 % --inst_solver_calls_frac 0.5
% 0.18/0.42 % --inst_passive_queue_type priority_queues
% 0.18/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.42 % --inst_passive_queues_freq [25;2]
% 0.18/0.42 % --inst_dismatching true
% 0.18/0.42 % --inst_eager_unprocessed_to_passive true
% 0.18/0.42 % --inst_prop_sim_given true
% 0.18/0.42 % --inst_prop_sim_new false
% 0.18/0.42 % --inst_orphan_elimination true
% 0.18/0.42 % --inst_learning_loop_flag true
% 0.18/0.42 % --inst_learning_start 3000
% 0.18/0.42 % --inst_learning_factor 2
% 0.18/0.42 % --inst_start_prop_sim_after_learn 3
% 0.18/0.42 % --inst_sel_renew solver
% 0.18/0.42 % --inst_lit_activity_flag true
% 0.18/0.42 % --inst_out_proof true
% 0.18/0.42
% 0.18/0.42 % ------ Resolution Options
% 0.18/0.42
% 0.18/0.42 % --resolution_flag true
% 0.18/0.42 % --res_lit_sel kbo_max
% 0.18/0.42 % --res_to_prop_solver none
% 0.18/0.42 % --res_prop_simpl_new false
% 0.18/0.42 % --res_prop_simpl_given false
% 0.18/0.42 % --res_passive_queue_type priority_queues
% 0.18/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.42 % --res_passive_queues_freq [15;5]
% 0.18/0.42 % --res_forward_subs full
% 0.18/0.42 % --res_backward_subs full
% 0.18/0.42 % --res_forward_subs_resolution true
% 0.18/0.42 % --res_backward_subs_resolution true
% 0.18/0.42 % --res_orphan_elimination false
% 0.18/0.42 % --res_time_limit 1000.
% 0.18/0.42 % --res_out_proof true
% 0.18/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_09d458.s
% 0.18/0.42 % --modulo true
% 0.18/0.42
% 0.18/0.42 % ------ Combination Options
% 0.18/0.42
% 0.18/0.42 % --comb_res_mult 1000
% 0.18/0.42 % --comb_inst_mult 300
% 0.18/0.42 % ------
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % ------ Proving...
% 0.18/0.42 % warning: shown sat in sat incomplete mode
% 0.18/0.42 %
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 cnf(c_69,plain,
% 0.18/0.42 ( ~ e(X0) | ~ r(X0,X1) | c(X1) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_115_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_344,plain,
% 0.18/0.42 ( ~ e(X0) | ~ r(X0,X1) | c(X1) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_69]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_345,plain,
% 0.18/0.42 ( ~ r(X0,X1) | ~ e(X0) | c(X1) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_344]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_66,plain,
% 0.18/0.42 ( ~ e(X0) | ~ s(X0,X1) | d(X1) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_114_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_338,plain,
% 0.18/0.42 ( ~ e(X0) | ~ s(X0,X1) | d(X1) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_66]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_339,plain,
% 0.18/0.42 ( ~ s(X0,X1) | ~ e(X0) | d(X1) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_338]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_63,plain,
% 0.18/0.42 ( ~ e(X0) | ~ s(X0,X1) | r(X0,X1) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_113_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_332,plain,
% 0.18/0.42 ( ~ e(X0) | ~ s(X0,X1) | r(X0,X1) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_63]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_333,plain,
% 0.18/0.42 ( ~ s(X0,X1) | r(X0,X1) | ~ e(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_332]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_55,plain,
% 0.18/0.42 ( equalish(X0,X1) | t2least(X2) | ~ t(X2,X1) | ~ t(X2,X0) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_109_3) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_316,plain,
% 0.18/0.42 ( equalish(X0,X1) | t2least(X2) | ~ t(X2,X1) | ~ t(X2,X0) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_55]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_317,plain,
% 0.18/0.42 ( equalish(X0,X1) | ~ t(X2,X1) | ~ t(X2,X0) | t2least(X2) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_316]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_52,plain,
% 0.18/0.42 ( ~ t(X0,X1) | ~ t(X0,X2) | t2least(X0) | equalish(X1,X2) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_109_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_310,plain,
% 0.18/0.42 ( ~ t(X0,X1) | ~ t(X0,X2) | t2least(X0) | equalish(X1,X2) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_52]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_311,plain,
% 0.18/0.42 ( equalish(X0,X1) | ~ t(X2,X0) | ~ t(X2,X1) | t2least(X2) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_310]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_48,plain,
% 0.18/0.42 ( ~ t1most(X0) | ~ t(X0,X1) | ~ t(X0,X2) | equalish(X1,X2) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_108_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_302,plain,
% 0.18/0.42 ( ~ t1most(X0) | ~ t(X0,X1) | ~ t(X0,X2) | equalish(X1,X2) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_48]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_303,plain,
% 0.18/0.42 ( equalish(X0,X1) | ~ t(X2,X0) | ~ t(X2,X1) | ~ t1most(X2) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_302]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_42,plain,
% 0.18/0.42 ( ~ c(u4r1(X0))
% 0.18/0.42 | ~ d(u4r2(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_107_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_290,plain,
% 0.18/0.42 ( ~ c(u4r1(X0))
% 0.18/0.42 | ~ d(u4r2(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_42]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_291,plain,
% 0.18/0.42 ( s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | ~ c(u4r1(X0))
% 0.18/0.42 | ~ d(u4r2(X0)) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_290]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_36,plain,
% 0.18/0.42 ( ~ d(u4r2(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_106_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_278,plain,
% 0.18/0.42 ( ~ d(u4r2(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_36]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_279,plain,
% 0.18/0.42 ( s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | r(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | ~ d(u4r2(X0)) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_278]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_30,plain,
% 0.18/0.42 ( ~ c(u4r1(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | s(X0,u4r2(X0))
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_105_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_266,plain,
% 0.18/0.42 ( ~ c(u4r1(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | s(X0,u4r2(X0))
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_30]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_267,plain,
% 0.18/0.42 ( s(X0,u4r2(X0))
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | ~ c(u4r1(X0)) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_266]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_24,plain,
% 0.18/0.42 ( ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | s(X0,u4r2(X0))
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_104_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_254,plain,
% 0.18/0.42 ( ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | s(X0,u4r2(X0))
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r3(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_24]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_255,plain,
% 0.18/0.42 ( s(X0,u4r2(X0))
% 0.18/0.42 | s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | r(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_254]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_18,plain,
% 0.18/0.42 ( ~ c(u4r1(X0))
% 0.18/0.42 | ~ d(u4r2(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_103_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_242,plain,
% 0.18/0.42 ( ~ c(u4r1(X0))
% 0.18/0.42 | ~ d(u4r2(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_18]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_243,plain,
% 0.18/0.42 ( ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | ~ c(u4r1(X0))
% 0.18/0.42 | ~ d(u4r2(X0)) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_242]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_12,plain,
% 0.18/0.42 ( ~ d(u4r2(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | r(X0,u4r1(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_102_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_230,plain,
% 0.18/0.42 ( ~ d(u4r2(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | r(X0,u4r1(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_12]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_231,plain,
% 0.18/0.42 ( ~ s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | ~ d(u4r2(X0)) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_230]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_6,plain,
% 0.18/0.42 ( ~ c(u4r1(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | s(X0,u4r2(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_101_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_218,plain,
% 0.18/0.42 ( ~ c(u4r1(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | s(X0,u4r2(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_6]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_219,plain,
% 0.18/0.42 ( s(X0,u4r2(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | ~ c(u4r1(X0)) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_218]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_0,plain,
% 0.18/0.42 ( ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | s(X0,u4r2(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_100_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_206,plain,
% 0.18/0.42 ( ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0)
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | s(X0,u4r2(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_0]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_207,plain,
% 0.18/0.42 ( s(X0,u4r2(X0))
% 0.18/0.42 | ~ s(X0,u4r3(X0))
% 0.18/0.42 | r(X0,u4r1(X0))
% 0.18/0.42 | ~ r(X0,u4r3(X0))
% 0.18/0.42 | ~ r(X0,X1)
% 0.18/0.42 | e(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_206]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_90,negated_conjecture,
% 0.18/0.42 ( e(exist) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_4) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_108,negated_conjecture,
% 0.18/0.42 ( e(exist) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_90]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_112,negated_conjecture,
% 0.18/0.42 ( e(exist) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_108]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_113,negated_conjecture,
% 0.18/0.42 ( e(exist) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_112]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_114,negated_conjecture,
% 0.18/0.42 ( e(exist) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_113]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_386,negated_conjecture,
% 0.18/0.42 ( e(exist) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_114]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_88,plain,
% 0.18/0.42 ( ~ t1most(X0) | d(X0) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_124_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_382,plain,
% 0.18/0.42 ( ~ t1most(X0) | d(X0) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_88]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_383,plain,
% 0.18/0.42 ( d(X0) | ~ t1most(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_382]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_86,plain,
% 0.18/0.42 ( ~ d(X0) | t1most(X0) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_123_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_378,plain,
% 0.18/0.42 ( ~ d(X0) | t1most(X0) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_86]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_84,plain,
% 0.18/0.42 ( ~ t2least(X0) | c(X0) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_122_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_374,plain,
% 0.18/0.42 ( ~ t2least(X0) | c(X0) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_84]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_375,plain,
% 0.18/0.42 ( c(X0) | ~ t2least(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_374]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_82,plain,
% 0.18/0.42 ( ~ c(X0) | t2least(X0) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_121_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_370,plain,
% 0.18/0.42 ( ~ c(X0) | t2least(X0) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_82]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_80,plain,
% 0.18/0.42 ( t1most(X0) | t(X0,u3r2(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_120_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_366,plain,
% 0.18/0.42 ( t1most(X0) | t(X0,u3r2(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_80]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_367,plain,
% 0.18/0.42 ( t(X0,u3r2(X0)) | t1most(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_366]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_78,plain,
% 0.18/0.42 ( t1most(X0) | t(X0,u3r1(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_119_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_362,plain,
% 0.18/0.42 ( t1most(X0) | t(X0,u3r1(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_78]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_363,plain,
% 0.18/0.42 ( t(X0,u3r1(X0)) | t1most(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_362]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_76,plain,
% 0.18/0.42 ( ~ e(X0) | r(X0,u4r4(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_118_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_358,plain,
% 0.18/0.42 ( ~ e(X0) | r(X0,u4r4(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_76]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_359,plain,
% 0.18/0.42 ( r(X0,u4r4(X0)) | ~ e(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_358]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_74,plain,
% 0.18/0.42 ( ~ t2least(X0) | t(X0,u1r2(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_117_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_354,plain,
% 0.18/0.42 ( ~ t2least(X0) | t(X0,u1r2(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_74]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_355,plain,
% 0.18/0.42 ( t(X0,u1r2(X0)) | ~ t2least(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_354]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_72,plain,
% 0.18/0.42 ( ~ t2least(X0) | t(X0,u1r1(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_116_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_350,plain,
% 0.18/0.42 ( ~ t2least(X0) | t(X0,u1r1(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_72]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_351,plain,
% 0.18/0.42 ( t(X0,u1r1(X0)) | ~ t2least(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_350]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_60,plain,
% 0.18/0.42 ( ~ e(X0) | ~ r(X0,X1) | s(X0,X1) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_112_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_326,plain,
% 0.18/0.42 ( ~ e(X0) | ~ r(X0,X1) | s(X0,X1) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_60]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_327,plain,
% 0.18/0.42 ( s(X0,X1) | ~ r(X0,X1) | ~ e(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_326]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_58,plain,
% 0.18/0.42 ( ~ equalish(u3r2(X0),u3r1(X0)) | t1most(X0) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_111_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_322,plain,
% 0.18/0.42 ( ~ equalish(u3r2(X0),u3r1(X0)) | t1most(X0) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_58]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_56,plain,
% 0.18/0.42 ( ~ t2least(X0) | ~ equalish(u1r2(X0),u1r1(X0)) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_110_0) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_318,plain,
% 0.18/0.42 ( ~ t2least(X0) | ~ equalish(u1r2(X0),u1r1(X0)) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_56]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_319,plain,
% 0.18/0.42 ( ~ equalish(u1r2(X0),u1r1(X0)) | ~ t2least(X0) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_318]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_50,plain,
% 0.18/0.42 ( ~ t1most(X0) | equalish(X1,X2) | ~ t(X0,X2) | ~ t(X0,X1) ),
% 0.18/0.42 file('/export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p', c_0_108_2) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_306,plain,
% 0.18/0.42 ( ~ t1most(X0) | equalish(X1,X2) | ~ t(X0,X2) | ~ t(X0,X1) ),
% 0.18/0.42 inference(copy,[status(esa)],[c_50]) ).
% 0.18/0.42
% 0.18/0.42 cnf(c_307,plain,
% 0.18/0.42 ( equalish(X0,X1) | ~ t(X2,X1) | ~ t(X2,X0) | ~ t1most(X2) ),
% 0.18/0.42 inference(rewriting,[status(thm)],[c_306]) ).
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % ------ Statistics
% 0.18/0.42
% 0.18/0.42 % ------ General
% 0.18/0.42
% 0.18/0.42 % num_of_input_clauses: 91
% 0.18/0.42 % num_of_input_neg_conjectures: 1
% 0.18/0.42 % num_of_splits: 0
% 0.18/0.42 % num_of_split_atoms: 0
% 0.18/0.42 % num_of_sem_filtered_clauses: 0
% 0.18/0.42 % num_of_subtypes: 0
% 0.18/0.42 % monotx_restored_types: 0
% 0.18/0.42 % sat_num_of_epr_types: 0
% 0.18/0.42 % sat_num_of_non_cyclic_types: 0
% 0.18/0.42 % sat_guarded_non_collapsed_types: 0
% 0.18/0.42 % is_epr: 0
% 0.18/0.42 % is_horn: 0
% 0.18/0.42 % has_eq: 0
% 0.18/0.42 % num_pure_diseq_elim: 0
% 0.18/0.42 % simp_replaced_by: 0
% 0.18/0.42 % res_preprocessed: 2
% 0.18/0.42 % prep_upred: 0
% 0.18/0.42 % prep_unflattend: 0
% 0.18/0.42 % pred_elim_cands: 0
% 0.18/0.42 % pred_elim: 0
% 0.18/0.42 % pred_elim_cl: 0
% 0.18/0.42 % pred_elim_cycles: 0
% 0.18/0.42 % forced_gc_time: 0
% 0.18/0.42 % gc_basic_clause_elim: 0
% 0.18/0.42 % parsing_time: 0.005
% 0.18/0.42 % sem_filter_time: 0.
% 0.18/0.42 % pred_elim_time: 0.
% 0.18/0.42 % out_proof_time: 0.
% 0.18/0.42 % monotx_time: 0.
% 0.18/0.42 % subtype_inf_time: 0.
% 0.18/0.42 % unif_index_cands_time: 0.
% 0.18/0.42 % unif_index_add_time: 0.
% 0.18/0.42 % total_time: 0.035
% 0.18/0.42 % num_of_symbols: 43
% 0.18/0.42 % num_of_terms: 119
% 0.18/0.42
% 0.18/0.42 % ------ Propositional Solver
% 0.18/0.42
% 0.18/0.42 % prop_solver_calls: 1
% 0.18/0.42 % prop_fast_solver_calls: 3
% 0.18/0.42 % prop_num_of_clauses: 47
% 0.18/0.42 % prop_preprocess_simplified: 323
% 0.18/0.42 % prop_fo_subsumed: 0
% 0.18/0.42 % prop_solver_time: 0.
% 0.18/0.42 % prop_fast_solver_time: 0.
% 0.18/0.42 % prop_unsat_core_time: 0.
% 0.18/0.42
% 0.18/0.42 % ------ QBF
% 0.18/0.42
% 0.18/0.42 % qbf_q_res: 0
% 0.18/0.42 % qbf_num_tautologies: 0
% 0.18/0.42 % qbf_prep_cycles: 0
% 0.18/0.42
% 0.18/0.42 % ------ BMC1
% 0.18/0.42
% 0.18/0.42 % bmc1_current_bound: -1
% 0.18/0.42 % bmc1_last_solved_bound: -1
% 0.18/0.42 % bmc1_unsat_core_size: -1
% 0.18/0.42 % bmc1_unsat_core_parents_size: -1
% 0.18/0.42 % bmc1_merge_next_fun: 0
% 0.18/0.42 % bmc1_unsat_core_clauses_time: 0.
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation
% 0.18/0.42
% 0.18/0.42 % inst_num_of_clauses: 91
% 0.18/0.42 % inst_num_in_passive: 0
% 0.18/0.42 % inst_num_in_active: 0
% 0.18/0.42 % inst_num_in_unprocessed: 91
% 0.18/0.42 % inst_num_of_loops: 0
% 0.18/0.42 % inst_num_of_learning_restarts: 0
% 0.18/0.42 % inst_num_moves_active_passive: 0
% 0.18/0.42 % inst_lit_activity: 0
% 0.18/0.42 % inst_lit_activity_moves: 0
% 0.18/0.42 % inst_num_tautologies: 0
% 0.18/0.42 % inst_num_prop_implied: 0
% 0.18/0.42 % inst_num_existing_simplified: 0
% 0.18/0.42 % inst_num_eq_res_simplified: 0
% 0.18/0.42 % inst_num_child_elim: 0
% 0.18/0.42 % inst_num_of_dismatching_blockings: 0
% 0.18/0.42 % inst_num_of_non_proper_insts: 0
% 0.18/0.42 % inst_num_of_duplicates: 0
% 0.18/0.42 % inst_inst_num_from_inst_to_res: 0
% 0.18/0.43 % inst_dismatching_checking_time: 0.
% 0.18/0.43
% 0.18/0.43 % ------ Resolution
% 0.18/0.43
% 0.18/0.43 % res_num_of_clauses: 105
% 0.18/0.43 % res_num_in_passive: 0
% 0.18/0.43 % res_num_in_active: 28
% 0.18/0.43 % res_num_of_loops: 2
% 0.18/0.43 % res_forward_subset_subsumed: 63
% 0.18/0.43 % res_backward_subset_subsumed: 0
% 0.18/0.43 % res_forward_subsumed: 0
% 0.18/0.43 % res_backward_subsumed: 0
% 0.18/0.43 % res_forward_subsumption_resolution: 0
% 0.18/0.43 % res_backward_subsumption_resolution: 0
% 0.18/0.43 % res_clause_to_clause_subsumption: 0
% 0.18/0.43 % res_orphan_elimination: 0
% 0.18/0.43 % res_tautology_del: 0
% 0.18/0.43 % res_num_eq_res_simplified: 0
% 0.18/0.43 % res_num_sel_changes: 0
% 0.18/0.43 % res_moves_from_active_to_pass: 0
% 0.18/0.43
% 0.18/0.43 % Status Unknown
% 0.18/0.47 % Orienting using strategy ClausalAll
% 0.18/0.47 % Orientation found
% 0.18/0.47 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_09d458.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_6c7a28.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_5cca75 | grep -v "SZS"
% 0.18/0.49
% 0.18/0.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.18/0.49
% 0.18/0.49 %
% 0.18/0.49 % ------ iProver source info
% 0.18/0.49
% 0.18/0.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.18/0.49 % git: non_committed_changes: true
% 0.18/0.49 % git: last_make_outside_of_git: true
% 0.18/0.49
% 0.18/0.49 %
% 0.18/0.49 % ------ Input Options
% 0.18/0.49
% 0.18/0.49 % --out_options all
% 0.18/0.49 % --tptp_safe_out true
% 0.18/0.49 % --problem_path ""
% 0.18/0.49 % --include_path ""
% 0.18/0.49 % --clausifier .//eprover
% 0.18/0.49 % --clausifier_options --tstp-format
% 0.18/0.49 % --stdin false
% 0.18/0.49 % --dbg_backtrace false
% 0.18/0.49 % --dbg_dump_prop_clauses false
% 0.18/0.49 % --dbg_dump_prop_clauses_file -
% 0.18/0.49 % --dbg_out_stat false
% 0.18/0.49
% 0.18/0.49 % ------ General Options
% 0.18/0.49
% 0.18/0.49 % --fof false
% 0.18/0.49 % --time_out_real 150.
% 0.18/0.49 % --time_out_prep_mult 0.2
% 0.18/0.49 % --time_out_virtual -1.
% 0.18/0.49 % --schedule none
% 0.18/0.49 % --ground_splitting input
% 0.18/0.49 % --splitting_nvd 16
% 0.18/0.49 % --non_eq_to_eq false
% 0.18/0.49 % --prep_gs_sim true
% 0.18/0.49 % --prep_unflatten false
% 0.18/0.49 % --prep_res_sim true
% 0.18/0.49 % --prep_upred true
% 0.18/0.49 % --res_sim_input true
% 0.18/0.49 % --clause_weak_htbl true
% 0.18/0.49 % --gc_record_bc_elim false
% 0.18/0.49 % --symbol_type_check false
% 0.18/0.49 % --clausify_out false
% 0.18/0.49 % --large_theory_mode false
% 0.18/0.49 % --prep_sem_filter none
% 0.18/0.49 % --prep_sem_filter_out false
% 0.18/0.49 % --preprocessed_out false
% 0.18/0.49 % --sub_typing false
% 0.18/0.49 % --brand_transform false
% 0.18/0.49 % --pure_diseq_elim true
% 0.18/0.49 % --min_unsat_core false
% 0.18/0.49 % --pred_elim true
% 0.18/0.49 % --add_important_lit false
% 0.18/0.49 % --soft_assumptions false
% 0.18/0.49 % --reset_solvers false
% 0.18/0.49 % --bc_imp_inh []
% 0.18/0.49 % --conj_cone_tolerance 1.5
% 0.18/0.49 % --prolific_symb_bound 500
% 0.18/0.49 % --lt_threshold 2000
% 0.18/0.49
% 0.18/0.49 % ------ SAT Options
% 0.18/0.49
% 0.18/0.49 % --sat_mode false
% 0.18/0.49 % --sat_fm_restart_options ""
% 0.18/0.49 % --sat_gr_def false
% 0.18/0.49 % --sat_epr_types true
% 0.18/0.49 % --sat_non_cyclic_types false
% 0.18/0.49 % --sat_finite_models false
% 0.18/0.49 % --sat_fm_lemmas false
% 0.18/0.49 % --sat_fm_prep false
% 0.18/0.49 % --sat_fm_uc_incr true
% 0.18/0.49 % --sat_out_model small
% 0.18/0.49 % --sat_out_clauses false
% 0.18/0.49
% 0.18/0.49 % ------ QBF Options
% 0.18/0.49
% 0.18/0.49 % --qbf_mode false
% 0.18/0.49 % --qbf_elim_univ true
% 0.18/0.49 % --qbf_sk_in true
% 0.18/0.49 % --qbf_pred_elim true
% 0.18/0.49 % --qbf_split 32
% 0.18/0.49
% 0.18/0.49 % ------ BMC1 Options
% 0.18/0.49
% 0.18/0.49 % --bmc1_incremental false
% 0.18/0.49 % --bmc1_axioms reachable_all
% 0.18/0.49 % --bmc1_min_bound 0
% 0.18/0.49 % --bmc1_max_bound -1
% 0.18/0.49 % --bmc1_max_bound_default -1
% 0.18/0.49 % --bmc1_symbol_reachability true
% 0.18/0.49 % --bmc1_property_lemmas false
% 0.18/0.49 % --bmc1_k_induction false
% 0.18/0.49 % --bmc1_non_equiv_states false
% 0.18/0.49 % --bmc1_deadlock false
% 0.18/0.49 % --bmc1_ucm false
% 0.18/0.49 % --bmc1_add_unsat_core none
% 0.18/0.49 % --bmc1_unsat_core_children false
% 0.18/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.49 % --bmc1_out_stat full
% 0.18/0.49 % --bmc1_ground_init false
% 0.18/0.49 % --bmc1_pre_inst_next_state false
% 0.18/0.49 % --bmc1_pre_inst_state false
% 0.18/0.49 % --bmc1_pre_inst_reach_state false
% 0.18/0.49 % --bmc1_out_unsat_core false
% 0.18/0.49 % --bmc1_aig_witness_out false
% 0.18/0.49 % --bmc1_verbose false
% 0.18/0.49 % --bmc1_dump_clauses_tptp false
% 0.18/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.50 % --bmc1_dump_file -
% 0.18/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.50 % --bmc1_ucm_extend_mode 1
% 0.18/0.50 % --bmc1_ucm_init_mode 2
% 0.18/0.50 % --bmc1_ucm_cone_mode none
% 0.18/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.50 % --bmc1_ucm_relax_model 4
% 0.18/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.50 % --bmc1_ucm_layered_model none
% 0.18/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.50
% 0.18/0.50 % ------ AIG Options
% 0.18/0.50
% 0.18/0.50 % --aig_mode false
% 0.18/0.50
% 0.18/0.50 % ------ Instantiation Options
% 0.18/0.50
% 0.18/0.50 % --instantiation_flag true
% 0.18/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.50 % --inst_solver_per_active 750
% 0.18/0.50 % --inst_solver_calls_frac 0.5
% 0.18/0.50 % --inst_passive_queue_type priority_queues
% 0.18/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.50 % --inst_passive_queues_freq [25;2]
% 0.18/0.50 % --inst_dismatching true
% 0.18/0.50 % --inst_eager_unprocessed_to_passive true
% 0.18/0.50 % --inst_prop_sim_given true
% 0.18/0.50 % --inst_prop_sim_new false
% 0.18/0.50 % --inst_orphan_elimination true
% 0.18/0.50 % --inst_learning_loop_flag true
% 0.18/0.50 % --inst_learning_start 3000
% 0.18/0.50 % --inst_learning_factor 2
% 0.18/0.50 % --inst_start_prop_sim_after_learn 3
% 0.18/0.50 % --inst_sel_renew solver
% 0.18/0.50 % --inst_lit_activity_flag true
% 0.18/0.50 % --inst_out_proof true
% 0.18/0.50
% 0.18/0.50 % ------ Resolution Options
% 0.18/0.50
% 0.18/0.50 % --resolution_flag true
% 0.18/0.50 % --res_lit_sel kbo_max
% 0.18/0.50 % --res_to_prop_solver none
% 0.18/0.50 % --res_prop_simpl_new false
% 0.18/0.50 % --res_prop_simpl_given false
% 0.18/0.50 % --res_passive_queue_type priority_queues
% 0.18/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.50 % --res_passive_queues_freq [15;5]
% 0.18/0.50 % --res_forward_subs full
% 0.18/0.50 % --res_backward_subs full
% 0.18/0.50 % --res_forward_subs_resolution true
% 0.18/0.50 % --res_backward_subs_resolution true
% 0.18/0.50 % --res_orphan_elimination false
% 0.18/0.50 % --res_time_limit 1000.
% 0.18/0.50 % --res_out_proof true
% 0.18/0.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_09d458.s
% 0.18/0.50 % --modulo true
% 0.18/0.50
% 0.18/0.50 % ------ Combination Options
% 0.18/0.50
% 0.18/0.50 % --comb_res_mult 1000
% 0.18/0.50 % --comb_inst_mult 300
% 0.18/0.50 % ------
% 0.18/0.50
% 0.18/0.50 % ------ Parsing...% successful
% 0.18/0.50
% 0.18/0.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.18/0.50
% 0.18/0.50 % ------ Proving...
% 0.18/0.50 % ------ Problem Properties
% 0.18/0.50
% 0.18/0.50 %
% 0.18/0.50 % EPR false
% 0.18/0.50 % Horn false
% 0.18/0.50 % Has equality false
% 0.18/0.50
% 0.18/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.18/0.50
% 0.18/0.50
% 0.18/0.50 % % ------ Current options:
% 0.18/0.50
% 0.18/0.50 % ------ Input Options
% 0.18/0.50
% 0.18/0.50 % --out_options all
% 0.18/0.50 % --tptp_safe_out true
% 0.18/0.50 % --problem_path ""
% 0.18/0.50 % --include_path ""
% 0.18/0.50 % --clausifier .//eprover
% 0.18/0.50 % --clausifier_options --tstp-format
% 0.18/0.50 % --stdin false
% 0.18/0.50 % --dbg_backtrace false
% 0.18/0.50 % --dbg_dump_prop_clauses false
% 0.18/0.50 % --dbg_dump_prop_clauses_file -
% 0.18/0.50 % --dbg_out_stat false
% 0.18/0.50
% 0.18/0.50 % ------ General Options
% 0.18/0.50
% 0.18/0.50 % --fof false
% 0.18/0.50 % --time_out_real 150.
% 0.18/0.50 % --time_out_prep_mult 0.2
% 0.18/0.50 % --time_out_virtual -1.
% 0.18/0.50 % --schedule none
% 0.18/0.50 % --ground_splitting input
% 0.18/0.50 % --splitting_nvd 16
% 0.18/0.50 % --non_eq_to_eq false
% 0.18/0.50 % --prep_gs_sim true
% 0.18/0.50 % --prep_unflatten false
% 0.18/0.50 % --prep_res_sim true
% 0.18/0.50 % --prep_upred true
% 0.18/0.50 % --res_sim_input true
% 0.18/0.50 % --clause_weak_htbl true
% 0.18/0.50 % --gc_record_bc_elim false
% 0.18/0.50 % --symbol_type_check false
% 0.18/0.50 % --clausify_out false
% 0.18/0.50 % --large_theory_mode false
% 0.18/0.50 % --prep_sem_filter none
% 0.18/0.50 % --prep_sem_filter_out false
% 0.18/0.50 % --preprocessed_out false
% 0.18/0.50 % --sub_typing false
% 0.18/0.50 % --brand_transform false
% 0.18/0.50 % --pure_diseq_elim true
% 0.18/0.50 % --min_unsat_core false
% 0.18/0.50 % --pred_elim true
% 0.18/0.50 % --add_important_lit false
% 0.18/0.50 % --soft_assumptions false
% 0.18/0.50 % --reset_solvers false
% 0.18/0.50 % --bc_imp_inh []
% 0.18/0.50 % --conj_cone_tolerance 1.5
% 0.18/0.50 % --prolific_symb_bound 500
% 0.18/0.50 % --lt_threshold 2000
% 0.18/0.50
% 0.18/0.50 % ------ SAT Options
% 0.18/0.50
% 0.18/0.50 % --sat_mode false
% 0.18/0.50 % --sat_fm_restart_options ""
% 0.18/0.50 % --sat_gr_def false
% 0.18/0.50 % --sat_epr_types true
% 0.18/0.50 % --sat_non_cyclic_types false
% 0.18/0.50 % --sat_finite_models false
% 0.18/0.50 % --sat_fm_lemmas false
% 0.18/0.50 % --sat_fm_prep false
% 0.18/0.50 % --sat_fm_uc_incr true
% 0.18/0.50 % --sat_out_model small
% 0.18/0.50 % --sat_out_clauses false
% 0.18/0.50
% 0.18/0.50 % ------ QBF Options
% 0.18/0.50
% 0.18/0.50 % --qbf_mode false
% 0.18/0.50 % --qbf_elim_univ true
% 0.18/0.50 % --qbf_sk_in true
% 0.18/0.50 % --qbf_pred_elim true
% 0.18/0.50 % --qbf_split 32
% 0.18/0.50
% 0.18/0.50 % ------ BMC1 Options
% 0.18/0.50
% 0.18/0.50 % --bmc1_incremental false
% 0.18/0.50 % --bmc1_axioms reachable_all
% 0.18/0.50 % --bmc1_min_bound 0
% 0.18/0.50 % --bmc1_max_bound -1
% 0.18/0.50 % --bmc1_max_bound_default -1
% 0.18/0.50 % --bmc1_symbol_reachability true
% 0.18/0.50 % --bmc1_property_lemmas false
% 0.18/0.50 % --bmc1_k_induction false
% 0.18/0.50 % --bmc1_non_equiv_states false
% 0.18/0.50 % --bmc1_deadlock false
% 0.18/0.50 % --bmc1_ucm false
% 0.18/0.50 % --bmc1_add_unsat_core none
% 0.18/0.50 % --bmc1_unsat_core_children false
% 0.18/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.50 % --bmc1_out_stat full
% 0.18/0.50 % --bmc1_ground_init false
% 0.18/0.50 % --bmc1_pre_inst_next_state false
% 0.18/0.50 % --bmc1_pre_inst_state false
% 0.18/0.50 % --bmc1_pre_inst_reach_state false
% 0.18/0.50 % --bmc1_out_unsat_core false
% 0.18/0.50 % --bmc1_aig_witness_out false
% 0.18/0.50 % --bmc1_verbose false
% 0.18/0.50 % --bmc1_dump_clauses_tptp false
% 0.18/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.50 % --bmc1_dump_file -
% 0.18/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.50 % --bmc1_ucm_extend_mode 1
% 0.18/0.50 % --bmc1_ucm_init_mode 2
% 0.18/0.50 % --bmc1_ucm_cone_mode none
% 0.18/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.50 % --bmc1_ucm_relax_model 4
% 0.18/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.50 % --bmc1_ucm_layered_model none
% 0.18/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.50
% 0.18/0.50 % ------ AIG Options
% 0.18/0.50
% 0.18/0.50 % --aig_mode false
% 0.18/0.50
% 0.18/0.50 % ------ Instantiation Options
% 0.18/0.50
% 0.18/0.50 % --instantiation_flag true
% 0.18/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.50 % --inst_solver_per_active 750
% 0.18/0.50 % --inst_solver_calls_frac 0.5
% 0.18/0.50 % --inst_passive_queue_type priority_queues
% 0.18/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.50 % --inst_passive_queues_freq [25;2]
% 0.18/0.50 % --inst_dismatching true
% 0.18/0.50 % --inst_eager_unprocessed_to_passive true
% 0.18/0.50 % --inst_prop_sim_given true
% 0.18/0.50 % --inst_prop_sim_new false
% 0.18/0.50 % --inst_orphan_elimination true
% 0.18/0.50 % --inst_learning_loop_flag true
% 0.18/0.50 % --inst_learning_start 3000
% 0.18/0.50 % --inst_learning_factor 2
% 0.18/0.50 % --inst_start_prop_sim_after_learn 3
% 0.18/0.50 % --inst_sel_renew solver
% 0.18/0.50 % --inst_lit_activity_flag true
% 0.18/0.50 % --inst_out_proof true
% 0.18/0.50
% 0.18/0.50 % ------ Resolution Options
% 0.18/0.50
% 0.18/0.50 % --resolution_flag true
% 0.18/0.50 % --res_lit_sel kbo_max
% 0.18/0.50 % --res_to_prop_solver none
% 0.18/0.50 % --res_prop_simpl_new false
% 0.18/0.50 % --res_prop_simpl_given false
% 0.18/0.50 % --res_passive_queue_type priority_queues
% 0.18/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.50 % --res_passive_queues_freq [15;5]
% 0.18/0.50 % --res_forward_subs full
% 0.18/0.50 % --res_backward_subs full
% 0.18/0.50 % --res_forward_subs_resolution true
% 0.18/0.50 % --res_backward_subs_resolution true
% 0.18/0.50 % --res_orphan_elimination false
% 0.18/0.50 % --res_time_limit 1000.
% 0.18/0.50 % --res_out_proof true
% 0.18/0.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_09d458.s
% 0.18/0.50 % --modulo true
% 0.18/0.50
% 0.18/0.50 % ------ Combination Options
% 0.18/0.50
% 0.18/0.50 % --comb_res_mult 1000
% 0.18/0.50 % --comb_inst_mult 300
% 0.18/0.50 % ------
% 0.18/0.50
% 0.18/0.50
% 0.18/0.50
% 0.18/0.50 % ------ Proving...
% 0.18/0.50 %
% 0.18/0.50
% 0.18/0.50
% 0.18/0.50 % Resolution empty clause
% 0.18/0.50
% 0.18/0.50 % ------ Statistics
% 0.18/0.50
% 0.18/0.50 % ------ General
% 0.18/0.50
% 0.18/0.50 % num_of_input_clauses: 91
% 0.18/0.50 % num_of_input_neg_conjectures: 1
% 0.18/0.50 % num_of_splits: 0
% 0.18/0.50 % num_of_split_atoms: 0
% 0.18/0.50 % num_of_sem_filtered_clauses: 0
% 0.18/0.50 % num_of_subtypes: 0
% 0.18/0.50 % monotx_restored_types: 0
% 0.18/0.50 % sat_num_of_epr_types: 0
% 0.18/0.50 % sat_num_of_non_cyclic_types: 0
% 0.18/0.50 % sat_guarded_non_collapsed_types: 0
% 0.18/0.50 % is_epr: 0
% 0.18/0.50 % is_horn: 0
% 0.18/0.50 % has_eq: 0
% 0.18/0.50 % num_pure_diseq_elim: 0
% 0.18/0.50 % simp_replaced_by: 0
% 0.18/0.50 % res_preprocessed: 2
% 0.18/0.50 % prep_upred: 0
% 0.18/0.50 % prep_unflattend: 0
% 0.18/0.50 % pred_elim_cands: 0
% 0.18/0.50 % pred_elim: 0
% 0.18/0.50 % pred_elim_cl: 0
% 0.18/0.50 % pred_elim_cycles: 0
% 0.18/0.50 % forced_gc_time: 0
% 0.18/0.50 % gc_basic_clause_elim: 0
% 0.18/0.50 % parsing_time: 0.004
% 0.18/0.50 % sem_filter_time: 0.
% 0.18/0.50 % pred_elim_time: 0.
% 0.18/0.50 % out_proof_time: 0.001
% 0.18/0.50 % monotx_time: 0.
% 0.18/0.50 % subtype_inf_time: 0.
% 0.18/0.50 % unif_index_cands_time: 0.
% 0.18/0.50 % unif_index_add_time: 0.
% 0.18/0.50 % total_time: 0.031
% 0.18/0.50 % num_of_symbols: 43
% 0.18/0.50 % num_of_terms: 161
% 0.18/0.50
% 0.18/0.50 % ------ Propositional Solver
% 0.18/0.50
% 0.18/0.50 % prop_solver_calls: 1
% 0.18/0.50 % prop_fast_solver_calls: 3
% 0.18/0.50 % prop_num_of_clauses: 47
% 0.18/0.50 % prop_preprocess_simplified: 323
% 0.18/0.50 % prop_fo_subsumed: 0
% 0.18/0.50 % prop_solver_time: 0.
% 0.18/0.50 % prop_fast_solver_time: 0.
% 0.18/0.50 % prop_unsat_core_time: 0.
% 0.18/0.50
% 0.18/0.50 % ------ QBF
% 0.18/0.50
% 0.18/0.50 % qbf_q_res: 0
% 0.18/0.50 % qbf_num_tautologies: 0
% 0.18/0.50 % qbf_prep_cycles: 0
% 0.18/0.50
% 0.18/0.50 % ------ BMC1
% 0.18/0.50
% 0.18/0.50 % bmc1_current_bound: -1
% 0.18/0.50 % bmc1_last_solved_bound: -1
% 0.18/0.50 % bmc1_unsat_core_size: -1
% 0.18/0.50 % bmc1_unsat_core_parents_size: -1
% 0.18/0.50 % bmc1_merge_next_fun: 0
% 0.18/0.50 % bmc1_unsat_core_clauses_time: 0.
% 0.18/0.50
% 0.18/0.50 % ------ Instantiation
% 0.18/0.50
% 0.18/0.50 % inst_num_of_clauses: 91
% 0.18/0.50 % inst_num_in_passive: 0
% 0.18/0.50 % inst_num_in_active: 0
% 0.18/0.50 % inst_num_in_unprocessed: 91
% 0.18/0.50 % inst_num_of_loops: 0
% 0.18/0.51 % inst_num_of_learning_restarts: 0
% 0.18/0.51 % inst_num_moves_active_passive: 0
% 0.18/0.51 % inst_lit_activity: 0
% 0.18/0.51 % inst_lit_activity_moves: 0
% 0.18/0.51 % inst_num_tautologies: 0
% 0.18/0.51 % inst_num_prop_implied: 0
% 0.18/0.51 % inst_num_existing_simplified: 0
% 0.18/0.51 % inst_num_eq_res_simplified: 0
% 0.18/0.51 % inst_num_child_elim: 0
% 0.18/0.51 % inst_num_of_dismatching_blockings: 0
% 0.18/0.51 % inst_num_of_non_proper_insts: 0
% 0.18/0.51 % inst_num_of_duplicates: 0
% 0.18/0.51 % inst_inst_num_from_inst_to_res: 0
% 0.18/0.51 % inst_dismatching_checking_time: 0.
% 0.18/0.51
% 0.18/0.51 % ------ Resolution
% 0.18/0.51
% 0.18/0.51 % res_num_of_clauses: 120
% 0.18/0.51 % res_num_in_passive: 0
% 0.18/0.51 % res_num_in_active: 43
% 0.18/0.51 % res_num_of_loops: 20
% 0.18/0.51 % res_forward_subset_subsumed: 68
% 0.18/0.51 % res_backward_subset_subsumed: 0
% 0.18/0.51 % res_forward_subsumed: 3
% 0.18/0.51 % res_backward_subsumed: 0
% 0.18/0.51 % res_forward_subsumption_resolution: 3
% 0.18/0.51 % res_backward_subsumption_resolution: 0
% 0.18/0.51 % res_clause_to_clause_subsumption: 8
% 0.18/0.51 % res_orphan_elimination: 0
% 0.18/0.51 % res_tautology_del: 1
% 0.18/0.51 % res_num_eq_res_simplified: 0
% 0.18/0.51 % res_num_sel_changes: 0
% 0.18/0.51 % res_moves_from_active_to_pass: 0
% 0.18/0.51
% 0.18/0.51 % Status Unsatisfiable
% 0.18/0.51 % SZS status Unsatisfiable
% 0.18/0.51 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------