%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n023.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:42 EDT 2022
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 25
% Syntax : Number of formulae : 164 ( 28 unt; 0 def)
% Number of atoms : 352 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 367 ( 179 ~; 188 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 178 ( 0 sgn 57 !; 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,X1] :
( equalish(X2,X3)
| ~ r1most(X1)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
file('<stdin>',clause_10) ).
fof(c_0_1,axiom,
! [X2,X3,X1] :
( r2least(X1)
| equalish(X2,X3)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
file('<stdin>',clause_7) ).
fof(c_0_2,axiom,
! [X1] :
( ~ r2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('<stdin>',clause_4) ).
fof(c_0_3,axiom,
! [X1] :
( r1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
file('<stdin>',clause_11) ).
fof(c_0_4,axiom,
! [X1] :
( r(X1,u1r2(X1))
| ~ r2least(X1) ),
file('<stdin>',clause_6) ).
fof(c_0_5,axiom,
! [X1] :
( r(X1,u1r1(X1))
| ~ r2least(X1) ),
file('<stdin>',clause_5) ).
fof(c_0_6,axiom,
! [X1] :
( r1most(X1)
| r(X1,u3r2(X1)) ),
file('<stdin>',clause_13) ).
fof(c_0_7,axiom,
! [X1] :
( r1most(X1)
| r(X1,u3r1(X1)) ),
file('<stdin>',clause_12) ).
fof(c_0_8,axiom,
! [X1] :
( e(X1)
| ~ c(X1)
| ~ d(X1) ),
file('<stdin>',clause_16) ).
fof(c_0_9,axiom,
! [X1] :
( c(X1)
| ~ e(X1) ),
file('<stdin>',clause_15) ).
fof(c_0_10,axiom,
! [X1] :
( d(X1)
| ~ e(X1) ),
file('<stdin>',clause_14) ).
fof(c_0_11,axiom,
! [X1] :
( d(X1)
| ~ r1most(X1) ),
file('<stdin>',clause_9) ).
fof(c_0_12,axiom,
! [X1] :
( r1most(X1)
| ~ d(X1) ),
file('<stdin>',clause_8) ).
fof(c_0_13,axiom,
! [X1] :
( c(X1)
| ~ r2least(X1) ),
file('<stdin>',clause_3) ).
fof(c_0_14,axiom,
! [X1] :
( r2least(X1)
| ~ c(X1) ),
file('<stdin>',clause_2) ).
fof(c_0_15,plain,
! [X2,X3,X1] :
( equalish(X2,X3)
| ~ r1most(X1)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_16,plain,
! [X2,X3,X1] :
( r2least(X1)
| equalish(X2,X3)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_17,plain,
! [X1] :
( ~ r2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_18,plain,
! [X1] :
( r1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_19,plain,
! [X1] :
( r(X1,u1r2(X1))
| ~ r2least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_20,plain,
! [X1] :
( r(X1,u1r1(X1))
| ~ r2least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_21,axiom,
! [X1] :
( r1most(X1)
| r(X1,u3r2(X1)) ),
c_0_6 ).
fof(c_0_22,axiom,
! [X1] :
( r1most(X1)
| r(X1,u3r1(X1)) ),
c_0_7 ).
fof(c_0_23,plain,
! [X1] :
( e(X1)
| ~ c(X1)
| ~ d(X1) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_24,plain,
! [X1] :
( c(X1)
| ~ e(X1) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_25,plain,
! [X1] :
( d(X1)
| ~ e(X1) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_26,plain,
! [X1] :
( d(X1)
| ~ r1most(X1) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_27,plain,
! [X1] :
( r1most(X1)
| ~ d(X1) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_28,plain,
! [X1] :
( c(X1)
| ~ r2least(X1) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_29,plain,
! [X1] :
( r2least(X1)
| ~ c(X1) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_30,plain,
! [X4,X5,X6] :
( equalish(X4,X5)
| ~ r1most(X6)
| ~ r(X6,X4)
| ~ r(X6,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_15])])]) ).
fof(c_0_31,plain,
! [X4,X5,X6] :
( r2least(X6)
| equalish(X4,X5)
| ~ r(X6,X4)
| ~ r(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_32,plain,
! [X2] :
( ~ r2least(X2)
| ~ equalish(u1r2(X2),u1r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_33,plain,
! [X2] :
( r1most(X2)
| ~ equalish(u3r2(X2),u3r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_34,plain,
! [X2] :
( r(X2,u1r2(X2))
| ~ r2least(X2) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_35,plain,
! [X2] :
( r(X2,u1r1(X2))
| ~ r2least(X2) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_36,plain,
! [X2] :
( r1most(X2)
| r(X2,u3r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_37,plain,
! [X2] :
( r1most(X2)
| r(X2,u3r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_38,plain,
! [X2] :
( e(X2)
| ~ c(X2)
| ~ d(X2) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_39,plain,
! [X2] :
( c(X2)
| ~ e(X2) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_40,plain,
! [X2] :
( d(X2)
| ~ e(X2) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_41,plain,
! [X2] :
( d(X2)
| ~ r1most(X2) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_42,plain,
! [X2] :
( r1most(X2)
| ~ d(X2) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_43,plain,
! [X2] :
( c(X2)
| ~ r2least(X2) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_44,plain,
! [X2] :
( r2least(X2)
| ~ c(X2) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
cnf(c_0_45,plain,
( equalish(X3,X2)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_46,plain,
( equalish(X3,X2)
| r2least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_47,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ r2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_48,plain,
( r1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_49,plain,
( r(X1,u1r2(X1))
| ~ r2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_50,plain,
( r(X1,u1r1(X1))
| ~ r2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_51,plain,
( r(X1,u3r2(X1))
| r1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_52,plain,
( r(X1,u3r1(X1))
| r1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_53,plain,
( e(X1)
| ~ d(X1)
| ~ c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_54,plain,
( c(X1)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_55,plain,
( d(X1)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_56,plain,
( d(X1)
| ~ r1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_57,plain,
( r1most(X1)
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_58,plain,
( c(X1)
| ~ r2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_59,plain,
( r2least(X1)
| ~ c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_60,plain,
( equalish(X3,X2)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r1most(X1) ),
c_0_45,
[final] ).
cnf(c_0_61,plain,
( equalish(X3,X2)
| r2least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
c_0_46,
[final] ).
cnf(c_0_62,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ r2least(X1) ),
c_0_47,
[final] ).
cnf(c_0_63,plain,
( r1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
c_0_48,
[final] ).
cnf(c_0_64,plain,
( r(X1,u1r2(X1))
| ~ r2least(X1) ),
c_0_49,
[final] ).
cnf(c_0_65,plain,
( r(X1,u1r1(X1))
| ~ r2least(X1) ),
c_0_50,
[final] ).
cnf(c_0_66,plain,
( r(X1,u3r2(X1))
| r1most(X1) ),
c_0_51,
[final] ).
cnf(c_0_67,plain,
( r(X1,u3r1(X1))
| r1most(X1) ),
c_0_52,
[final] ).
cnf(c_0_68,plain,
( e(X1)
| ~ d(X1)
| ~ c(X1) ),
c_0_53,
[final] ).
cnf(c_0_69,plain,
( c(X1)
| ~ e(X1) ),
c_0_54,
[final] ).
cnf(c_0_70,plain,
( d(X1)
| ~ e(X1) ),
c_0_55,
[final] ).
cnf(c_0_71,plain,
( d(X1)
| ~ r1most(X1) ),
c_0_56,
[final] ).
cnf(c_0_72,plain,
( r1most(X1)
| ~ d(X1) ),
c_0_57,
[final] ).
cnf(c_0_73,plain,
( c(X1)
| ~ r2least(X1) ),
c_0_58,
[final] ).
cnf(c_0_74,plain,
( r2least(X1)
| ~ c(X1) ),
c_0_59,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_60_0,axiom,
( equalish(X3,X2)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_60_1,axiom,
( ~ r(X1,X2)
| equalish(X3,X2)
| ~ r(X1,X3)
| ~ r1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_60_2,axiom,
( ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X3,X2)
| ~ r1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_60_3,axiom,
( ~ r1most(X1)
| ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_61_0,axiom,
( equalish(X3,X2)
| r2least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_61_1,axiom,
( r2least(X1)
| equalish(X3,X2)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_61_2,axiom,
( ~ r(X1,X2)
| r2least(X1)
| equalish(X3,X2)
| ~ r(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_61_3,axiom,
( ~ r(X1,X3)
| ~ r(X1,X2)
| r2least(X1)
| equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_62_0,axiom,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ r2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_62_1,axiom,
( ~ r2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_63_0,axiom,
( r1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_63_1,axiom,
( ~ equalish(u3r2(X1),u3r1(X1))
| r1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_64_0,axiom,
( r(X1,u1r2(X1))
| ~ r2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_1,axiom,
( ~ r2least(X1)
| r(X1,u1r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_65_0,axiom,
( r(X1,u1r1(X1))
| ~ r2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_1,axiom,
( ~ r2least(X1)
| r(X1,u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_66_0,axiom,
( r(X1,u3r2(X1))
| r1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_1,axiom,
( r1most(X1)
| r(X1,u3r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_67_0,axiom,
( r(X1,u3r1(X1))
| r1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_67_1,axiom,
( r1most(X1)
| r(X1,u3r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_68_0,axiom,
( e(X1)
| ~ d(X1)
| ~ c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_1,axiom,
( ~ d(X1)
| e(X1)
| ~ c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_2,axiom,
( ~ c(X1)
| ~ d(X1)
| e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_69_0,axiom,
( c(X1)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_69_1,axiom,
( ~ e(X1)
| c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_70_0,axiom,
( d(X1)
| ~ e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_1,axiom,
( ~ e(X1)
| d(X1) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_71_0,axiom,
( d(X1)
| ~ r1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_1,axiom,
( ~ r1most(X1)
| d(X1) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_72_0,axiom,
( r1most(X1)
| ~ d(X1) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_1,axiom,
( ~ d(X1)
| r1most(X1) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_73_0,axiom,
( c(X1)
| ~ r2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_1,axiom,
( ~ r2least(X1)
| c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_74_0,axiom,
( r2least(X1)
| ~ c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_1,axiom,
( ~ c(X1)
| r2least(X1) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
% 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_35,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_4) ).
cnf(c_50,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_54,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_55,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_56,negated_conjecture,
e(exist),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_163,plain,
e(exist),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_10,plain,
( c(X0)
| ~ e(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_69_1) ).
cnf(c_113,plain,
( c(X0)
| ~ e(X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_167,plain,
c(exist),
inference(resolution,[status(thm)],[c_163,c_113]) ).
cnf(c_170,plain,
c(exist),
inference(rewriting,[status(thm)],[c_167]) ).
cnf(c_0,plain,
( r2least(X0)
| ~ c(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_74_1) ).
cnf(c_93,plain,
( r2least(X0)
| ~ c(X0) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_94,plain,
( ~ c(X0)
| r2least(X0) ),
inference(rewriting,[status(thm)],[c_93]) ).
cnf(c_178,plain,
r2least(exist),
inference(resolution,[status(thm)],[c_170,c_94]) ).
cnf(c_179,plain,
r2least(exist),
inference(rewriting,[status(thm)],[c_178]) ).
cnf(c_19,plain,
( r(X0,u1r1(X0))
| ~ r2least(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_65_1) ).
cnf(c_131,plain,
( r(X0,u1r1(X0))
| ~ r2least(X0) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_132,plain,
( ~ r2least(X0)
| r(X0,u1r1(X0)) ),
inference(rewriting,[status(thm)],[c_131]) ).
cnf(c_191,plain,
r(exist,u1r1(exist)),
inference(resolution,[status(thm)],[c_179,c_132]) ).
cnf(c_194,plain,
r(exist,u1r1(exist)),
inference(rewriting,[status(thm)],[c_191]) ).
cnf(c_33,plain,
( ~ r1most(X0)
| ~ r(X0,X1)
| equalish(X1,X2)
| ~ r(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_60_1) ).
cnf(c_159,plain,
( ~ r1most(X0)
| ~ r(X0,X1)
| equalish(X1,X2)
| ~ r(X0,X2) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_160,plain,
( ~ r1most(X0)
| ~ r(X0,X1)
| ~ r(X0,X2)
| equalish(X1,X2) ),
inference(rewriting,[status(thm)],[c_159]) ).
cnf(c_199,plain,
( ~ r1most(exist)
| ~ r(exist,X0)
| equalish(X0,u1r1(exist)) ),
inference(resolution,[status(thm)],[c_194,c_160]) ).
cnf(c_202,plain,
( ~ r1most(exist)
| ~ r(exist,X0)
| equalish(X0,u1r1(exist)) ),
inference(rewriting,[status(thm)],[c_199]) ).
cnf(c_8,plain,
( d(X0)
| ~ e(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_70_1) ).
cnf(c_109,plain,
( d(X0)
| ~ e(X0) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_168,plain,
d(exist),
inference(resolution,[status(thm)],[c_163,c_109]) ).
cnf(c_169,plain,
d(exist),
inference(rewriting,[status(thm)],[c_168]) ).
cnf(c_4,plain,
( r1most(X0)
| ~ d(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_72_1) ).
cnf(c_101,plain,
( r1most(X0)
| ~ d(X0) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_102,plain,
( ~ d(X0)
| r1most(X0) ),
inference(rewriting,[status(thm)],[c_101]) ).
cnf(c_173,plain,
r1most(exist),
inference(resolution,[status(thm)],[c_169,c_102]) ).
cnf(c_174,plain,
r1most(exist),
inference(rewriting,[status(thm)],[c_173]) ).
cnf(c_218,plain,
( ~ r(exist,X0)
| equalish(X0,u1r1(exist)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_202,c_174]) ).
cnf(c_219,plain,
( ~ r(exist,X0)
| equalish(X0,u1r1(exist)) ),
inference(rewriting,[status(thm)],[c_218]) ).
cnf(c_25,plain,
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ r2least(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_62_1) ).
cnf(c_143,plain,
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ r2least(X0) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_144,plain,
( ~ r2least(X0)
| ~ equalish(u1r2(X0),u1r1(X0)) ),
inference(rewriting,[status(thm)],[c_143]) ).
cnf(c_189,plain,
~ equalish(u1r2(exist),u1r1(exist)),
inference(resolution,[status(thm)],[c_179,c_144]) ).
cnf(c_196,plain,
~ equalish(u1r2(exist),u1r1(exist)),
inference(rewriting,[status(thm)],[c_189]) ).
cnf(c_222,plain,
~ r(exist,u1r2(exist)),
inference(resolution,[status(thm)],[c_219,c_196]) ).
cnf(c_223,plain,
~ r(exist,u1r2(exist)),
inference(rewriting,[status(thm)],[c_222]) ).
cnf(c_21,plain,
( r(X0,u1r2(X0))
| ~ r2least(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p',c_0_64_1) ).
cnf(c_135,plain,
( r(X0,u1r2(X0))
| ~ r2least(X0) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_136,plain,
( ~ r2least(X0)
| r(X0,u1r2(X0)) ),
inference(rewriting,[status(thm)],[c_135]) ).
cnf(c_190,plain,
r(exist,u1r2(exist)),
inference(resolution,[status(thm)],[c_179,c_136]) ).
cnf(c_195,plain,
r(exist,u1r2(exist)),
inference(rewriting,[status(thm)],[c_190]) ).
cnf(c_225,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_223,c_195]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.12/0.31 % Computer : n023.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Tue Jun 7 16:10:53 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.12/0.32 % Running in mono-core mode
% 0.16/0.38 % Orienting using strategy Equiv(ClausalAll)
% 0.16/0.38 % Orientation found
% 0.16/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_7a0303.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_8c8ef1 | grep -v "SZS"
% 0.16/0.40
% 0.16/0.40 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.16/0.40
% 0.16/0.40 %
% 0.16/0.40 % ------ iProver source info
% 0.16/0.40
% 0.16/0.40 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.16/0.40 % git: non_committed_changes: true
% 0.16/0.40 % git: last_make_outside_of_git: true
% 0.16/0.40
% 0.16/0.40 %
% 0.16/0.40 % ------ Input Options
% 0.16/0.40
% 0.16/0.40 % --out_options all
% 0.16/0.40 % --tptp_safe_out true
% 0.16/0.40 % --problem_path ""
% 0.16/0.40 % --include_path ""
% 0.16/0.40 % --clausifier .//eprover
% 0.16/0.40 % --clausifier_options --tstp-format
% 0.16/0.40 % --stdin false
% 0.16/0.40 % --dbg_backtrace false
% 0.16/0.40 % --dbg_dump_prop_clauses false
% 0.16/0.40 % --dbg_dump_prop_clauses_file -
% 0.16/0.40 % --dbg_out_stat false
% 0.16/0.40
% 0.16/0.40 % ------ General Options
% 0.16/0.40
% 0.16/0.40 % --fof false
% 0.16/0.40 % --time_out_real 150.
% 0.16/0.40 % --time_out_prep_mult 0.2
% 0.16/0.40 % --time_out_virtual -1.
% 0.16/0.40 % --schedule none
% 0.16/0.40 % --ground_splitting input
% 0.16/0.40 % --splitting_nvd 16
% 0.16/0.40 % --non_eq_to_eq false
% 0.16/0.40 % --prep_gs_sim true
% 0.16/0.40 % --prep_unflatten false
% 0.16/0.40 % --prep_res_sim true
% 0.16/0.40 % --prep_upred true
% 0.16/0.40 % --res_sim_input true
% 0.16/0.40 % --clause_weak_htbl true
% 0.16/0.40 % --gc_record_bc_elim false
% 0.16/0.40 % --symbol_type_check false
% 0.16/0.40 % --clausify_out false
% 0.16/0.40 % --large_theory_mode false
% 0.16/0.40 % --prep_sem_filter none
% 0.16/0.40 % --prep_sem_filter_out false
% 0.16/0.40 % --preprocessed_out false
% 0.16/0.40 % --sub_typing false
% 0.16/0.40 % --brand_transform false
% 0.16/0.40 % --pure_diseq_elim true
% 0.16/0.40 % --min_unsat_core false
% 0.16/0.40 % --pred_elim true
% 0.16/0.40 % --add_important_lit false
% 0.16/0.40 % --soft_assumptions false
% 0.16/0.40 % --reset_solvers false
% 0.16/0.40 % --bc_imp_inh []
% 0.16/0.40 % --conj_cone_tolerance 1.5
% 0.16/0.40 % --prolific_symb_bound 500
% 0.16/0.40 % --lt_threshold 2000
% 0.16/0.40
% 0.16/0.40 % ------ SAT Options
% 0.16/0.40
% 0.16/0.40 % --sat_mode false
% 0.16/0.40 % --sat_fm_restart_options ""
% 0.16/0.40 % --sat_gr_def false
% 0.16/0.40 % --sat_epr_types true
% 0.16/0.40 % --sat_non_cyclic_types false
% 0.16/0.40 % --sat_finite_models false
% 0.16/0.40 % --sat_fm_lemmas false
% 0.16/0.40 % --sat_fm_prep false
% 0.16/0.40 % --sat_fm_uc_incr true
% 0.16/0.40 % --sat_out_model small
% 0.16/0.40 % --sat_out_clauses false
% 0.16/0.40
% 0.16/0.40 % ------ QBF Options
% 0.16/0.40
% 0.16/0.40 % --qbf_mode false
% 0.16/0.40 % --qbf_elim_univ true
% 0.16/0.40 % --qbf_sk_in true
% 0.16/0.40 % --qbf_pred_elim true
% 0.16/0.40 % --qbf_split 32
% 0.16/0.40
% 0.16/0.40 % ------ BMC1 Options
% 0.16/0.40
% 0.16/0.40 % --bmc1_incremental false
% 0.16/0.40 % --bmc1_axioms reachable_all
% 0.16/0.40 % --bmc1_min_bound 0
% 0.16/0.40 % --bmc1_max_bound -1
% 0.16/0.40 % --bmc1_max_bound_default -1
% 0.16/0.40 % --bmc1_symbol_reachability true
% 0.16/0.40 % --bmc1_property_lemmas false
% 0.16/0.40 % --bmc1_k_induction false
% 0.16/0.40 % --bmc1_non_equiv_states false
% 0.16/0.40 % --bmc1_deadlock false
% 0.16/0.40 % --bmc1_ucm false
% 0.16/0.40 % --bmc1_add_unsat_core none
% 0.16/0.40 % --bmc1_unsat_core_children false
% 0.16/0.40 % --bmc1_unsat_core_extrapolate_axioms false
% 0.16/0.40 % --bmc1_out_stat full
% 0.16/0.40 % --bmc1_ground_init false
% 0.16/0.40 % --bmc1_pre_inst_next_state false
% 0.16/0.40 % --bmc1_pre_inst_state false
% 0.16/0.40 % --bmc1_pre_inst_reach_state false
% 0.16/0.40 % --bmc1_out_unsat_core false
% 0.16/0.40 % --bmc1_aig_witness_out false
% 0.16/0.40 % --bmc1_verbose false
% 0.16/0.40 % --bmc1_dump_clauses_tptp false
% 0.16/0.41 % --bmc1_dump_unsat_core_tptp false
% 0.16/0.41 % --bmc1_dump_file -
% 0.16/0.41 % --bmc1_ucm_expand_uc_limit 128
% 0.16/0.41 % --bmc1_ucm_n_expand_iterations 6
% 0.16/0.41 % --bmc1_ucm_extend_mode 1
% 0.16/0.41 % --bmc1_ucm_init_mode 2
% 0.16/0.41 % --bmc1_ucm_cone_mode none
% 0.16/0.41 % --bmc1_ucm_reduced_relation_type 0
% 0.16/0.41 % --bmc1_ucm_relax_model 4
% 0.16/0.41 % --bmc1_ucm_full_tr_after_sat true
% 0.16/0.41 % --bmc1_ucm_expand_neg_assumptions false
% 0.16/0.41 % --bmc1_ucm_layered_model none
% 0.16/0.41 % --bmc1_ucm_max_lemma_size 10
% 0.16/0.41
% 0.16/0.41 % ------ AIG Options
% 0.16/0.41
% 0.16/0.41 % --aig_mode false
% 0.16/0.41
% 0.16/0.41 % ------ Instantiation Options
% 0.16/0.41
% 0.16/0.41 % --instantiation_flag true
% 0.16/0.41 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.16/0.41 % --inst_solver_per_active 750
% 0.16/0.41 % --inst_solver_calls_frac 0.5
% 0.16/0.41 % --inst_passive_queue_type priority_queues
% 0.16/0.41 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.16/0.41 % --inst_passive_queues_freq [25;2]
% 0.16/0.41 % --inst_dismatching true
% 0.16/0.41 % --inst_eager_unprocessed_to_passive true
% 0.16/0.41 % --inst_prop_sim_given true
% 0.16/0.41 % --inst_prop_sim_new false
% 0.16/0.41 % --inst_orphan_elimination true
% 0.16/0.41 % --inst_learning_loop_flag true
% 0.16/0.41 % --inst_learning_start 3000
% 0.16/0.41 % --inst_learning_factor 2
% 0.16/0.41 % --inst_start_prop_sim_after_learn 3
% 0.16/0.41 % --inst_sel_renew solver
% 0.16/0.41 % --inst_lit_activity_flag true
% 0.16/0.41 % --inst_out_proof true
% 0.16/0.41
% 0.16/0.41 % ------ Resolution Options
% 0.16/0.41
% 0.16/0.41 % --resolution_flag true
% 0.16/0.41 % --res_lit_sel kbo_max
% 0.16/0.41 % --res_to_prop_solver none
% 0.16/0.41 % --res_prop_simpl_new false
% 0.16/0.41 % --res_prop_simpl_given false
% 0.16/0.41 % --res_passive_queue_type priority_queues
% 0.16/0.41 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.16/0.41 % --res_passive_queues_freq [15;5]
% 0.16/0.41 % --res_forward_subs full
% 0.16/0.41 % --res_backward_subs full
% 0.16/0.41 % --res_forward_subs_resolution true
% 0.16/0.41 % --res_backward_subs_resolution true
% 0.16/0.41 % --res_orphan_elimination false
% 0.16/0.41 % --res_time_limit 1000.
% 0.16/0.41 % --res_out_proof true
% 0.16/0.41 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_7a0303.s
% 0.16/0.41 % --modulo true
% 0.16/0.41
% 0.16/0.41 % ------ Combination Options
% 0.16/0.41
% 0.16/0.41 % --comb_res_mult 1000
% 0.16/0.41 % --comb_inst_mult 300
% 0.16/0.41 % ------
% 0.16/0.41
% 0.16/0.41 % ------ Parsing...% successful
% 0.16/0.41
% 0.16/0.41 % ------ 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.16/0.41
% 0.16/0.41 % ------ Proving...
% 0.16/0.41 % ------ Problem Properties
% 0.16/0.41
% 0.16/0.41 %
% 0.16/0.41 % EPR false
% 0.16/0.41 % Horn false
% 0.16/0.41 % Has equality false
% 0.16/0.41
% 0.16/0.41 % % ------ Input Options Time Limit: Unbounded
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 % % ------ Current options:
% 0.16/0.41
% 0.16/0.41 % ------ Input Options
% 0.16/0.41
% 0.16/0.41 % --out_options all
% 0.16/0.41 % --tptp_safe_out true
% 0.16/0.41 % --problem_path ""
% 0.16/0.41 % --include_path ""
% 0.16/0.41 % --clausifier .//eprover
% 0.16/0.41 % --clausifier_options --tstp-format
% 0.16/0.41 % --stdin false
% 0.16/0.41 % --dbg_backtrace false
% 0.16/0.41 % --dbg_dump_prop_clauses false
% 0.16/0.41 % --dbg_dump_prop_clauses_file -
% 0.16/0.41 % --dbg_out_stat false
% 0.16/0.41
% 0.16/0.41 % ------ General Options
% 0.16/0.41
% 0.16/0.41 % --fof false
% 0.16/0.41 % --time_out_real 150.
% 0.16/0.41 % --time_out_prep_mult 0.2
% 0.16/0.41 % --time_out_virtual -1.
% 0.16/0.41 % --schedule none
% 0.16/0.41 % --ground_splitting input
% 0.16/0.41 % --splitting_nvd 16
% 0.16/0.41 % --non_eq_to_eq false
% 0.16/0.41 % --prep_gs_sim true
% 0.16/0.41 % --prep_unflatten false
% 0.16/0.41 % --prep_res_sim true
% 0.16/0.41 % --prep_upred true
% 0.16/0.41 % --res_sim_input true
% 0.16/0.41 % --clause_weak_htbl true
% 0.16/0.41 % --gc_record_bc_elim false
% 0.16/0.41 % --symbol_type_check false
% 0.16/0.41 % --clausify_out false
% 0.16/0.41 % --large_theory_mode false
% 0.16/0.41 % --prep_sem_filter none
% 0.16/0.41 % --prep_sem_filter_out false
% 0.16/0.41 % --preprocessed_out false
% 0.16/0.41 % --sub_typing false
% 0.16/0.41 % --brand_transform false
% 0.16/0.41 % --pure_diseq_elim true
% 0.16/0.41 % --min_unsat_core false
% 0.16/0.41 % --pred_elim true
% 0.16/0.41 % --add_important_lit false
% 0.16/0.41 % --soft_assumptions false
% 0.16/0.41 % --reset_solvers false
% 0.16/0.41 % --bc_imp_inh []
% 0.16/0.41 % --conj_cone_tolerance 1.5
% 0.16/0.41 % --prolific_symb_bound 500
% 0.16/0.41 % --lt_threshold 2000
% 0.16/0.41
% 0.16/0.41 % ------ SAT Options
% 0.16/0.41
% 0.16/0.41 % --sat_mode false
% 0.16/0.41 % --sat_fm_restart_options ""
% 0.16/0.41 % --sat_gr_def false
% 0.16/0.41 % --sat_epr_types true
% 0.16/0.41 % --sat_non_cyclic_types false
% 0.16/0.41 % --sat_finite_models false
% 0.16/0.41 % --sat_fm_lemmas false
% 0.16/0.41 % --sat_fm_prep false
% 0.16/0.41 % --sat_fm_uc_incr true
% 0.16/0.41 % --sat_out_model small
% 0.16/0.41 % --sat_out_clauses false
% 0.16/0.41
% 0.16/0.41 % ------ QBF Options
% 0.16/0.41
% 0.16/0.41 % --qbf_mode false
% 0.16/0.41 % --qbf_elim_univ true
% 0.16/0.41 % --qbf_sk_in true
% 0.16/0.41 % --qbf_pred_elim true
% 0.16/0.41 % --qbf_split 32
% 0.16/0.41
% 0.16/0.41 % ------ BMC1 Options
% 0.16/0.41
% 0.16/0.41 % --bmc1_incremental false
% 0.16/0.41 % --bmc1_axioms reachable_all
% 0.16/0.41 % --bmc1_min_bound 0
% 0.16/0.41 % --bmc1_max_bound -1
% 0.16/0.41 % --bmc1_max_bound_default -1
% 0.16/0.41 % --bmc1_symbol_reachability true
% 0.16/0.41 % --bmc1_property_lemmas false
% 0.16/0.41 % --bmc1_k_induction false
% 0.16/0.41 % --bmc1_non_equiv_states false
% 0.16/0.41 % --bmc1_deadlock false
% 0.16/0.41 % --bmc1_ucm false
% 0.16/0.41 % --bmc1_add_unsat_core none
% 0.16/0.41 % --bmc1_unsat_core_children false
% 0.16/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.16/0.41 % --bmc1_out_stat full
% 0.16/0.41 % --bmc1_ground_init false
% 0.16/0.41 % --bmc1_pre_inst_next_state false
% 0.16/0.41 % --bmc1_pre_inst_state false
% 0.16/0.41 % --bmc1_pre_inst_reach_state false
% 0.16/0.41 % --bmc1_out_unsat_core false
% 0.16/0.41 % --bmc1_aig_witness_out false
% 0.16/0.41 % --bmc1_verbose false
% 0.16/0.41 % --bmc1_dump_clauses_tptp false
% 0.16/0.41 % --bmc1_dump_unsat_core_tptp false
% 0.16/0.41 % --bmc1_dump_file -
% 0.16/0.41 % --bmc1_ucm_expand_uc_limit 128
% 0.16/0.41 % --bmc1_ucm_n_expand_iterations 6
% 0.16/0.41 % --bmc1_ucm_extend_mode 1
% 0.16/0.41 % --bmc1_ucm_init_mode 2
% 0.16/0.41 % --bmc1_ucm_cone_mode none
% 0.16/0.41 % --bmc1_ucm_reduced_relation_type 0
% 0.16/0.41 % --bmc1_ucm_relax_model 4
% 0.16/0.41 % --bmc1_ucm_full_tr_after_sat true
% 0.16/0.41 % --bmc1_ucm_expand_neg_assumptions false
% 0.16/0.41 % --bmc1_ucm_layered_model none
% 0.16/0.41 % --bmc1_ucm_max_lemma_size 10
% 0.16/0.41
% 0.16/0.41 % ------ AIG Options
% 0.16/0.41
% 0.16/0.41 % --aig_mode false
% 0.16/0.41
% 0.16/0.41 % ------ Instantiation Options
% 0.16/0.41
% 0.16/0.41 % --instantiation_flag true
% 0.16/0.41 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.16/0.41 % --inst_solver_per_active 750
% 0.16/0.41 % --inst_solver_calls_frac 0.5
% 0.16/0.41 % --inst_passive_queue_type priority_queues
% 0.16/0.41 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.16/0.41 % --inst_passive_queues_freq [25;2]
% 0.16/0.41 % --inst_dismatching true
% 0.16/0.41 % --inst_eager_unprocessed_to_passive true
% 0.16/0.41 % --inst_prop_sim_given true
% 0.16/0.41 % --inst_prop_sim_new false
% 0.16/0.41 % --inst_orphan_elimination true
% 0.16/0.41 % --inst_learning_loop_flag true
% 0.16/0.41 % --inst_learning_start 3000
% 0.16/0.41 % --inst_learning_factor 2
% 0.16/0.41 % --inst_start_prop_sim_after_learn 3
% 0.16/0.41 % --inst_sel_renew solver
% 0.16/0.41 % --inst_lit_activity_flag true
% 0.16/0.41 % --inst_out_proof true
% 0.16/0.41
% 0.16/0.41 % ------ Resolution Options
% 0.16/0.41
% 0.16/0.41 % --resolution_flag true
% 0.16/0.41 % --res_lit_sel kbo_max
% 0.16/0.41 % --res_to_prop_solver none
% 0.16/0.41 % --res_prop_simpl_new false
% 0.16/0.41 % --res_prop_simpl_given false
% 0.16/0.41 % --res_passive_queue_type priority_queues
% 0.16/0.41 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.16/0.41 % --res_passive_queues_freq [15;5]
% 0.16/0.41 % --res_forward_subs full
% 0.16/0.41 % --res_backward_subs full
% 0.16/0.41 % --res_forward_subs_resolution true
% 0.16/0.41 % --res_backward_subs_resolution true
% 0.16/0.41 % --res_orphan_elimination false
% 0.16/0.41 % --res_time_limit 1000.
% 0.16/0.41 % --res_out_proof true
% 0.16/0.41 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_7a0303.s
% 0.16/0.41 % --modulo true
% 0.16/0.41
% 0.16/0.41 % ------ Combination Options
% 0.16/0.41
% 0.16/0.41 % --comb_res_mult 1000
% 0.16/0.41 % --comb_inst_mult 300
% 0.16/0.41 % ------
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 % ------ Proving...
% 0.16/0.41 % warning: shown sat in sat incomplete mode
% 0.16/0.41 %
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 cnf(c_7,plain,
% 0.16/0.41 ( equalish(X0,X1) | r2least(X2) | ~ r(X2,X1) | ~ r(X2,X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_61_3) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_107,plain,
% 0.16/0.41 ( equalish(X0,X1) | r2least(X2) | ~ r(X2,X1) | ~ r(X2,X0) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_7]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_108,plain,
% 0.16/0.41 ( equalish(X0,X1) | ~ r(X2,X1) | ~ r(X2,X0) | r2least(X2) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_107]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_4,plain,
% 0.16/0.41 ( ~ r(X0,X1) | ~ r(X0,X2) | r2least(X0) | equalish(X1,X2) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_61_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_101,plain,
% 0.16/0.41 ( ~ r(X0,X1) | ~ r(X0,X2) | r2least(X0) | equalish(X1,X2) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_4]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_102,plain,
% 0.16/0.41 ( equalish(X0,X1) | ~ r(X2,X0) | ~ r(X2,X1) | r2least(X2) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_101]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_0,plain,
% 0.16/0.41 ( ~ r1most(X0) | ~ r(X0,X1) | ~ r(X0,X2) | equalish(X1,X2) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_60_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_93,plain,
% 0.16/0.41 ( ~ r1most(X0) | ~ r(X0,X1) | ~ r(X0,X2) | equalish(X1,X2) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_0]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_94,plain,
% 0.16/0.41 ( equalish(X0,X1) | ~ r(X2,X0) | ~ r(X2,X1) | ~ r1most(X2) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_93]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_35,negated_conjecture,
% 0.16/0.41 ( e(exist) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_4) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_50,negated_conjecture,
% 0.16/0.41 ( e(exist) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_35]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_54,negated_conjecture,
% 0.16/0.41 ( e(exist) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_50]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_55,negated_conjecture,
% 0.16/0.41 ( e(exist) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_54]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_56,negated_conjecture,
% 0.16/0.41 ( e(exist) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_55]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_163,negated_conjecture,
% 0.16/0.41 ( e(exist) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_56]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_33,plain,
% 0.16/0.41 ( ~ e(X0) | c(X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_74_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_159,plain,( ~ e(X0) | c(X0) ),inference(copy,[status(esa)],[c_33]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_31,plain,
% 0.16/0.41 ( ~ e(X0) | d(X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_73_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_155,plain,( ~ e(X0) | d(X0) ),inference(copy,[status(esa)],[c_31]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_29,plain,
% 0.16/0.41 ( ~ r1most(X0) | d(X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_72_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_151,plain,
% 0.16/0.41 ( ~ r1most(X0) | d(X0) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_29]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_27,plain,
% 0.16/0.41 ( ~ d(X0) | r1most(X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_71_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_147,plain,
% 0.16/0.41 ( ~ d(X0) | r1most(X0) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_27]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_148,plain,
% 0.16/0.41 ( r1most(X0) | ~ d(X0) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_147]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_25,plain,
% 0.16/0.41 ( ~ r2least(X0) | c(X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_70_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_143,plain,
% 0.16/0.41 ( ~ r2least(X0) | c(X0) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_25]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_23,plain,
% 0.16/0.41 ( ~ c(X0) | r2least(X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_69_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_139,plain,
% 0.16/0.41 ( ~ c(X0) | r2least(X0) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_23]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_140,plain,
% 0.16/0.41 ( r2least(X0) | ~ c(X0) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_139]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_20,plain,
% 0.16/0.41 ( ~ c(X0) | ~ d(X0) | e(X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_68_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_133,plain,
% 0.16/0.41 ( ~ c(X0) | ~ d(X0) | e(X0) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_20]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_134,plain,
% 0.16/0.41 ( e(X0) | ~ d(X0) | ~ c(X0) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_133]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_18,plain,
% 0.16/0.41 ( r1most(X0) | r(X0,u3r2(X0)) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_67_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_129,plain,
% 0.16/0.41 ( r1most(X0) | r(X0,u3r2(X0)) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_18]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_130,plain,
% 0.16/0.41 ( r(X0,u3r2(X0)) | r1most(X0) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_129]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_16,plain,
% 0.16/0.41 ( r1most(X0) | r(X0,u3r1(X0)) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_66_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_125,plain,
% 0.16/0.41 ( r1most(X0) | r(X0,u3r1(X0)) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_16]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_126,plain,
% 0.16/0.41 ( r(X0,u3r1(X0)) | r1most(X0) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_125]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_14,plain,
% 0.16/0.41 ( ~ r2least(X0) | r(X0,u1r2(X0)) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_65_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_121,plain,
% 0.16/0.41 ( ~ r2least(X0) | r(X0,u1r2(X0)) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_14]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_122,plain,
% 0.16/0.41 ( r(X0,u1r2(X0)) | ~ r2least(X0) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_121]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_12,plain,
% 0.16/0.41 ( ~ r2least(X0) | r(X0,u1r1(X0)) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_64_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_117,plain,
% 0.16/0.41 ( ~ r2least(X0) | r(X0,u1r1(X0)) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_12]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_118,plain,
% 0.16/0.41 ( r(X0,u1r1(X0)) | ~ r2least(X0) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_117]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_10,plain,
% 0.16/0.41 ( ~ equalish(u3r2(X0),u3r1(X0)) | r1most(X0) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_63_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_113,plain,
% 0.16/0.41 ( ~ equalish(u3r2(X0),u3r1(X0)) | r1most(X0) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_10]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_8,plain,
% 0.16/0.41 ( ~ r2least(X0) | ~ equalish(u1r2(X0),u1r1(X0)) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_62_0) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_109,plain,
% 0.16/0.41 ( ~ r2least(X0) | ~ equalish(u1r2(X0),u1r1(X0)) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_8]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_110,plain,
% 0.16/0.41 ( ~ equalish(u1r2(X0),u1r1(X0)) | ~ r2least(X0) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_109]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_2,plain,
% 0.16/0.41 ( ~ r1most(X0) | equalish(X1,X2) | ~ r(X0,X2) | ~ r(X0,X1) ),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p', c_0_60_2) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_97,plain,
% 0.16/0.41 ( ~ r1most(X0) | equalish(X1,X2) | ~ r(X0,X2) | ~ r(X0,X1) ),
% 0.16/0.41 inference(copy,[status(esa)],[c_2]) ).
% 0.16/0.41
% 0.16/0.41 cnf(c_98,plain,
% 0.16/0.41 ( equalish(X0,X1) | ~ r(X2,X1) | ~ r(X2,X0) | ~ r1most(X2) ),
% 0.16/0.41 inference(rewriting,[status(thm)],[c_97]) ).
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 % ------ Statistics
% 0.16/0.41
% 0.16/0.41 % ------ General
% 0.16/0.41
% 0.16/0.41 % num_of_input_clauses: 36
% 0.16/0.41 % num_of_input_neg_conjectures: 1
% 0.16/0.41 % num_of_splits: 0
% 0.16/0.41 % num_of_split_atoms: 0
% 0.16/0.41 % num_of_sem_filtered_clauses: 0
% 0.16/0.41 % num_of_subtypes: 0
% 0.16/0.41 % monotx_restored_types: 0
% 0.16/0.41 % sat_num_of_epr_types: 0
% 0.16/0.41 % sat_num_of_non_cyclic_types: 0
% 0.16/0.41 % sat_guarded_non_collapsed_types: 0
% 0.16/0.41 % is_epr: 0
% 0.16/0.41 % is_horn: 0
% 0.16/0.41 % has_eq: 0
% 0.16/0.41 % num_pure_diseq_elim: 0
% 0.16/0.41 % simp_replaced_by: 0
% 0.16/0.41 % res_preprocessed: 2
% 0.16/0.41 % prep_upred: 0
% 0.16/0.41 % prep_unflattend: 0
% 0.16/0.41 % pred_elim_cands: 0
% 0.16/0.41 % pred_elim: 0
% 0.16/0.41 % pred_elim_cl: 0
% 0.16/0.41 % pred_elim_cycles: 0
% 0.16/0.41 % forced_gc_time: 0
% 0.16/0.41 % gc_basic_clause_elim: 0
% 0.16/0.41 % parsing_time: 0.001
% 0.16/0.41 % sem_filter_time: 0.
% 0.16/0.41 % pred_elim_time: 0.
% 0.16/0.41 % out_proof_time: 0.
% 0.16/0.41 % monotx_time: 0.
% 0.16/0.41 % subtype_inf_time: 0.
% 0.16/0.41 % unif_index_cands_time: 0.
% 0.16/0.41 % unif_index_add_time: 0.
% 0.16/0.41 % total_time: 0.027
% 0.16/0.41 % num_of_symbols: 37
% 0.16/0.41 % num_of_terms: 88
% 0.16/0.41
% 0.16/0.41 % ------ Propositional Solver
% 0.16/0.41
% 0.16/0.41 % prop_solver_calls: 1
% 0.16/0.41 % prop_fast_solver_calls: 3
% 0.16/0.41 % prop_num_of_clauses: 32
% 0.16/0.41 % prop_preprocess_simplified: 118
% 0.16/0.41 % prop_fo_subsumed: 0
% 0.16/0.41 % prop_solver_time: 0.
% 0.16/0.41 % prop_fast_solver_time: 0.
% 0.16/0.41 % prop_unsat_core_time: 0.
% 0.16/0.41
% 0.16/0.41 % ------ QBF
% 0.16/0.41
% 0.16/0.41 % qbf_q_res: 0
% 0.16/0.41 % qbf_num_tautologies: 0
% 0.16/0.41 % qbf_prep_cycles: 0
% 0.16/0.41
% 0.16/0.41 % ------ BMC1
% 0.16/0.41
% 0.16/0.41 % bmc1_current_bound: -1
% 0.16/0.41 % bmc1_last_solved_bound: -1
% 0.16/0.41 % bmc1_unsat_core_size: -1
% 0.16/0.41 % bmc1_unsat_core_parents_size: -1
% 0.16/0.41 % bmc1_merge_next_fun: 0
% 0.16/0.41 % bmc1_unsat_core_clauses_time: 0.
% 0.16/0.41
% 0.16/0.41 % ------ Instantiation
% 0.16/0.41
% 0.16/0.41 % inst_num_of_clauses: 36
% 0.16/0.41 % inst_num_in_passive: 0
% 0.16/0.41 % inst_num_in_active: 0
% 0.16/0.41 % inst_num_in_unprocessed: 36
% 0.16/0.41 % inst_num_of_loops: 0
% 0.16/0.41 % inst_num_of_learning_restarts: 0
% 0.16/0.41 % inst_num_moves_active_passive: 0
% 0.16/0.41 % inst_lit_activity: 0
% 0.16/0.41 % inst_lit_activity_moves: 0
% 0.16/0.41 % inst_num_tautologies: 0
% 0.16/0.41 % inst_num_prop_implied: 0
% 0.16/0.41 % inst_num_existing_simplified: 0
% 0.16/0.41 % inst_num_eq_res_simplified: 0
% 0.16/0.41 % inst_num_child_elim: 0
% 0.16/0.41 % inst_num_of_dismatching_blockings: 0
% 0.16/0.41 % inst_num_of_non_proper_insts: 0
% 0.16/0.41 % inst_num_of_duplicates: 0
% 0.16/0.41 % inst_inst_num_from_inst_to_res: 0
% 0.16/0.41 % inst_dismatching_checking_time: 0.
% 0.16/0.41
% 0.16/0.41 % ------ Resolution
% 0.16/0.41
% 0.16/0.41 % res_num_of_clauses: 39
% 0.16/0.41 % res_num_in_passive: 0
% 0.16/0.41 % res_num_in_active: 18
% 0.16/0.41 % res_num_of_loops: 2
% 0.16/0.41 % res_forward_subset_subsumed: 18
% 0.16/0.41 % res_backward_subset_subsumed: 0
% 0.16/0.41 % res_forward_subsumed: 0
% 0.16/0.41 % res_backward_subsumed: 0
% 0.16/0.41 % res_forward_subsumption_resolution: 0
% 0.16/0.41 % res_backward_subsumption_resolution: 0
% 0.16/0.41 % res_clause_to_clause_subsumption: 0
% 0.16/0.41 % res_orphan_elimination: 0
% 0.16/0.41 % res_tautology_del: 0
% 0.16/0.41 % res_num_eq_res_simplified: 0
% 0.16/0.41 % res_num_sel_changes: 0
% 0.16/0.41 % res_moves_from_active_to_pass: 0
% 0.16/0.41
% 0.16/0.41 % Status Unknown
% 0.16/0.45 % Orienting using strategy ClausalAll
% 0.16/0.45 % Orientation found
% 0.16/0.45 % 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_7a0303.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_e20a4d.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_0e2775 | grep -v "SZS"
% 0.16/0.46
% 0.16/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.16/0.46
% 0.16/0.46 %
% 0.16/0.46 % ------ iProver source info
% 0.16/0.46
% 0.16/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.16/0.46 % git: non_committed_changes: true
% 0.16/0.46 % git: last_make_outside_of_git: true
% 0.16/0.46
% 0.16/0.46 %
% 0.16/0.46 % ------ Input Options
% 0.16/0.46
% 0.16/0.46 % --out_options all
% 0.16/0.46 % --tptp_safe_out true
% 0.16/0.46 % --problem_path ""
% 0.16/0.46 % --include_path ""
% 0.16/0.46 % --clausifier .//eprover
% 0.16/0.46 % --clausifier_options --tstp-format
% 0.16/0.46 % --stdin false
% 0.16/0.46 % --dbg_backtrace false
% 0.16/0.46 % --dbg_dump_prop_clauses false
% 0.16/0.46 % --dbg_dump_prop_clauses_file -
% 0.16/0.46 % --dbg_out_stat false
% 0.16/0.46
% 0.16/0.46 % ------ General Options
% 0.16/0.46
% 0.16/0.46 % --fof false
% 0.16/0.46 % --time_out_real 150.
% 0.16/0.46 % --time_out_prep_mult 0.2
% 0.16/0.46 % --time_out_virtual -1.
% 0.16/0.46 % --schedule none
% 0.16/0.46 % --ground_splitting input
% 0.16/0.46 % --splitting_nvd 16
% 0.16/0.46 % --non_eq_to_eq false
% 0.16/0.46 % --prep_gs_sim true
% 0.16/0.46 % --prep_unflatten false
% 0.16/0.46 % --prep_res_sim true
% 0.16/0.46 % --prep_upred true
% 0.16/0.46 % --res_sim_input true
% 0.16/0.46 % --clause_weak_htbl true
% 0.16/0.46 % --gc_record_bc_elim false
% 0.16/0.46 % --symbol_type_check false
% 0.16/0.46 % --clausify_out false
% 0.16/0.46 % --large_theory_mode false
% 0.16/0.46 % --prep_sem_filter none
% 0.16/0.46 % --prep_sem_filter_out false
% 0.16/0.46 % --preprocessed_out false
% 0.16/0.46 % --sub_typing false
% 0.16/0.46 % --brand_transform false
% 0.16/0.46 % --pure_diseq_elim true
% 0.16/0.46 % --min_unsat_core false
% 0.16/0.46 % --pred_elim true
% 0.16/0.46 % --add_important_lit false
% 0.16/0.46 % --soft_assumptions false
% 0.16/0.46 % --reset_solvers false
% 0.16/0.46 % --bc_imp_inh []
% 0.16/0.46 % --conj_cone_tolerance 1.5
% 0.16/0.46 % --prolific_symb_bound 500
% 0.16/0.46 % --lt_threshold 2000
% 0.16/0.46
% 0.16/0.46 % ------ SAT Options
% 0.16/0.46
% 0.16/0.46 % --sat_mode false
% 0.16/0.46 % --sat_fm_restart_options ""
% 0.16/0.46 % --sat_gr_def false
% 0.16/0.46 % --sat_epr_types true
% 0.16/0.46 % --sat_non_cyclic_types false
% 0.16/0.46 % --sat_finite_models false
% 0.16/0.46 % --sat_fm_lemmas false
% 0.16/0.46 % --sat_fm_prep false
% 0.16/0.46 % --sat_fm_uc_incr true
% 0.16/0.46 % --sat_out_model small
% 0.16/0.46 % --sat_out_clauses false
% 0.16/0.46
% 0.16/0.46 % ------ QBF Options
% 0.16/0.46
% 0.16/0.46 % --qbf_mode false
% 0.16/0.46 % --qbf_elim_univ true
% 0.16/0.46 % --qbf_sk_in true
% 0.16/0.46 % --qbf_pred_elim true
% 0.16/0.46 % --qbf_split 32
% 0.16/0.46
% 0.16/0.46 % ------ BMC1 Options
% 0.16/0.46
% 0.16/0.46 % --bmc1_incremental false
% 0.16/0.46 % --bmc1_axioms reachable_all
% 0.16/0.46 % --bmc1_min_bound 0
% 0.16/0.46 % --bmc1_max_bound -1
% 0.16/0.46 % --bmc1_max_bound_default -1
% 0.16/0.46 % --bmc1_symbol_reachability true
% 0.16/0.46 % --bmc1_property_lemmas false
% 0.16/0.46 % --bmc1_k_induction false
% 0.16/0.46 % --bmc1_non_equiv_states false
% 0.16/0.46 % --bmc1_deadlock false
% 0.16/0.46 % --bmc1_ucm false
% 0.16/0.46 % --bmc1_add_unsat_core none
% 0.16/0.46 % --bmc1_unsat_core_children false
% 0.16/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.16/0.46 % --bmc1_out_stat full
% 0.16/0.46 % --bmc1_ground_init false
% 0.16/0.46 % --bmc1_pre_inst_next_state false
% 0.16/0.46 % --bmc1_pre_inst_state false
% 0.16/0.46 % --bmc1_pre_inst_reach_state false
% 0.16/0.46 % --bmc1_out_unsat_core false
% 0.16/0.46 % --bmc1_aig_witness_out false
% 0.16/0.46 % --bmc1_verbose false
% 0.16/0.46 % --bmc1_dump_clauses_tptp false
% 0.16/0.47 % --bmc1_dump_unsat_core_tptp false
% 0.16/0.47 % --bmc1_dump_file -
% 0.16/0.47 % --bmc1_ucm_expand_uc_limit 128
% 0.16/0.47 % --bmc1_ucm_n_expand_iterations 6
% 0.16/0.47 % --bmc1_ucm_extend_mode 1
% 0.16/0.47 % --bmc1_ucm_init_mode 2
% 0.16/0.47 % --bmc1_ucm_cone_mode none
% 0.16/0.47 % --bmc1_ucm_reduced_relation_type 0
% 0.16/0.47 % --bmc1_ucm_relax_model 4
% 0.16/0.47 % --bmc1_ucm_full_tr_after_sat true
% 0.16/0.47 % --bmc1_ucm_expand_neg_assumptions false
% 0.16/0.47 % --bmc1_ucm_layered_model none
% 0.16/0.47 % --bmc1_ucm_max_lemma_size 10
% 0.16/0.47
% 0.16/0.47 % ------ AIG Options
% 0.16/0.47
% 0.16/0.47 % --aig_mode false
% 0.16/0.47
% 0.16/0.47 % ------ Instantiation Options
% 0.16/0.47
% 0.16/0.47 % --instantiation_flag true
% 0.16/0.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.16/0.47 % --inst_solver_per_active 750
% 0.16/0.47 % --inst_solver_calls_frac 0.5
% 0.16/0.47 % --inst_passive_queue_type priority_queues
% 0.16/0.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.16/0.47 % --inst_passive_queues_freq [25;2]
% 0.16/0.47 % --inst_dismatching true
% 0.16/0.47 % --inst_eager_unprocessed_to_passive true
% 0.16/0.47 % --inst_prop_sim_given true
% 0.16/0.47 % --inst_prop_sim_new false
% 0.16/0.47 % --inst_orphan_elimination true
% 0.16/0.47 % --inst_learning_loop_flag true
% 0.16/0.47 % --inst_learning_start 3000
% 0.16/0.47 % --inst_learning_factor 2
% 0.16/0.47 % --inst_start_prop_sim_after_learn 3
% 0.16/0.47 % --inst_sel_renew solver
% 0.16/0.47 % --inst_lit_activity_flag true
% 0.16/0.47 % --inst_out_proof true
% 0.16/0.47
% 0.16/0.47 % ------ Resolution Options
% 0.16/0.47
% 0.16/0.47 % --resolution_flag true
% 0.16/0.47 % --res_lit_sel kbo_max
% 0.16/0.47 % --res_to_prop_solver none
% 0.16/0.47 % --res_prop_simpl_new false
% 0.16/0.47 % --res_prop_simpl_given false
% 0.16/0.47 % --res_passive_queue_type priority_queues
% 0.16/0.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.16/0.47 % --res_passive_queues_freq [15;5]
% 0.16/0.47 % --res_forward_subs full
% 0.16/0.47 % --res_backward_subs full
% 0.16/0.47 % --res_forward_subs_resolution true
% 0.16/0.47 % --res_backward_subs_resolution true
% 0.16/0.47 % --res_orphan_elimination false
% 0.16/0.47 % --res_time_limit 1000.
% 0.16/0.47 % --res_out_proof true
% 0.16/0.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_7a0303.s
% 0.16/0.47 % --modulo true
% 0.16/0.47
% 0.16/0.47 % ------ Combination Options
% 0.16/0.47
% 0.16/0.47 % --comb_res_mult 1000
% 0.16/0.47 % --comb_inst_mult 300
% 0.16/0.47 % ------
% 0.16/0.47
% 0.16/0.47 % ------ Parsing...% successful
% 0.16/0.47
% 0.16/0.47 % ------ 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.16/0.47
% 0.16/0.47 % ------ Proving...
% 0.16/0.47 % ------ Problem Properties
% 0.16/0.47
% 0.16/0.47 %
% 0.16/0.47 % EPR false
% 0.16/0.47 % Horn false
% 0.16/0.47 % Has equality false
% 0.16/0.47
% 0.16/0.47 % % ------ Input Options Time Limit: Unbounded
% 0.16/0.47
% 0.16/0.47
% 0.16/0.47 % % ------ Current options:
% 0.16/0.47
% 0.16/0.47 % ------ Input Options
% 0.16/0.47
% 0.16/0.47 % --out_options all
% 0.16/0.47 % --tptp_safe_out true
% 0.16/0.47 % --problem_path ""
% 0.16/0.47 % --include_path ""
% 0.16/0.47 % --clausifier .//eprover
% 0.16/0.47 % --clausifier_options --tstp-format
% 0.16/0.47 % --stdin false
% 0.16/0.47 % --dbg_backtrace false
% 0.16/0.47 % --dbg_dump_prop_clauses false
% 0.16/0.47 % --dbg_dump_prop_clauses_file -
% 0.16/0.47 % --dbg_out_stat false
% 0.16/0.47
% 0.16/0.47 % ------ General Options
% 0.16/0.47
% 0.16/0.47 % --fof false
% 0.16/0.47 % --time_out_real 150.
% 0.16/0.47 % --time_out_prep_mult 0.2
% 0.16/0.47 % --time_out_virtual -1.
% 0.16/0.47 % --schedule none
% 0.16/0.47 % --ground_splitting input
% 0.16/0.47 % --splitting_nvd 16
% 0.16/0.47 % --non_eq_to_eq false
% 0.16/0.47 % --prep_gs_sim true
% 0.16/0.47 % --prep_unflatten false
% 0.16/0.47 % --prep_res_sim true
% 0.16/0.47 % --prep_upred true
% 0.16/0.47 % --res_sim_input true
% 0.16/0.47 % --clause_weak_htbl true
% 0.16/0.47 % --gc_record_bc_elim false
% 0.16/0.47 % --symbol_type_check false
% 0.16/0.47 % --clausify_out false
% 0.16/0.47 % --large_theory_mode false
% 0.16/0.47 % --prep_sem_filter none
% 0.16/0.47 % --prep_sem_filter_out false
% 0.16/0.47 % --preprocessed_out false
% 0.16/0.47 % --sub_typing false
% 0.16/0.47 % --brand_transform false
% 0.16/0.47 % --pure_diseq_elim true
% 0.16/0.47 % --min_unsat_core false
% 0.16/0.47 % --pred_elim true
% 0.16/0.47 % --add_important_lit false
% 0.16/0.47 % --soft_assumptions false
% 0.16/0.47 % --reset_solvers false
% 0.16/0.47 % --bc_imp_inh []
% 0.16/0.47 % --conj_cone_tolerance 1.5
% 0.16/0.47 % --prolific_symb_bound 500
% 0.16/0.47 % --lt_threshold 2000
% 0.16/0.47
% 0.16/0.47 % ------ SAT Options
% 0.16/0.47
% 0.16/0.47 % --sat_mode false
% 0.16/0.47 % --sat_fm_restart_options ""
% 0.16/0.47 % --sat_gr_def false
% 0.16/0.47 % --sat_epr_types true
% 0.16/0.47 % --sat_non_cyclic_types false
% 0.16/0.47 % --sat_finite_models false
% 0.16/0.47 % --sat_fm_lemmas false
% 0.16/0.47 % --sat_fm_prep false
% 0.16/0.47 % --sat_fm_uc_incr true
% 0.16/0.47 % --sat_out_model small
% 0.16/0.47 % --sat_out_clauses false
% 0.16/0.47
% 0.16/0.47 % ------ QBF Options
% 0.16/0.47
% 0.16/0.47 % --qbf_mode false
% 0.16/0.47 % --qbf_elim_univ true
% 0.16/0.47 % --qbf_sk_in true
% 0.16/0.47 % --qbf_pred_elim true
% 0.16/0.47 % --qbf_split 32
% 0.16/0.47
% 0.16/0.47 % ------ BMC1 Options
% 0.16/0.47
% 0.16/0.47 % --bmc1_incremental false
% 0.16/0.47 % --bmc1_axioms reachable_all
% 0.16/0.47 % --bmc1_min_bound 0
% 0.16/0.47 % --bmc1_max_bound -1
% 0.16/0.47 % --bmc1_max_bound_default -1
% 0.16/0.47 % --bmc1_symbol_reachability true
% 0.16/0.47 % --bmc1_property_lemmas false
% 0.16/0.47 % --bmc1_k_induction false
% 0.16/0.47 % --bmc1_non_equiv_states false
% 0.16/0.47 % --bmc1_deadlock false
% 0.16/0.47 % --bmc1_ucm false
% 0.16/0.47 % --bmc1_add_unsat_core none
% 0.16/0.47 % --bmc1_unsat_core_children false
% 0.16/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.16/0.47 % --bmc1_out_stat full
% 0.16/0.47 % --bmc1_ground_init false
% 0.16/0.47 % --bmc1_pre_inst_next_state false
% 0.16/0.47 % --bmc1_pre_inst_state false
% 0.16/0.47 % --bmc1_pre_inst_reach_state false
% 0.16/0.47 % --bmc1_out_unsat_core false
% 0.16/0.47 % --bmc1_aig_witness_out false
% 0.16/0.47 % --bmc1_verbose false
% 0.16/0.47 % --bmc1_dump_clauses_tptp false
% 0.16/0.47 % --bmc1_dump_unsat_core_tptp false
% 0.16/0.47 % --bmc1_dump_file -
% 0.16/0.47 % --bmc1_ucm_expand_uc_limit 128
% 0.16/0.47 % --bmc1_ucm_n_expand_iterations 6
% 0.16/0.47 % --bmc1_ucm_extend_mode 1
% 0.16/0.47 % --bmc1_ucm_init_mode 2
% 0.16/0.47 % --bmc1_ucm_cone_mode none
% 0.16/0.47 % --bmc1_ucm_reduced_relation_type 0
% 0.16/0.47 % --bmc1_ucm_relax_model 4
% 0.16/0.47 % --bmc1_ucm_full_tr_after_sat true
% 0.16/0.47 % --bmc1_ucm_expand_neg_assumptions false
% 0.16/0.47 % --bmc1_ucm_layered_model none
% 0.16/0.47 % --bmc1_ucm_max_lemma_size 10
% 0.16/0.47
% 0.16/0.47 % ------ AIG Options
% 0.16/0.47
% 0.16/0.47 % --aig_mode false
% 0.16/0.47
% 0.16/0.47 % ------ Instantiation Options
% 0.16/0.47
% 0.16/0.47 % --instantiation_flag true
% 0.16/0.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.16/0.47 % --inst_solver_per_active 750
% 0.16/0.47 % --inst_solver_calls_frac 0.5
% 0.16/0.47 % --inst_passive_queue_type priority_queues
% 0.16/0.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.16/0.47 % --inst_passive_queues_freq [25;2]
% 0.16/0.47 % --inst_dismatching true
% 0.16/0.47 % --inst_eager_unprocessed_to_passive true
% 0.16/0.47 % --inst_prop_sim_given true
% 0.16/0.47 % --inst_prop_sim_new false
% 0.16/0.47 % --inst_orphan_elimination true
% 0.16/0.47 % --inst_learning_loop_flag true
% 0.16/0.47 % --inst_learning_start 3000
% 0.16/0.47 % --inst_learning_factor 2
% 0.16/0.47 % --inst_start_prop_sim_after_learn 3
% 0.16/0.47 % --inst_sel_renew solver
% 0.16/0.47 % --inst_lit_activity_flag true
% 0.16/0.47 % --inst_out_proof true
% 0.16/0.47
% 0.16/0.47 % ------ Resolution Options
% 0.16/0.47
% 0.16/0.47 % --resolution_flag true
% 0.16/0.47 % --res_lit_sel kbo_max
% 0.16/0.47 % --res_to_prop_solver none
% 0.16/0.47 % --res_prop_simpl_new false
% 0.16/0.47 % --res_prop_simpl_given false
% 0.16/0.47 % --res_passive_queue_type priority_queues
% 0.16/0.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.16/0.47 % --res_passive_queues_freq [15;5]
% 0.16/0.47 % --res_forward_subs full
% 0.16/0.47 % --res_backward_subs full
% 0.16/0.47 % --res_forward_subs_resolution true
% 0.16/0.47 % --res_backward_subs_resolution true
% 0.16/0.47 % --res_orphan_elimination false
% 0.16/0.47 % --res_time_limit 1000.
% 0.16/0.47 % --res_out_proof true
% 0.16/0.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_7a0303.s
% 0.16/0.47 % --modulo true
% 0.16/0.47
% 0.16/0.47 % ------ Combination Options
% 0.16/0.47
% 0.16/0.47 % --comb_res_mult 1000
% 0.16/0.47 % --comb_inst_mult 300
% 0.16/0.47 % ------
% 0.16/0.47
% 0.16/0.47
% 0.16/0.47
% 0.16/0.47 % ------ Proving...
% 0.16/0.47 %
% 0.16/0.47
% 0.16/0.47
% 0.16/0.47 % Resolution empty clause
% 0.16/0.47
% 0.16/0.47 % ------ Statistics
% 0.16/0.47
% 0.16/0.47 % ------ General
% 0.16/0.47
% 0.16/0.47 % num_of_input_clauses: 36
% 0.16/0.47 % num_of_input_neg_conjectures: 1
% 0.16/0.47 % num_of_splits: 0
% 0.16/0.47 % num_of_split_atoms: 0
% 0.16/0.47 % num_of_sem_filtered_clauses: 0
% 0.16/0.47 % num_of_subtypes: 0
% 0.16/0.47 % monotx_restored_types: 0
% 0.16/0.47 % sat_num_of_epr_types: 0
% 0.16/0.47 % sat_num_of_non_cyclic_types: 0
% 0.16/0.47 % sat_guarded_non_collapsed_types: 0
% 0.16/0.47 % is_epr: 0
% 0.16/0.47 % is_horn: 0
% 0.16/0.47 % has_eq: 0
% 0.16/0.47 % num_pure_diseq_elim: 0
% 0.16/0.47 % simp_replaced_by: 0
% 0.16/0.47 % res_preprocessed: 2
% 0.16/0.47 % prep_upred: 0
% 0.16/0.47 % prep_unflattend: 0
% 0.16/0.47 % pred_elim_cands: 0
% 0.16/0.47 % pred_elim: 0
% 0.16/0.47 % pred_elim_cl: 0
% 0.16/0.47 % pred_elim_cycles: 0
% 0.16/0.47 % forced_gc_time: 0
% 0.16/0.47 % gc_basic_clause_elim: 0
% 0.16/0.47 % parsing_time: 0.
% 0.16/0.47 % sem_filter_time: 0.
% 0.16/0.47 % pred_elim_time: 0.
% 0.16/0.47 % out_proof_time: 0.
% 0.16/0.47 % monotx_time: 0.
% 0.16/0.47 % subtype_inf_time: 0.
% 0.16/0.47 % unif_index_cands_time: 0.
% 0.16/0.47 % unif_index_add_time: 0.
% 0.16/0.47 % total_time: 0.015
% 0.16/0.47 % num_of_symbols: 37
% 0.16/0.47 % num_of_terms: 95
% 0.16/0.47
% 0.16/0.47 % ------ Propositional Solver
% 0.16/0.47
% 0.16/0.47 % prop_solver_calls: 1
% 0.16/0.47 % prop_fast_solver_calls: 3
% 0.16/0.47 % prop_num_of_clauses: 32
% 0.16/0.47 % prop_preprocess_simplified: 118
% 0.16/0.47 % prop_fo_subsumed: 0
% 0.16/0.47 % prop_solver_time: 0.
% 0.16/0.47 % prop_fast_solver_time: 0.
% 0.16/0.47 % prop_unsat_core_time: 0.
% 0.16/0.47
% 0.16/0.47 % ------ QBF
% 0.16/0.47
% 0.16/0.47 % qbf_q_res: 0
% 0.16/0.47 % qbf_num_tautologies: 0
% 0.16/0.47 % qbf_prep_cycles: 0
% 0.16/0.47
% 0.16/0.47 % ------ BMC1
% 0.16/0.47
% 0.16/0.47 % bmc1_current_bound: -1
% 0.16/0.47 % bmc1_last_solved_bound: -1
% 0.16/0.47 % bmc1_unsat_core_size: -1
% 0.16/0.47 % bmc1_unsat_core_parents_size: -1
% 0.16/0.47 % bmc1_merge_next_fun: 0
% 0.16/0.47 % bmc1_unsat_core_clauses_time: 0.
% 0.16/0.47
% 0.16/0.47 % ------ Instantiation
% 0.16/0.47
% 0.16/0.47 % inst_num_of_clauses: 36
% 0.16/0.47 % inst_num_in_passive: 0
% 0.16/0.47 % inst_num_in_active: 0
% 0.16/0.47 % inst_num_in_unprocessed: 36
% 0.16/0.47 % inst_num_of_loops: 0
% 0.16/0.47 % inst_num_of_learning_restarts: 0
% 0.16/0.47 % inst_num_moves_active_passive: 0
% 0.16/0.47 % inst_lit_activity: 0
% 0.16/0.47 % inst_lit_activity_moves: 0
% 0.16/0.47 % inst_num_tautologies: 0
% 0.16/0.47 % inst_num_prop_implied: 0
% 0.16/0.47 % inst_num_existing_simplified: 0
% 0.16/0.47 % inst_num_eq_res_simplified: 0
% 0.16/0.47 % inst_num_child_elim: 0
% 0.16/0.47 % inst_num_of_dismatching_blockings: 0
% 0.16/0.47 % inst_num_of_non_proper_insts: 0
% 0.16/0.47 % inst_num_of_duplicates: 0
% 0.16/0.47 % inst_inst_num_from_inst_to_res: 0
% 0.16/0.47 % inst_dismatching_checking_time: 0.
% 0.16/0.47
% 0.16/0.47 % ------ Resolution
% 0.16/0.47
% 0.16/0.47 % res_num_of_clauses: 51
% 0.16/0.47 % res_num_in_passive: 3
% 0.16/0.47 % res_num_in_active: 26
% 0.16/0.47 % res_num_of_loops: 11
% 0.16/0.47 % res_forward_subset_subsumed: 23
% 0.16/0.47 % res_backward_subset_subsumed: 0
% 0.16/0.47 % res_forward_subsumed: 1
% 0.16/0.47 % res_backward_subsumed: 0
% 0.16/0.47 % res_forward_subsumption_resolution: 2
% 0.16/0.47 % res_backward_subsumption_resolution: 0
% 0.16/0.47 % res_clause_to_clause_subsumption: 4
% 0.16/0.47 % res_orphan_elimination: 0
% 0.16/0.47 % res_tautology_del: 0
% 0.16/0.47 % res_num_eq_res_simplified: 0
% 0.16/0.47 % res_num_sel_changes: 0
% 0.16/0.47 % res_moves_from_active_to_pass: 0
% 0.16/0.47
% 0.16/0.47 % Status Unsatisfiable
% 0.16/0.47 % SZS status Unsatisfiable
% 0.16/0.47 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------