TSTP Solution File: KRS012-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.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:45 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 129 ( 25 unt; 0 def)
% Number of atoms : 326 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 345 ( 148 ~; 197 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 133 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( c(X1)
| r(X1,u0r1(X1))
| r(X1,u0r2(X1)) ),
file('<stdin>',clause_10) ).
fof(c_0_1,axiom,
! [X1] :
( c(X1)
| r(X1,u0r2(X1))
| ~ d(u0r1(X1)) ),
file('<stdin>',clause_7) ).
fof(c_0_2,axiom,
! [X1] :
( c(X1)
| r(X1,u0r1(X1))
| ~ e(u0r2(X1)) ),
file('<stdin>',clause_8) ).
fof(c_0_3,axiom,
! [X3,X1] :
( e(X3)
| ~ c(X1)
| ~ r(X1,X3)
| ~ d(X3) ),
file('<stdin>',clause_3) ).
fof(c_0_4,axiom,
! [X1] :
( c(X1)
| ~ d(u0r1(X1))
| ~ e(u0r2(X1)) ),
file('<stdin>',clause_5) ).
fof(c_0_5,axiom,
! [X1] :
( c(X1)
| r(X1,u0r1(X1))
| d(u0r2(X1)) ),
file('<stdin>',clause_9) ).
fof(c_0_6,axiom,
! [X2,X1] :
( d(X2)
| ~ c(X1)
| ~ r(X1,X2) ),
file('<stdin>',clause_4) ).
fof(c_0_7,axiom,
! [X2,X1] :
( e(X2)
| ~ f(X1)
| ~ r(X1,X2) ),
file('<stdin>',clause_11) ).
fof(c_0_8,axiom,
! [X1] :
( c(X1)
| d(u0r2(X1))
| ~ d(u0r1(X1)) ),
file('<stdin>',clause_6) ).
fof(c_0_9,axiom,
! [X1] :
( f(X1)
| r(X1,u1r1(X1)) ),
file('<stdin>',clause_13) ).
fof(c_0_10,axiom,
! [X1] :
( f(X1)
| ~ e(u1r1(X1)) ),
file('<stdin>',clause_12) ).
fof(c_0_11,axiom,
! [X1] :
( c(X1)
| r(X1,u0r1(X1))
| r(X1,u0r2(X1)) ),
c_0_0 ).
fof(c_0_12,plain,
! [X1] :
( c(X1)
| r(X1,u0r2(X1))
| ~ d(u0r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_13,plain,
! [X1] :
( c(X1)
| r(X1,u0r1(X1))
| ~ e(u0r2(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_14,plain,
! [X3,X1] :
( e(X3)
| ~ c(X1)
| ~ r(X1,X3)
| ~ d(X3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_15,plain,
! [X1] :
( c(X1)
| ~ d(u0r1(X1))
| ~ e(u0r2(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_16,axiom,
! [X1] :
( c(X1)
| r(X1,u0r1(X1))
| d(u0r2(X1)) ),
c_0_5 ).
fof(c_0_17,plain,
! [X2,X1] :
( d(X2)
| ~ c(X1)
| ~ r(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X2,X1] :
( e(X2)
| ~ f(X1)
| ~ r(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_19,plain,
! [X1] :
( c(X1)
| d(u0r2(X1))
| ~ d(u0r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_20,axiom,
! [X1] :
( f(X1)
| r(X1,u1r1(X1)) ),
c_0_9 ).
fof(c_0_21,plain,
! [X1] :
( f(X1)
| ~ e(u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X2] :
( c(X2)
| r(X2,u0r1(X2))
| r(X2,u0r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X2] :
( c(X2)
| r(X2,u0r2(X2))
| ~ d(u0r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_24,plain,
! [X2] :
( c(X2)
| r(X2,u0r1(X2))
| ~ e(u0r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_25,plain,
! [X4,X5] :
( e(X4)
| ~ c(X5)
| ~ r(X5,X4)
| ~ d(X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_14])])]) ).
fof(c_0_26,plain,
! [X2] :
( c(X2)
| ~ d(u0r1(X2))
| ~ e(u0r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_27,plain,
! [X2] :
( c(X2)
| r(X2,u0r1(X2))
| d(u0r2(X2)) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_28,plain,
! [X3,X4] :
( d(X3)
| ~ c(X4)
| ~ r(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_17])])]) ).
fof(c_0_29,plain,
! [X3,X4] :
( e(X3)
| ~ f(X4)
| ~ r(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_18])])]) ).
fof(c_0_30,plain,
! [X2] :
( c(X2)
| d(u0r2(X2))
| ~ d(u0r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
! [X2] :
( f(X2)
| r(X2,u1r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_32,plain,
! [X2] :
( f(X2)
| ~ e(u1r1(X2)) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( r(X1,u0r2(X1))
| r(X1,u0r1(X1))
| c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( r(X1,u0r2(X1))
| c(X1)
| ~ d(u0r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
( r(X1,u0r1(X1))
| c(X1)
| ~ e(u0r2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
( e(X1)
| ~ d(X1)
| ~ r(X2,X1)
| ~ c(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
( c(X1)
| ~ e(u0r2(X1))
| ~ d(u0r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( d(u0r2(X1))
| r(X1,u0r1(X1))
| c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( d(X2)
| ~ r(X1,X2)
| ~ c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
( e(X2)
| ~ r(X1,X2)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
( d(u0r2(X1))
| c(X1)
| ~ d(u0r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
( r(X1,u1r1(X1))
| f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( f(X1)
| ~ e(u1r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
( r(X1,u0r2(X1))
| r(X1,u0r1(X1))
| c(X1) ),
c_0_33,
[final] ).
cnf(c_0_45,plain,
( r(X1,u0r2(X1))
| c(X1)
| ~ d(u0r1(X1)) ),
c_0_34,
[final] ).
cnf(c_0_46,plain,
( r(X1,u0r1(X1))
| c(X1)
| ~ e(u0r2(X1)) ),
c_0_35,
[final] ).
cnf(c_0_47,plain,
( e(X1)
| ~ d(X1)
| ~ r(X2,X1)
| ~ c(X2) ),
c_0_36,
[final] ).
cnf(c_0_48,plain,
( c(X1)
| ~ e(u0r2(X1))
| ~ d(u0r1(X1)) ),
c_0_37,
[final] ).
cnf(c_0_49,plain,
( d(u0r2(X1))
| r(X1,u0r1(X1))
| c(X1) ),
c_0_38,
[final] ).
cnf(c_0_50,plain,
( d(X2)
| ~ r(X1,X2)
| ~ c(X1) ),
c_0_39,
[final] ).
cnf(c_0_51,plain,
( e(X2)
| ~ r(X1,X2)
| ~ f(X1) ),
c_0_40,
[final] ).
cnf(c_0_52,plain,
( d(u0r2(X1))
| c(X1)
| ~ d(u0r1(X1)) ),
c_0_41,
[final] ).
cnf(c_0_53,plain,
( r(X1,u1r1(X1))
| f(X1) ),
c_0_42,
[final] ).
cnf(c_0_54,plain,
( f(X1)
| ~ e(u1r1(X1)) ),
c_0_43,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_44_0,axiom,
( r(X1,u0r2(X1))
| r(X1,u0r1(X1))
| c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( r(X1,u0r1(X1))
| r(X1,u0r2(X1))
| c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_2,axiom,
( c(X1)
| r(X1,u0r1(X1))
| r(X1,u0r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( r(X1,u0r2(X1))
| c(X1)
| ~ d(u0r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( c(X1)
| r(X1,u0r2(X1))
| ~ d(u0r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_2,axiom,
( ~ d(u0r1(X1))
| c(X1)
| r(X1,u0r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( r(X1,u0r1(X1))
| c(X1)
| ~ e(u0r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( c(X1)
| r(X1,u0r1(X1))
| ~ e(u0r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_2,axiom,
( ~ e(u0r2(X1))
| c(X1)
| r(X1,u0r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_47_0,axiom,
( e(X1)
| ~ d(X1)
| ~ r(X2,X1)
| ~ c(X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_1,axiom,
( ~ d(X1)
| e(X1)
| ~ r(X2,X1)
| ~ c(X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_2,axiom,
( ~ r(X2,X1)
| ~ d(X1)
| e(X1)
| ~ c(X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_3,axiom,
( ~ c(X2)
| ~ r(X2,X1)
| ~ d(X1)
| e(X1) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_48_0,axiom,
( c(X1)
| ~ e(u0r2(X1))
| ~ d(u0r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ e(u0r2(X1))
| c(X1)
| ~ d(u0r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ d(u0r1(X1))
| ~ e(u0r2(X1))
| c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( d(u0r2(X1))
| r(X1,u0r1(X1))
| c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( r(X1,u0r1(X1))
| d(u0r2(X1))
| c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_2,axiom,
( c(X1)
| r(X1,u0r1(X1))
| d(u0r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_50_0,axiom,
( d(X2)
| ~ r(X1,X2)
| ~ c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_1,axiom,
( ~ r(X1,X2)
| d(X2)
| ~ c(X1) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_2,axiom,
( ~ c(X1)
| ~ r(X1,X2)
| d(X2) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
( e(X2)
| ~ r(X1,X2)
| ~ f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_1,axiom,
( ~ r(X1,X2)
| e(X2)
| ~ f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_2,axiom,
( ~ f(X1)
| ~ r(X1,X2)
| e(X2) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_52_0,axiom,
( d(u0r2(X1))
| c(X1)
| ~ d(u0r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( c(X1)
| d(u0r2(X1))
| ~ d(u0r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_2,axiom,
( ~ d(u0r1(X1))
| c(X1)
| d(u0r2(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( r(X1,u1r1(X1))
| f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( f(X1)
| r(X1,u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
( f(X1)
| ~ e(u1r1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_1,axiom,
( ~ e(u1r1(X1))
| f(X1) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
~ f(exists),
file('<stdin>',clause_2) ).
fof(c_0_1_002,negated_conjecture,
c(exists),
file('<stdin>',clause_1) ).
fof(c_0_2_003,negated_conjecture,
~ f(exists),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_004,negated_conjecture,
c(exists),
c_0_1 ).
fof(c_0_4_005,negated_conjecture,
~ f(exists),
c_0_2 ).
fof(c_0_5_006,negated_conjecture,
c(exists),
c_0_3 ).
cnf(c_0_6_007,negated_conjecture,
~ f(exists),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,negated_conjecture,
c(exists),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
~ f(exists),
c_0_6,
[final] ).
cnf(c_0_9_010,negated_conjecture,
c(exists),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_32,negated_conjecture,
~ f(exists),
file('/export/starexec/sandbox/tmp/iprover_modulo_6c6a91.p',c_0_8) ).
cnf(c_38,negated_conjecture,
~ f(exists),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_46,negated_conjecture,
~ f(exists),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_49,negated_conjecture,
~ f(exists),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_50,negated_conjecture,
~ f(exists),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_150,negated_conjecture,
~ f(exists),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_30,plain,
( ~ e(u1r1(X0))
| f(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6c6a91.p',c_0_54_0) ).
cnf(c_146,plain,
( ~ e(u1r1(X0))
| f(X0) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_158,plain,
~ e(u1r1(exists)),
inference(resolution,[status(thm)],[c_150,c_146]) ).
cnf(c_159,plain,
~ e(u1r1(exists)),
inference(rewriting,[status(thm)],[c_158]) ).
cnf(c_9,plain,
( ~ c(X0)
| ~ r(X0,X1)
| ~ d(X1)
| e(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6c6a91.p',c_0_47_0) ).
cnf(c_104,plain,
( ~ c(X0)
| ~ r(X0,X1)
| ~ d(X1)
| e(X1) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_105,plain,
( ~ r(X0,X1)
| ~ c(X0)
| ~ d(X1)
| e(X1) ),
inference(rewriting,[status(thm)],[c_104]) ).
cnf(c_163,plain,
( ~ r(X0,u1r1(exists))
| ~ c(X0)
| ~ d(u1r1(exists)) ),
inference(resolution,[status(thm)],[c_159,c_105]) ).
cnf(c_164,plain,
( ~ r(X0,u1r1(exists))
| ~ c(X0)
| ~ d(u1r1(exists)) ),
inference(rewriting,[status(thm)],[c_163]) ).
cnf(c_19,plain,
( ~ c(X0)
| ~ r(X0,X1)
| d(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6c6a91.p',c_0_50_0) ).
cnf(c_124,plain,
( ~ c(X0)
| ~ r(X0,X1)
| d(X1) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_125,plain,
( ~ r(X0,X1)
| ~ c(X0)
| d(X1) ),
inference(rewriting,[status(thm)],[c_124]) ).
cnf(c_175,plain,
( ~ r(X0,u1r1(exists))
| ~ c(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_164,c_125]) ).
cnf(c_176,plain,
( ~ r(X0,u1r1(exists))
| ~ c(X0) ),
inference(rewriting,[status(thm)],[c_175]) ).
cnf(c_28,plain,
( f(X0)
| r(X0,u1r1(X0)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6c6a91.p',c_0_53_0) ).
cnf(c_142,plain,
( f(X0)
| r(X0,u1r1(X0)) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_143,plain,
( r(X0,u1r1(X0))
| f(X0) ),
inference(rewriting,[status(thm)],[c_142]) ).
cnf(c_179,plain,
( ~ c(exists)
| f(exists) ),
inference(resolution,[status(thm)],[c_176,c_143]) ).
cnf(c_180,plain,
( ~ c(exists)
| f(exists) ),
inference(rewriting,[status(thm)],[c_179]) ).
cnf(c_33,negated_conjecture,
c(exists),
file('/export/starexec/sandbox/tmp/iprover_modulo_6c6a91.p',c_0_9) ).
cnf(c_40,negated_conjecture,
c(exists),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_47,negated_conjecture,
c(exists),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_48,negated_conjecture,
c(exists),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_51,negated_conjecture,
c(exists),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_152,negated_conjecture,
c(exists),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_183,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_180,c_150,c_152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 08:26:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.39 % Orientation found
% 0.20/0.39 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4958b2.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6c6a91.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_a36cf0 | grep -v "SZS"
% 0.20/0.41
% 0.20/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ iProver source info
% 0.20/0.41
% 0.20/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.41 % git: non_committed_changes: true
% 0.20/0.41 % git: last_make_outside_of_git: true
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ Input Options
% 0.20/0.41
% 0.20/0.41 % --out_options all
% 0.20/0.41 % --tptp_safe_out true
% 0.20/0.41 % --problem_path ""
% 0.20/0.41 % --include_path ""
% 0.20/0.41 % --clausifier .//eprover
% 0.20/0.41 % --clausifier_options --tstp-format
% 0.20/0.41 % --stdin false
% 0.20/0.41 % --dbg_backtrace false
% 0.20/0.41 % --dbg_dump_prop_clauses false
% 0.20/0.41 % --dbg_dump_prop_clauses_file -
% 0.20/0.41 % --dbg_out_stat false
% 0.20/0.41
% 0.20/0.41 % ------ General Options
% 0.20/0.41
% 0.20/0.41 % --fof false
% 0.20/0.41 % --time_out_real 150.
% 0.20/0.41 % --time_out_prep_mult 0.2
% 0.20/0.41 % --time_out_virtual -1.
% 0.20/0.41 % --schedule none
% 0.20/0.41 % --ground_splitting input
% 0.20/0.41 % --splitting_nvd 16
% 0.20/0.41 % --non_eq_to_eq false
% 0.20/0.41 % --prep_gs_sim true
% 0.20/0.41 % --prep_unflatten false
% 0.20/0.41 % --prep_res_sim true
% 0.20/0.41 % --prep_upred true
% 0.20/0.41 % --res_sim_input true
% 0.20/0.41 % --clause_weak_htbl true
% 0.20/0.41 % --gc_record_bc_elim false
% 0.20/0.41 % --symbol_type_check false
% 0.20/0.41 % --clausify_out false
% 0.20/0.41 % --large_theory_mode false
% 0.20/0.41 % --prep_sem_filter none
% 0.20/0.41 % --prep_sem_filter_out false
% 0.20/0.41 % --preprocessed_out false
% 0.20/0.41 % --sub_typing false
% 0.20/0.41 % --brand_transform false
% 0.20/0.41 % --pure_diseq_elim true
% 0.20/0.41 % --min_unsat_core false
% 0.20/0.41 % --pred_elim true
% 0.20/0.41 % --add_important_lit false
% 0.20/0.41 % --soft_assumptions false
% 0.20/0.41 % --reset_solvers false
% 0.20/0.41 % --bc_imp_inh []
% 0.20/0.41 % --conj_cone_tolerance 1.5
% 0.20/0.41 % --prolific_symb_bound 500
% 0.20/0.41 % --lt_threshold 2000
% 0.20/0.41
% 0.20/0.41 % ------ SAT Options
% 0.20/0.41
% 0.20/0.41 % --sat_mode false
% 0.20/0.41 % --sat_fm_restart_options ""
% 0.20/0.41 % --sat_gr_def false
% 0.20/0.41 % --sat_epr_types true
% 0.20/0.41 % --sat_non_cyclic_types false
% 0.20/0.41 % --sat_finite_models false
% 0.20/0.41 % --sat_fm_lemmas false
% 0.20/0.41 % --sat_fm_prep false
% 0.20/0.41 % --sat_fm_uc_incr true
% 0.20/0.41 % --sat_out_model small
% 0.20/0.41 % --sat_out_clauses false
% 0.20/0.41
% 0.20/0.41 % ------ QBF Options
% 0.20/0.41
% 0.20/0.41 % --qbf_mode false
% 0.20/0.41 % --qbf_elim_univ true
% 0.20/0.41 % --qbf_sk_in true
% 0.20/0.41 % --qbf_pred_elim true
% 0.20/0.41 % --qbf_split 32
% 0.20/0.41
% 0.20/0.41 % ------ BMC1 Options
% 0.20/0.41
% 0.20/0.41 % --bmc1_incremental false
% 0.20/0.41 % --bmc1_axioms reachable_all
% 0.20/0.41 % --bmc1_min_bound 0
% 0.20/0.41 % --bmc1_max_bound -1
% 0.20/0.41 % --bmc1_max_bound_default -1
% 0.20/0.41 % --bmc1_symbol_reachability true
% 0.20/0.41 % --bmc1_property_lemmas false
% 0.20/0.41 % --bmc1_k_induction false
% 0.20/0.41 % --bmc1_non_equiv_states false
% 0.20/0.41 % --bmc1_deadlock false
% 0.20/0.41 % --bmc1_ucm false
% 0.20/0.41 % --bmc1_add_unsat_core none
% 0.20/0.41 % --bmc1_unsat_core_children false
% 0.20/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.41 % --bmc1_out_stat full
% 0.20/0.41 % --bmc1_ground_init false
% 0.20/0.41 % --bmc1_pre_inst_next_state false
% 0.20/0.41 % --bmc1_pre_inst_state false
% 0.20/0.41 % --bmc1_pre_inst_reach_state false
% 0.20/0.41 % --bmc1_out_unsat_core false
% 0.20/0.41 % --bmc1_aig_witness_out false
% 0.20/0.41 % --bmc1_verbose false
% 0.20/0.41 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4958b2.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/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.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn false
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 0.20/0.42
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4958b2.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 %
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % Resolution empty clause
% 0.20/0.42
% 0.20/0.42 % ------ Statistics
% 0.20/0.42
% 0.20/0.42 % ------ General
% 0.20/0.42
% 0.20/0.42 % num_of_input_clauses: 34
% 0.20/0.42 % num_of_input_neg_conjectures: 2
% 0.20/0.42 % num_of_splits: 0
% 0.20/0.42 % num_of_split_atoms: 0
% 0.20/0.42 % num_of_sem_filtered_clauses: 0
% 0.20/0.42 % num_of_subtypes: 0
% 0.20/0.42 % monotx_restored_types: 0
% 0.20/0.42 % sat_num_of_epr_types: 0
% 0.20/0.42 % sat_num_of_non_cyclic_types: 0
% 0.20/0.42 % sat_guarded_non_collapsed_types: 0
% 0.20/0.42 % is_epr: 0
% 0.20/0.42 % is_horn: 0
% 0.20/0.42 % has_eq: 0
% 0.20/0.42 % num_pure_diseq_elim: 0
% 0.20/0.42 % simp_replaced_by: 0
% 0.20/0.42 % res_preprocessed: 4
% 0.20/0.42 % prep_upred: 0
% 0.20/0.42 % prep_unflattend: 0
% 0.20/0.42 % pred_elim_cands: 0
% 0.20/0.42 % pred_elim: 0
% 0.20/0.42 % pred_elim_cl: 0
% 0.20/0.42 % pred_elim_cycles: 0
% 0.20/0.42 % forced_gc_time: 0
% 0.20/0.42 % gc_basic_clause_elim: 0
% 0.20/0.42 % parsing_time: 0.001
% 0.20/0.42 % sem_filter_time: 0.
% 0.20/0.42 % pred_elim_time: 0.
% 0.20/0.42 % out_proof_time: 0.001
% 0.20/0.42 % monotx_time: 0.
% 0.20/0.42 % subtype_inf_time: 0.
% 0.20/0.42 % unif_index_cands_time: 0.
% 0.20/0.42 % unif_index_add_time: 0.
% 0.20/0.42 % total_time: 0.023
% 0.20/0.42 % num_of_symbols: 34
% 0.20/0.42 % num_of_terms: 69
% 0.20/0.42
% 0.20/0.42 % ------ Propositional Solver
% 0.20/0.42
% 0.20/0.42 % prop_solver_calls: 1
% 0.20/0.42 % prop_fast_solver_calls: 6
% 0.20/0.42 % prop_num_of_clauses: 20
% 0.20/0.42 % prop_preprocess_simplified: 128
% 0.20/0.42 % prop_fo_subsumed: 0
% 0.20/0.42 % prop_solver_time: 0.
% 0.20/0.42 % prop_fast_solver_time: 0.
% 0.20/0.42 % prop_unsat_core_time: 0.
% 0.20/0.42
% 0.20/0.42 % ------ QBF
% 0.20/0.42
% 0.20/0.42 % qbf_q_res: 0
% 0.20/0.42 % qbf_num_tautologies: 0
% 0.20/0.42 % qbf_prep_cycles: 0
% 0.20/0.42
% 0.20/0.42 % ------ BMC1
% 0.20/0.42
% 0.20/0.42 % bmc1_current_bound: -1
% 0.20/0.42 % bmc1_last_solved_bound: -1
% 0.20/0.42 % bmc1_unsat_core_size: -1
% 0.20/0.42 % bmc1_unsat_core_parents_size: -1
% 0.20/0.42 % bmc1_merge_next_fun: 0
% 0.20/0.42 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation
% 0.20/0.42
% 0.20/0.42 % inst_num_of_clauses: 34
% 0.20/0.42 % inst_num_in_passive: 0
% 0.20/0.42 % inst_num_in_active: 0
% 0.20/0.42 % inst_num_in_unprocessed: 34
% 0.20/0.42 % inst_num_of_loops: 0
% 0.20/0.42 % inst_num_of_learning_restarts: 0
% 0.20/0.42 % inst_num_moves_active_passive: 0
% 0.20/0.42 % inst_lit_activity: 0
% 0.20/0.42 % inst_lit_activity_moves: 0
% 0.20/0.42 % inst_num_tautologies: 0
% 0.20/0.42 % inst_num_prop_implied: 0
% 0.20/0.42 % inst_num_existing_simplified: 0
% 0.20/0.42 % inst_num_eq_res_simplified: 0
% 0.20/0.42 % inst_num_child_elim: 0
% 0.20/0.42 % inst_num_of_dismatching_blockings: 0
% 0.20/0.42 % inst_num_of_non_proper_insts: 0
% 0.20/0.42 % inst_num_of_duplicates: 0
% 0.20/0.42 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.42 % inst_dismatching_checking_time: 0.
% 0.20/0.42
% 0.20/0.42 % ------ Resolution
% 0.20/0.42
% 0.20/0.42 % res_num_of_clauses: 44
% 0.20/0.42 % res_num_in_passive: 0
% 0.20/0.42 % res_num_in_active: 16
% 0.20/0.42 % res_num_of_loops: 6
% 0.20/0.42 % res_forward_subset_subsumed: 21
% 0.20/0.42 % res_backward_subset_subsumed: 0
% 0.20/0.42 % res_forward_subsumed: 0
% 0.20/0.42 % res_backward_subsumed: 0
% 0.20/0.42 % res_forward_subsumption_resolution: 3
% 0.20/0.42 % res_backward_subsumption_resolution: 0
% 0.20/0.42 % res_clause_to_clause_subsumption: 3
% 0.20/0.42 % res_orphan_elimination: 0
% 0.20/0.42 % res_tautology_del: 1
% 0.20/0.42 % res_num_eq_res_simplified: 0
% 0.20/0.42 % res_num_sel_changes: 0
% 0.20/0.42 % res_moves_from_active_to_pass: 0
% 0.20/0.42
% 0.20/0.42 % Status Unsatisfiable
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------