TSTP Solution File: LCL201-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LCL201-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n007.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 11:31:17 EDT 2022
% Result : Unsatisfiable 222.72s 222.93s
% Output : CNFRefutation 222.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 17
% Syntax : Number of formulae : 106 ( 57 unt; 0 def)
% Number of atoms : 192 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 178 ( 92 ~; 86 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 186 ( 8 sgn 51 !; 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,
! [X3,X2,X1] : axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('<stdin>',axiom_1_6) ).
fof(c_0_1,axiom,
! [X3,X2,X1] : axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('<stdin>',axiom_1_5) ).
fof(c_0_2,axiom,
! [X2,X1] : axiom(or(not(or(X1,X2)),or(X2,X1))),
file('<stdin>',axiom_1_4) ).
fof(c_0_3,axiom,
! [X6,X5,X4] :
( theorem(or(not(X4),X6))
| ~ axiom(or(not(X4),X5))
| ~ theorem(or(not(X5),X6)) ),
file('<stdin>',rule_3) ).
fof(c_0_4,axiom,
! [X1] : axiom(or(not(or(X1,X1)),X1)),
file('<stdin>',axiom_1_2) ).
fof(c_0_5,axiom,
! [X2,X1] : axiom(or(not(X1),or(X2,X1))),
file('<stdin>',axiom_1_3) ).
fof(c_0_6,axiom,
! [X5,X4] :
( theorem(X4)
| ~ axiom(or(not(X5),X4))
| ~ theorem(X5) ),
file('<stdin>',rule_2) ).
fof(c_0_7,axiom,
! [X4] :
( theorem(X4)
| ~ axiom(X4) ),
file('<stdin>',rule_1) ).
fof(c_0_8,axiom,
! [X3,X2,X1] : axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
c_0_0 ).
fof(c_0_9,axiom,
! [X3,X2,X1] : axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
c_0_1 ).
fof(c_0_10,axiom,
! [X2,X1] : axiom(or(not(or(X1,X2)),or(X2,X1))),
c_0_2 ).
fof(c_0_11,plain,
! [X6,X5,X4] :
( theorem(or(not(X4),X6))
| ~ axiom(or(not(X4),X5))
| ~ theorem(or(not(X5),X6)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_12,axiom,
! [X1] : axiom(or(not(or(X1,X1)),X1)),
c_0_4 ).
fof(c_0_13,axiom,
! [X2,X1] : axiom(or(not(X1),or(X2,X1))),
c_0_5 ).
fof(c_0_14,plain,
! [X5,X4] :
( theorem(X4)
| ~ axiom(or(not(X5),X4))
| ~ theorem(X5) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X4] :
( theorem(X4)
| ~ axiom(X4) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
! [X4,X5,X6] : axiom(or(not(or(not(X6),X5)),or(not(or(X4,X6)),or(X4,X5)))),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X4,X5,X6] : axiom(or(not(or(X6,or(X5,X4))),or(X5,or(X6,X4)))),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X3,X4] : axiom(or(not(or(X4,X3)),or(X3,X4))),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_19,plain,
! [X7,X8,X9] :
( theorem(or(not(X9),X7))
| ~ axiom(or(not(X9),X8))
| ~ theorem(or(not(X8),X7)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X2] : axiom(or(not(or(X2,X2)),X2)),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X3,X4] : axiom(or(not(X4),or(X3,X4))),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X6,X7] :
( theorem(X7)
| ~ axiom(or(not(X6),X7))
| ~ theorem(X6) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X5] :
( theorem(X5)
| ~ axiom(X5) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( theorem(or(not(X3),X2))
| ~ theorem(or(not(X1),X2))
| ~ axiom(or(not(X3),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
axiom(or(not(X1),or(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( theorem(X2)
| ~ theorem(X1)
| ~ axiom(or(not(X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
c_0_24,
[final] ).
cnf(c_0_33,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
c_0_25,
[final] ).
cnf(c_0_34,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
c_0_26,
[final] ).
cnf(c_0_35,plain,
( theorem(or(not(X3),X2))
| ~ theorem(or(not(X1),X2))
| ~ axiom(or(not(X3),X1)) ),
c_0_27,
[final] ).
cnf(c_0_36,plain,
axiom(or(not(or(X1,X1)),X1)),
c_0_28,
[final] ).
cnf(c_0_37,plain,
axiom(or(not(X1),or(X2,X1))),
c_0_29,
[final] ).
cnf(c_0_38,plain,
( theorem(X2)
| ~ theorem(X1)
| ~ axiom(or(not(X1),X2)) ),
c_0_30,
[final] ).
cnf(c_0_39,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_31,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_35_0,axiom,
( theorem(or(not(X3),X2))
| ~ theorem(or(not(X1),X2))
| ~ axiom(or(not(X3),X1)) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_1,axiom,
( ~ theorem(or(not(X1),X2))
| theorem(or(not(X3),X2))
| ~ axiom(or(not(X3),X1)) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_2,axiom,
( ~ axiom(or(not(X3),X1))
| ~ theorem(or(not(X1),X2))
| theorem(or(not(X3),X2)) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_38_0,axiom,
( theorem(X2)
| ~ theorem(X1)
| ~ axiom(or(not(X1),X2)) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_1,axiom,
( ~ theorem(X1)
| theorem(X2)
| ~ axiom(or(not(X1),X2)) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_2,axiom,
( ~ axiom(or(not(X1),X2))
| ~ theorem(X1)
| theorem(X2) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_39_0,axiom,
( theorem(X1)
| ~ axiom(X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_32_0,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_36_0,axiom,
axiom(or(not(or(X1,X1)),X1)),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_37_0,axiom,
axiom(or(not(X1),or(X2,X1))),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
file('<stdin>',prove_this) ).
fof(c_0_1_002,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
c_0_1 ).
cnf(c_0_3_004,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_10,plain,
( theorem(or(not(X0),X1))
| ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_52c743.p',c_0_35_2) ).
cnf(c_436193,plain,
( theorem(or(not(X0),X1))
| ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2)) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_436210,plain,
( ~ axiom(or(not(not(or(p,q))),X0))
| theorem(or(not(not(or(p,q))),or(not(p),q)))
| ~ theorem(or(not(X0),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_436193]) ).
cnf(c_436216,plain,
( ~ axiom(or(not(not(or(p,q))),or(X0,not(or(p,q)))))
| theorem(or(not(not(or(p,q))),or(not(p),q)))
| ~ theorem(or(not(or(X0,not(or(p,q)))),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_436210]) ).
cnf(c_555414,plain,
( ~ axiom(or(not(not(or(p,q))),or(q,not(or(p,q)))))
| theorem(or(not(not(or(p,q))),or(not(p),q)))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_436216]) ).
cnf(c_3,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_52c743.p',c_0_33_0) ).
cnf(c_436186,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_436618,plain,
axiom(or(not(or(X0,or(not(X1),X2))),or(not(X1),or(X0,X2)))),
inference(instantiation,[status(thm)],[c_436186]) ).
cnf(c_503235,plain,
axiom(or(not(or(not(p),or(not(or(q,not(or(p,q)))),q))),or(not(or(q,not(or(p,q)))),or(not(p),q)))),
inference(instantiation,[status(thm)],[c_436618]) ).
cnf(c_0,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_52c743.p',c_0_37_0) ).
cnf(c_436183,plain,
axiom(or(not(X0),or(X1,X0))),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_436423,plain,
axiom(or(not(p),or(X0,p))),
inference(instantiation,[status(thm)],[c_436183]) ).
cnf(c_466471,plain,
axiom(or(not(p),or(q,p))),
inference(instantiation,[status(thm)],[c_436423]) ).
cnf(c_9,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_52c743.p',c_0_38_0) ).
cnf(c_36,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_10869,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_36]) ).
cnf(c_10954,plain,
( ~ axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2))))
| ~ theorem(or(not(X0),or(X1,X2)))
| theorem(or(X1,or(not(X0),X2))) ),
inference(instantiation,[status(thm)],[c_10869]) ).
cnf(c_11174,plain,
( ~ axiom(or(not(or(not(p),or(not(or(X0,not(or(p,q)))),q))),or(not(or(X0,not(or(p,q)))),or(not(p),q))))
| theorem(or(not(or(X0,not(or(p,q)))),or(not(p),q)))
| ~ theorem(or(not(p),or(not(or(X0,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_10954]) ).
cnf(c_127040,plain,
( ~ axiom(or(not(or(not(p),or(not(or(q,not(or(p,q)))),q))),or(not(or(q,not(or(p,q)))),or(not(p),q))))
| theorem(or(not(or(q,not(or(p,q)))),or(not(p),q)))
| ~ theorem(or(not(p),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_11174]) ).
cnf(c_11,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(X0),X2))
| ~ theorem(or(not(X1),X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_52c743.p',c_0_35_1) ).
cnf(c_38,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(X0),X2))
| ~ theorem(or(not(X1),X2)) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_10862,plain,
( ~ axiom(or(not(X0),or(X1,X0)))
| ~ theorem(or(not(or(X1,X0)),X2))
| theorem(or(not(X0),X2)) ),
inference(instantiation,[status(thm)],[c_38]) ).
cnf(c_12576,plain,
( ~ axiom(or(not(X0),or(X1,X0)))
| ~ theorem(or(not(or(X1,X0)),or(not(or(X2,not(or(p,q)))),q)))
| theorem(or(not(X0),or(not(or(X2,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_10862]) ).
cnf(c_123940,plain,
( ~ axiom(or(not(p),or(q,p)))
| ~ theorem(or(not(or(q,p)),or(not(or(q,not(or(p,q)))),q)))
| theorem(or(not(p),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_12576]) ).
cnf(c_10865,plain,
( ~ axiom(or(not(or(X0,X1)),or(X1,X0)))
| theorem(or(not(or(X0,X1)),X2))
| ~ theorem(or(not(or(X1,X0)),X2)) ),
inference(instantiation,[status(thm)],[c_38]) ).
cnf(c_11821,plain,
( ~ axiom(or(not(or(X0,p)),or(p,X0)))
| ~ theorem(or(not(or(p,X0)),or(not(or(X1,not(or(p,q)))),q)))
| theorem(or(not(or(X0,p)),or(not(or(X1,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_10865]) ).
cnf(c_102620,plain,
( ~ axiom(or(not(or(q,p)),or(p,q)))
| ~ theorem(or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))
| theorem(or(not(or(q,p)),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_11821]) ).
cnf(c_2,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_52c743.p',c_0_34_0) ).
cnf(c_29,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_84842,plain,
axiom(or(not(or(q,p)),or(p,q))),
inference(instantiation,[status(thm)],[c_29]) ).
cnf(c_27,plain,
axiom(or(not(X0),or(X1,X0))),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_10961,plain,
axiom(or(not(not(or(p,q))),or(X0,not(or(p,q))))),
inference(instantiation,[status(thm)],[c_27]) ).
cnf(c_83603,plain,
axiom(or(not(not(or(p,q))),or(q,not(or(p,q))))),
inference(instantiation,[status(thm)],[c_10961]) ).
cnf(c_30,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_11297,plain,
axiom(or(not(or(X0,or(not(X1),X2))),or(not(X1),or(X0,X2)))),
inference(instantiation,[status(thm)],[c_30]) ).
cnf(c_70140,plain,
axiom(or(not(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))),
inference(instantiation,[status(thm)],[c_11297]) ).
cnf(c_11264,plain,
axiom(or(not(or(X0,not(X1))),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_29]) ).
cnf(c_25297,plain,
axiom(or(not(or(X0,not(or(p,q)))),or(not(or(p,q)),X0))),
inference(instantiation,[status(thm)],[c_11264]) ).
cnf(c_41347,plain,
axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),
inference(instantiation,[status(thm)],[c_25297]) ).
cnf(c_12595,plain,
( ~ axiom(or(not(or(not(or(X0,not(or(p,q)))),or(not(X1),q))),or(not(X1),or(not(or(X0,not(or(p,q)))),q))))
| ~ theorem(or(not(or(X0,not(or(p,q)))),or(not(X1),q)))
| theorem(or(not(X1),or(not(or(X0,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_10954]) ).
cnf(c_38072,plain,
( ~ axiom(or(not(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q))))
| theorem(or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))) ),
inference(instantiation,[status(thm)],[c_12595]) ).
cnf(c_6,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_52c743.p',c_0_39_0) ).
cnf(c_33,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_10853,plain,
( ~ axiom(or(not(or(X0,X1)),or(X1,X0)))
| theorem(or(not(or(X0,X1)),or(X1,X0))) ),
inference(instantiation,[status(thm)],[c_33]) ).
cnf(c_12956,plain,
( ~ axiom(or(not(or(q,not(X0))),or(not(X0),q)))
| theorem(or(not(or(q,not(X0))),or(not(X0),q))) ),
inference(instantiation,[status(thm)],[c_10853]) ).
cnf(c_38071,plain,
( ~ axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))) ),
inference(instantiation,[status(thm)],[c_12956]) ).
cnf(c_13,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_52c743.p',c_0_4) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_555414,c_503235,c_466471,c_127040,c_123940,c_102620,c_84842,c_83603,c_70140,c_41347,c_38072,c_38071,c_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL201-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 3 13:35:11 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.19/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.39 % Orientation found
% 0.19/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/sandbox2/tmp/iprover_proof_fc50df.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_52c743.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_6bbab6 | grep -v "SZS"
% 0.19/0.41
% 0.19/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ iProver source info
% 0.19/0.41
% 0.19/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.41 % git: non_committed_changes: true
% 0.19/0.41 % git: last_make_outside_of_git: true
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ Input Options
% 0.19/0.41
% 0.19/0.41 % --out_options all
% 0.19/0.41 % --tptp_safe_out true
% 0.19/0.41 % --problem_path ""
% 0.19/0.41 % --include_path ""
% 0.19/0.41 % --clausifier .//eprover
% 0.19/0.41 % --clausifier_options --tstp-format
% 0.19/0.41 % --stdin false
% 0.19/0.41 % --dbg_backtrace false
% 0.19/0.41 % --dbg_dump_prop_clauses false
% 0.19/0.41 % --dbg_dump_prop_clauses_file -
% 0.19/0.41 % --dbg_out_stat false
% 0.19/0.41
% 0.19/0.41 % ------ General Options
% 0.19/0.41
% 0.19/0.41 % --fof false
% 0.19/0.41 % --time_out_real 150.
% 0.19/0.41 % --time_out_prep_mult 0.2
% 0.19/0.41 % --time_out_virtual -1.
% 0.19/0.41 % --schedule none
% 0.19/0.41 % --ground_splitting input
% 0.19/0.41 % --splitting_nvd 16
% 0.19/0.41 % --non_eq_to_eq false
% 0.19/0.41 % --prep_gs_sim true
% 0.19/0.41 % --prep_unflatten false
% 0.19/0.41 % --prep_res_sim true
% 0.19/0.41 % --prep_upred true
% 0.19/0.41 % --res_sim_input true
% 0.19/0.41 % --clause_weak_htbl true
% 0.19/0.41 % --gc_record_bc_elim false
% 0.19/0.41 % --symbol_type_check false
% 0.19/0.41 % --clausify_out false
% 0.19/0.41 % --large_theory_mode false
% 0.19/0.41 % --prep_sem_filter none
% 0.19/0.41 % --prep_sem_filter_out false
% 0.19/0.41 % --preprocessed_out false
% 0.19/0.41 % --sub_typing false
% 0.19/0.41 % --brand_transform false
% 0.19/0.41 % --pure_diseq_elim true
% 0.19/0.41 % --min_unsat_core false
% 0.19/0.41 % --pred_elim true
% 0.19/0.41 % --add_important_lit false
% 0.19/0.41 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fc50df.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42 % ------ Parsing...% successful
% 0.19/0.42
% 0.19/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 % ------ Problem Properties
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % EPR false
% 0.19/0.42 % Horn true
% 0.19/0.42 % Has equality false
% 0.19/0.42
% 0.19/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % % ------ Current options:
% 0.19/0.42
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 150.15/150.42 % --inst_prop_sim_new false
% 150.15/150.42 % --inst_orphan_elimination true
% 150.15/150.42 % --inst_learning_loop_flag true
% 150.15/150.42 % --inst_learning_start 3000
% 150.15/150.42 % --inst_learning_factor 2
% 150.15/150.42 % --inst_start_prop_sim_after_learn 3
% 150.15/150.42 % --inst_sel_renew solver
% 150.15/150.42 % --inst_lit_activity_flag true
% 150.15/150.42 % --inst_out_proof true
% 150.15/150.42
% 150.15/150.42 % ------ Resolution Options
% 150.15/150.42
% 150.15/150.42 % --resolution_flag true
% 150.15/150.42 % --res_lit_sel kbo_max
% 150.15/150.42 % --res_to_prop_solver none
% 150.15/150.42 % --res_prop_simpl_new false
% 150.15/150.42 % --res_prop_simpl_given false
% 150.15/150.42 % --res_passive_queue_type priority_queues
% 150.15/150.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.15/150.42 % --res_passive_queues_freq [15;5]
% 150.15/150.42 % --res_forward_subs full
% 150.15/150.42 % --res_backward_subs full
% 150.15/150.42 % --res_forward_subs_resolution true
% 150.15/150.42 % --res_backward_subs_resolution true
% 150.15/150.42 % --res_orphan_elimination false
% 150.15/150.42 % --res_time_limit 1000.
% 150.15/150.42 % --res_out_proof true
% 150.15/150.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fc50df.s
% 150.15/150.42 % --modulo true
% 150.15/150.42
% 150.15/150.42 % ------ Combination Options
% 150.15/150.42
% 150.15/150.42 % --comb_res_mult 1000
% 150.15/150.42 % --comb_inst_mult 300
% 150.15/150.42 % ------
% 150.15/150.42
% 150.15/150.42
% 150.15/150.42
% 150.15/150.42 % ------ Proving...
% 150.15/150.42 %
% 150.15/150.42
% 150.15/150.42
% 150.15/150.42 % Time Out Real
% 150.15/150.42
% 150.15/150.42 % ------ Statistics
% 150.15/150.42
% 150.15/150.42 % ------ General
% 150.15/150.42
% 150.15/150.42 % num_of_input_clauses: 14
% 150.15/150.42 % num_of_input_neg_conjectures: 1
% 150.15/150.42 % num_of_splits: 0
% 150.15/150.42 % num_of_split_atoms: 0
% 150.15/150.42 % num_of_sem_filtered_clauses: 0
% 150.15/150.42 % num_of_subtypes: 0
% 150.15/150.42 % monotx_restored_types: 0
% 150.15/150.42 % sat_num_of_epr_types: 0
% 150.15/150.42 % sat_num_of_non_cyclic_types: 0
% 150.15/150.42 % sat_guarded_non_collapsed_types: 0
% 150.15/150.42 % is_epr: 0
% 150.15/150.42 % is_horn: 1
% 150.15/150.42 % has_eq: 0
% 150.15/150.42 % num_pure_diseq_elim: 0
% 150.15/150.42 % simp_replaced_by: 0
% 150.15/150.42 % res_preprocessed: 2
% 150.15/150.42 % prep_upred: 0
% 150.15/150.42 % prep_unflattend: 0
% 150.15/150.42 % pred_elim_cands: 0
% 150.15/150.42 % pred_elim: 0
% 150.15/150.42 % pred_elim_cl: 0
% 150.15/150.42 % pred_elim_cycles: 0
% 150.15/150.42 % forced_gc_time: 0
% 150.15/150.42 % gc_basic_clause_elim: 0
% 150.15/150.42 % parsing_time: 0.
% 150.15/150.42 % sem_filter_time: 0.
% 150.15/150.42 % pred_elim_time: 0.
% 150.15/150.42 % out_proof_time: 0.
% 150.15/150.42 % monotx_time: 0.
% 150.15/150.42 % subtype_inf_time: 0.
% 150.15/150.42 % unif_index_cands_time: 0.279
% 150.15/150.42 % unif_index_add_time: 0.527
% 150.15/150.42 % total_time: 150.014
% 150.15/150.42 % num_of_symbols: 31
% 150.15/150.42 % num_of_terms: 356157
% 150.15/150.42
% 150.15/150.42 % ------ Propositional Solver
% 150.15/150.42
% 150.15/150.42 % prop_solver_calls: 49
% 150.15/150.42 % prop_fast_solver_calls: 3
% 150.15/150.42 % prop_num_of_clauses: 20984
% 150.15/150.42 % prop_preprocess_simplified: 28882
% 150.15/150.42 % prop_fo_subsumed: 0
% 150.15/150.42 % prop_solver_time: 0.023
% 150.15/150.42 % prop_fast_solver_time: 0.
% 150.15/150.42 % prop_unsat_core_time: 0.
% 150.15/150.42
% 150.15/150.42 % ------ QBF
% 150.15/150.42
% 150.15/150.42 % qbf_q_res: 0
% 150.15/150.42 % qbf_num_tautologies: 0
% 150.15/150.42 % qbf_prep_cycles: 0
% 150.15/150.42
% 150.15/150.42 % ------ BMC1
% 150.15/150.42
% 150.15/150.42 % bmc1_current_bound: -1
% 150.15/150.42 % bmc1_last_solved_bound: -1
% 150.15/150.42 % bmc1_unsat_core_size: -1
% 150.15/150.42 % bmc1_unsat_core_parents_size: -1
% 150.15/150.42 % bmc1_merge_next_fun: 0
% 150.15/150.42 % bmc1_unsat_core_clauses_time: 0.
% 150.15/150.42
% 150.15/150.42 % ------ Instantiation
% 150.15/150.42
% 150.15/150.42 % inst_num_of_clauses: 1687
% 150.15/150.42 % inst_num_in_passive: 284
% 150.15/150.42 % inst_num_in_active: 851
% 150.15/150.42 % inst_num_in_unprocessed: 522
% 150.15/150.42 % inst_num_of_loops: 898
% 150.15/150.42 % inst_num_of_learning_restarts: 2
% 150.15/150.42 % inst_num_moves_active_passive: 13
% 150.15/150.42 % inst_lit_activity: 241
% 150.15/150.42 % inst_lit_activity_moves: 0
% 150.15/150.42 % inst_num_tautologies: 30
% 150.15/150.42 % inst_num_prop_implied: 0
% 150.15/150.42 % inst_num_existing_simplified: 0
% 150.15/150.42 % inst_num_eq_res_simplified: 0
% 150.15/150.42 % inst_num_child_elim: 0
% 150.15/150.42 % inst_num_of_dismatching_blockings: 4060
% 150.15/150.42 % inst_num_of_non_proper_insts: 4368
% 150.15/150.42 % inst_num_of_duplicates: 1083
% 150.15/150.42 % inst_inst_num_from_inst_to_res: 0
% 150.15/150.42 % inst_dismatching_checking_time: 0.215
% 150.15/150.42
% 150.15/150.42 % ------ Resolution
% 150.15/150.42
% 150.15/150.42 % res_num_of_clauses: 51399
% 150.15/150.42 % res_num_in_passive: 18438
% 150.15/150.42 % res_num_in_active: 32955
% 150.15/150.42 % res_num_of_loops: 33339
% 150.15/150.42 % res_forward_subset_subsumed: 14426
% 150.15/150.42 % res_backward_subset_subsumed: 0
% 150.15/150.42 % res_forward_subsumed: 393
% 150.15/150.42 % res_backward_subsumed: 0
% 150.15/150.42 % res_forward_subsumption_resolution: 0
% 150.15/150.42 % res_backward_subsumption_resolution: 0
% 150.15/150.42 % res_clause_to_clause_subsumption: 201641
% 150.15/150.42 % res_orphan_elimination: 0
% 150.15/150.42 % res_tautology_del: 0
% 150.15/150.42 % res_num_eq_res_simplified: 0
% 150.15/150.42 % res_num_sel_changes: 0
% 150.15/150.42 % res_moves_from_active_to_pass: 0
% 150.15/150.42
% 150.15/150.42 % Status Unknown
% 150.27/150.46 % Orienting using strategy ClausalAll
% 150.27/150.46 % Orientation found
% 150.27/150.46 % 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_fc50df.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_52c743.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_ee92fd | grep -v "SZS"
% 150.27/150.49
% 150.27/150.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.27/150.49
% 150.27/150.49 %
% 150.27/150.49 % ------ iProver source info
% 150.27/150.49
% 150.27/150.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.27/150.49 % git: non_committed_changes: true
% 150.27/150.49 % git: last_make_outside_of_git: true
% 150.27/150.49
% 150.27/150.49 %
% 150.27/150.49 % ------ Input Options
% 150.27/150.49
% 150.27/150.49 % --out_options all
% 150.27/150.49 % --tptp_safe_out true
% 150.27/150.49 % --problem_path ""
% 150.27/150.49 % --include_path ""
% 150.27/150.49 % --clausifier .//eprover
% 150.27/150.49 % --clausifier_options --tstp-format
% 150.27/150.49 % --stdin false
% 150.27/150.49 % --dbg_backtrace false
% 150.27/150.49 % --dbg_dump_prop_clauses false
% 150.27/150.49 % --dbg_dump_prop_clauses_file -
% 150.27/150.49 % --dbg_out_stat false
% 150.27/150.49
% 150.27/150.49 % ------ General Options
% 150.27/150.49
% 150.27/150.49 % --fof false
% 150.27/150.49 % --time_out_real 150.
% 150.27/150.49 % --time_out_prep_mult 0.2
% 150.27/150.49 % --time_out_virtual -1.
% 150.27/150.49 % --schedule none
% 150.27/150.49 % --ground_splitting input
% 150.27/150.49 % --splitting_nvd 16
% 150.27/150.49 % --non_eq_to_eq false
% 150.27/150.49 % --prep_gs_sim true
% 150.27/150.49 % --prep_unflatten false
% 150.27/150.49 % --prep_res_sim true
% 150.27/150.49 % --prep_upred true
% 150.27/150.49 % --res_sim_input true
% 150.27/150.49 % --clause_weak_htbl true
% 150.27/150.49 % --gc_record_bc_elim false
% 150.27/150.49 % --symbol_type_check false
% 150.27/150.49 % --clausify_out false
% 150.27/150.49 % --large_theory_mode false
% 150.27/150.49 % --prep_sem_filter none
% 150.27/150.49 % --prep_sem_filter_out false
% 150.27/150.49 % --preprocessed_out false
% 150.27/150.49 % --sub_typing false
% 150.27/150.49 % --brand_transform false
% 150.27/150.49 % --pure_diseq_elim true
% 150.27/150.49 % --min_unsat_core false
% 150.27/150.49 % --pred_elim true
% 150.27/150.49 % --add_important_lit false
% 150.27/150.49 % --soft_assumptions false
% 150.27/150.49 % --reset_solvers false
% 150.27/150.49 % --bc_imp_inh []
% 150.27/150.49 % --conj_cone_tolerance 1.5
% 150.27/150.49 % --prolific_symb_bound 500
% 150.27/150.49 % --lt_threshold 2000
% 150.27/150.49
% 150.27/150.49 % ------ SAT Options
% 150.27/150.49
% 150.27/150.49 % --sat_mode false
% 150.27/150.49 % --sat_fm_restart_options ""
% 150.27/150.49 % --sat_gr_def false
% 150.27/150.49 % --sat_epr_types true
% 150.27/150.49 % --sat_non_cyclic_types false
% 150.27/150.49 % --sat_finite_models false
% 150.27/150.49 % --sat_fm_lemmas false
% 150.27/150.49 % --sat_fm_prep false
% 150.27/150.49 % --sat_fm_uc_incr true
% 150.27/150.49 % --sat_out_model small
% 150.27/150.49 % --sat_out_clauses false
% 150.27/150.49
% 150.27/150.49 % ------ QBF Options
% 150.27/150.49
% 150.27/150.49 % --qbf_mode false
% 150.27/150.49 % --qbf_elim_univ true
% 150.27/150.49 % --qbf_sk_in true
% 150.27/150.49 % --qbf_pred_elim true
% 150.27/150.49 % --qbf_split 32
% 150.27/150.49
% 150.27/150.49 % ------ BMC1 Options
% 150.27/150.49
% 150.27/150.49 % --bmc1_incremental false
% 150.27/150.49 % --bmc1_axioms reachable_all
% 150.27/150.49 % --bmc1_min_bound 0
% 150.27/150.49 % --bmc1_max_bound -1
% 150.27/150.49 % --bmc1_max_bound_default -1
% 150.27/150.49 % --bmc1_symbol_reachability true
% 150.27/150.49 % --bmc1_property_lemmas false
% 150.27/150.49 % --bmc1_k_induction false
% 150.27/150.49 % --bmc1_non_equiv_states false
% 150.27/150.49 % --bmc1_deadlock false
% 150.27/150.49 % --bmc1_ucm false
% 150.27/150.49 % --bmc1_add_unsat_core none
% 150.27/150.49 % --bmc1_unsat_core_children false
% 150.27/150.49 % --bmc1_unsat_core_extrapolate_axioms false
% 150.27/150.49 % --bmc1_out_stat full
% 150.27/150.49 % --bmc1_ground_init false
% 150.27/150.49 % --bmc1_pre_inst_next_state false
% 150.27/150.49 % --bmc1_pre_inst_state false
% 150.27/150.49 % --bmc1_pre_inst_reach_state false
% 150.27/150.49 % --bmc1_out_unsat_core false
% 150.27/150.49 % --bmc1_aig_witness_out false
% 150.27/150.49 % --bmc1_verbose false
% 150.27/150.49 % --bmc1_dump_clauses_tptp false
% 150.27/150.49 % --bmc1_dump_unsat_core_tptp false
% 150.27/150.49 % --bmc1_dump_file -
% 150.27/150.49 % --bmc1_ucm_expand_uc_limit 128
% 150.27/150.49 % --bmc1_ucm_n_expand_iterations 6
% 150.27/150.49 % --bmc1_ucm_extend_mode 1
% 150.27/150.49 % --bmc1_ucm_init_mode 2
% 150.27/150.49 % --bmc1_ucm_cone_mode none
% 150.27/150.49 % --bmc1_ucm_reduced_relation_type 0
% 150.27/150.49 % --bmc1_ucm_relax_model 4
% 150.27/150.49 % --bmc1_ucm_full_tr_after_sat true
% 150.27/150.49 % --bmc1_ucm_expand_neg_assumptions false
% 150.27/150.49 % --bmc1_ucm_layered_model none
% 150.27/150.49 % --bmc1_ucm_max_lemma_size 10
% 150.27/150.49
% 150.27/150.49 % ------ AIG Options
% 150.27/150.49
% 150.27/150.49 % --aig_mode false
% 150.27/150.49
% 150.27/150.49 % ------ Instantiation Options
% 150.27/150.49
% 150.27/150.49 % --instantiation_flag true
% 150.27/150.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.27/150.49 % --inst_solver_per_active 750
% 150.27/150.49 % --inst_solver_calls_frac 0.5
% 150.27/150.49 % --inst_passive_queue_type priority_queues
% 150.27/150.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.27/150.49 % --inst_passive_queues_freq [25;2]
% 150.27/150.49 % --inst_dismatching true
% 150.27/150.49 % --inst_eager_unprocessed_to_passive true
% 150.27/150.49 % --inst_prop_sim_given true
% 150.27/150.49 % --inst_prop_sim_new false
% 150.27/150.49 % --inst_orphan_elimination true
% 150.27/150.49 % --inst_learning_loop_flag true
% 150.27/150.49 % --inst_learning_start 3000
% 150.27/150.49 % --inst_learning_factor 2
% 150.27/150.49 % --inst_start_prop_sim_after_learn 3
% 150.27/150.49 % --inst_sel_renew solver
% 150.27/150.49 % --inst_lit_activity_flag true
% 150.27/150.49 % --inst_out_proof true
% 150.27/150.49
% 150.27/150.49 % ------ Resolution Options
% 150.27/150.49
% 150.27/150.49 % --resolution_flag true
% 150.27/150.49 % --res_lit_sel kbo_max
% 150.27/150.49 % --res_to_prop_solver none
% 150.27/150.49 % --res_prop_simpl_new false
% 150.27/150.49 % --res_prop_simpl_given false
% 150.27/150.49 % --res_passive_queue_type priority_queues
% 150.27/150.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.27/150.49 % --res_passive_queues_freq [15;5]
% 150.27/150.49 % --res_forward_subs full
% 150.27/150.49 % --res_backward_subs full
% 150.27/150.49 % --res_forward_subs_resolution true
% 150.27/150.49 % --res_backward_subs_resolution true
% 150.27/150.49 % --res_orphan_elimination false
% 150.27/150.49 % --res_time_limit 1000.
% 150.27/150.49 % --res_out_proof true
% 150.27/150.49 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fc50df.s
% 150.27/150.49 % --modulo true
% 150.27/150.49
% 150.27/150.49 % ------ Combination Options
% 150.27/150.49
% 150.27/150.49 % --comb_res_mult 1000
% 150.27/150.49 % --comb_inst_mult 300
% 150.27/150.49 % ------
% 150.27/150.49
% 150.27/150.49 % ------ Parsing...% successful
% 150.27/150.49
% 150.27/150.49 % ------ 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 %
% 150.27/150.49
% 150.27/150.49 % ------ Proving...
% 150.27/150.49 % ------ Problem Properties
% 150.27/150.49
% 150.27/150.49 %
% 150.27/150.49 % EPR false
% 150.27/150.49 % Horn true
% 150.27/150.49 % Has equality false
% 150.27/150.49
% 150.27/150.49 % % ------ Input Options Time Limit: Unbounded
% 150.27/150.49
% 150.27/150.49
% 150.27/150.49 % % ------ Current options:
% 150.27/150.49
% 150.27/150.49 % ------ Input Options
% 150.27/150.49
% 150.27/150.49 % --out_options all
% 150.27/150.49 % --tptp_safe_out true
% 150.27/150.49 % --problem_path ""
% 150.27/150.49 % --include_path ""
% 150.27/150.49 % --clausifier .//eprover
% 150.27/150.49 % --clausifier_options --tstp-format
% 150.27/150.49 % --stdin false
% 150.27/150.49 % --dbg_backtrace false
% 150.27/150.49 % --dbg_dump_prop_clauses false
% 150.27/150.49 % --dbg_dump_prop_clauses_file -
% 150.27/150.49 % --dbg_out_stat false
% 150.27/150.49
% 150.27/150.49 % ------ General Options
% 150.27/150.49
% 150.27/150.49 % --fof false
% 150.27/150.49 % --time_out_real 150.
% 150.27/150.49 % --time_out_prep_mult 0.2
% 150.27/150.49 % --time_out_virtual -1.
% 150.27/150.49 % --schedule none
% 150.27/150.49 % --ground_splitting input
% 150.27/150.49 % --splitting_nvd 16
% 150.27/150.49 % --non_eq_to_eq false
% 150.27/150.49 % --prep_gs_sim true
% 150.27/150.49 % --prep_unflatten false
% 150.27/150.49 % --prep_res_sim true
% 150.27/150.49 % --prep_upred true
% 150.27/150.49 % --res_sim_input true
% 150.27/150.49 % --clause_weak_htbl true
% 150.27/150.49 % --gc_record_bc_elim false
% 150.27/150.49 % --symbol_type_check false
% 150.27/150.49 % --clausify_out false
% 150.27/150.49 % --large_theory_mode false
% 150.27/150.49 % --prep_sem_filter none
% 150.27/150.49 % --prep_sem_filter_out false
% 150.27/150.49 % --preprocessed_out false
% 150.27/150.49 % --sub_typing false
% 150.27/150.49 % --brand_transform false
% 150.27/150.49 % --pure_diseq_elim true
% 150.27/150.49 % --min_unsat_core false
% 150.27/150.49 % --pred_elim true
% 150.27/150.49 % --add_important_lit false
% 150.27/150.49 % --soft_assumptions false
% 150.27/150.49 % --reset_solvers false
% 150.27/150.49 % --bc_imp_inh []
% 150.27/150.49 % --conj_cone_tolerance 1.5
% 150.27/150.49 % --prolific_symb_bound 500
% 150.27/150.49 % --lt_threshold 2000
% 150.27/150.49
% 150.27/150.49 % ------ SAT Options
% 150.27/150.49
% 150.27/150.49 % --sat_mode false
% 150.27/150.49 % --sat_fm_restart_options ""
% 150.27/150.49 % --sat_gr_def false
% 150.27/150.49 % --sat_epr_types true
% 150.27/150.49 % --sat_non_cyclic_types false
% 150.27/150.49 % --sat_finite_models false
% 150.27/150.49 % --sat_fm_lemmas false
% 150.27/150.49 % --sat_fm_prep false
% 150.27/150.49 % --sat_fm_uc_incr true
% 150.27/150.49 % --sat_out_model small
% 150.27/150.49 % --sat_out_clauses false
% 150.27/150.49
% 150.27/150.49 % ------ QBF Options
% 150.27/150.49
% 150.27/150.49 % --qbf_mode false
% 150.27/150.49 % --qbf_elim_univ true
% 150.27/150.49 % --qbf_sk_in true
% 150.27/150.49 % --qbf_pred_elim true
% 150.27/150.49 % --qbf_split 32
% 150.27/150.49
% 150.27/150.49 % ------ BMC1 Options
% 150.27/150.49
% 150.27/150.49 % --bmc1_incremental false
% 150.27/150.49 % --bmc1_axioms reachable_all
% 150.27/150.49 % --bmc1_min_bound 0
% 150.27/150.49 % --bmc1_max_bound -1
% 150.27/150.49 % --bmc1_max_bound_default -1
% 150.27/150.49 % --bmc1_symbol_reachability true
% 150.27/150.49 % --bmc1_property_lemmas false
% 150.27/150.49 % --bmc1_k_induction false
% 150.27/150.49 % --bmc1_non_equiv_states false
% 150.27/150.49 % --bmc1_deadlock false
% 150.27/150.49 % --bmc1_ucm false
% 150.27/150.49 % --bmc1_add_unsat_core none
% 150.27/150.49 % --bmc1_unsat_core_children false
% 150.27/150.49 % --bmc1_unsat_core_extrapolate_axioms false
% 150.27/150.49 % --bmc1_out_stat full
% 150.27/150.49 % --bmc1_ground_init false
% 150.27/150.49 % --bmc1_pre_inst_next_state false
% 150.27/150.49 % --bmc1_pre_inst_state false
% 150.27/150.49 % --bmc1_pre_inst_reach_state false
% 150.27/150.49 % --bmc1_out_unsat_core false
% 150.27/150.49 % --bmc1_aig_witness_out false
% 150.27/150.49 % --bmc1_verbose false
% 150.27/150.49 % --bmc1_dump_clauses_tptp false
% 150.27/150.49 % --bmc1_dump_unsat_core_tptp false
% 150.27/150.49 % --bmc1_dump_file -
% 150.27/150.49 % --bmc1_ucm_expand_uc_limit 128
% 150.27/150.49 % --bmc1_ucm_n_expand_iterations 6
% 150.27/150.49 % --bmc1_ucm_extend_mode 1
% 150.27/150.49 % --bmc1_ucm_init_mode 2
% 150.27/150.49 % --bmc1_ucm_cone_mode none
% 150.27/150.49 % --bmc1_ucm_reduced_relation_type 0
% 150.27/150.49 % --bmc1_ucm_relax_model 4
% 150.27/150.49 % --bmc1_ucm_full_tr_after_sat true
% 150.27/150.49 % --bmc1_ucm_expand_neg_assumptions false
% 150.27/150.49 % --bmc1_ucm_layered_model none
% 150.27/150.49 % --bmc1_ucm_max_lemma_size 10
% 150.27/150.49
% 150.27/150.49 % ------ AIG Options
% 150.27/150.49
% 150.27/150.49 % --aig_mode false
% 150.27/150.49
% 150.27/150.49 % ------ Instantiation Options
% 150.27/150.49
% 150.27/150.49 % --instantiation_flag true
% 150.27/150.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.27/150.49 % --inst_solver_per_active 750
% 150.27/150.49 % --inst_solver_calls_frac 0.5
% 150.27/150.49 % --inst_passive_queue_type priority_queues
% 150.27/150.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.27/150.49 % --inst_passive_queues_freq [25;2]
% 150.27/150.49 % --inst_dismatching true
% 150.27/150.49 % --inst_eager_unprocessed_to_passive true
% 150.27/150.49 % --inst_prop_sim_given true
% 222.72/222.93 % --inst_prop_sim_new false
% 222.72/222.93 % --inst_orphan_elimination true
% 222.72/222.93 % --inst_learning_loop_flag true
% 222.72/222.93 % --inst_learning_start 3000
% 222.72/222.93 % --inst_learning_factor 2
% 222.72/222.93 % --inst_start_prop_sim_after_learn 3
% 222.72/222.93 % --inst_sel_renew solver
% 222.72/222.93 % --inst_lit_activity_flag true
% 222.72/222.93 % --inst_out_proof true
% 222.72/222.93
% 222.72/222.93 % ------ Resolution Options
% 222.72/222.93
% 222.72/222.93 % --resolution_flag true
% 222.72/222.93 % --res_lit_sel kbo_max
% 222.72/222.93 % --res_to_prop_solver none
% 222.72/222.93 % --res_prop_simpl_new false
% 222.72/222.93 % --res_prop_simpl_given false
% 222.72/222.93 % --res_passive_queue_type priority_queues
% 222.72/222.93 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 222.72/222.93 % --res_passive_queues_freq [15;5]
% 222.72/222.93 % --res_forward_subs full
% 222.72/222.93 % --res_backward_subs full
% 222.72/222.93 % --res_forward_subs_resolution true
% 222.72/222.93 % --res_backward_subs_resolution true
% 222.72/222.93 % --res_orphan_elimination false
% 222.72/222.93 % --res_time_limit 1000.
% 222.72/222.93 % --res_out_proof true
% 222.72/222.93 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fc50df.s
% 222.72/222.93 % --modulo true
% 222.72/222.93
% 222.72/222.93 % ------ Combination Options
% 222.72/222.93
% 222.72/222.93 % --comb_res_mult 1000
% 222.72/222.93 % --comb_inst_mult 300
% 222.72/222.93 % ------
% 222.72/222.93
% 222.72/222.93
% 222.72/222.93
% 222.72/222.93 % ------ Proving...
% 222.72/222.93 %
% 222.72/222.93
% 222.72/222.93
% 222.72/222.93 % ------ Statistics
% 222.72/222.93
% 222.72/222.93 % ------ General
% 222.72/222.93
% 222.72/222.93 % num_of_input_clauses: 14
% 222.72/222.93 % num_of_input_neg_conjectures: 1
% 222.72/222.93 % num_of_splits: 0
% 222.72/222.93 % num_of_split_atoms: 0
% 222.72/222.93 % num_of_sem_filtered_clauses: 0
% 222.72/222.93 % num_of_subtypes: 0
% 222.72/222.93 % monotx_restored_types: 0
% 222.72/222.93 % sat_num_of_epr_types: 0
% 222.72/222.93 % sat_num_of_non_cyclic_types: 0
% 222.72/222.93 % sat_guarded_non_collapsed_types: 0
% 222.72/222.93 % is_epr: 0
% 222.72/222.93 % is_horn: 1
% 222.72/222.93 % has_eq: 0
% 222.72/222.93 % num_pure_diseq_elim: 0
% 222.72/222.93 % simp_replaced_by: 0
% 222.72/222.93 % res_preprocessed: 2
% 222.72/222.93 % prep_upred: 0
% 222.72/222.93 % prep_unflattend: 0
% 222.72/222.93 % pred_elim_cands: 0
% 222.72/222.93 % pred_elim: 0
% 222.72/222.93 % pred_elim_cl: 0
% 222.72/222.93 % pred_elim_cycles: 0
% 222.72/222.93 % forced_gc_time: 0
% 222.72/222.93 % gc_basic_clause_elim: 0
% 222.72/222.93 % parsing_time: 0.
% 222.72/222.93 % sem_filter_time: 0.
% 222.72/222.93 % pred_elim_time: 0.
% 222.72/222.93 % out_proof_time: 0.005
% 222.72/222.93 % monotx_time: 0.
% 222.72/222.93 % subtype_inf_time: 0.
% 222.72/222.93 % unif_index_cands_time: 0.358
% 222.72/222.93 % unif_index_add_time: 0.199
% 222.72/222.93 % total_time: 72.457
% 222.72/222.93 % num_of_symbols: 31
% 222.72/222.93 % num_of_terms: 350932
% 222.72/222.93
% 222.72/222.93 % ------ Propositional Solver
% 222.72/222.93
% 222.72/222.93 % prop_solver_calls: 52
% 222.72/222.93 % prop_fast_solver_calls: 3
% 222.72/222.93 % prop_num_of_clauses: 25861
% 222.72/222.93 % prop_preprocess_simplified: 39517
% 222.72/222.93 % prop_fo_subsumed: 0
% 222.72/222.93 % prop_solver_time: 0.037
% 222.72/222.93 % prop_fast_solver_time: 0.
% 222.72/222.93 % prop_unsat_core_time: 0.004
% 222.72/222.93
% 222.72/222.93 % ------ QBF
% 222.72/222.93
% 222.72/222.93 % qbf_q_res: 0
% 222.72/222.93 % qbf_num_tautologies: 0
% 222.72/222.93 % qbf_prep_cycles: 0
% 222.72/222.93
% 222.72/222.93 % ------ BMC1
% 222.72/222.93
% 222.72/222.93 % bmc1_current_bound: -1
% 222.72/222.93 % bmc1_last_solved_bound: -1
% 222.72/222.93 % bmc1_unsat_core_size: -1
% 222.72/222.93 % bmc1_unsat_core_parents_size: -1
% 222.72/222.93 % bmc1_merge_next_fun: 0
% 222.72/222.93 % bmc1_unsat_core_clauses_time: 0.
% 222.72/222.93
% 222.72/222.93 % ------ Instantiation
% 222.72/222.93
% 222.72/222.93 % inst_num_of_clauses: 4089
% 222.72/222.93 % inst_num_in_passive: 1929
% 222.72/222.93 % inst_num_in_active: 1957
% 222.72/222.93 % inst_num_in_unprocessed: 78
% 222.72/222.93 % inst_num_of_loops: 2127
% 222.72/222.93 % inst_num_of_learning_restarts: 2
% 222.72/222.93 % inst_num_moves_active_passive: 47
% 222.72/222.93 % inst_lit_activity: 399
% 222.72/222.93 % inst_lit_activity_moves: 0
% 222.72/222.93 % inst_num_tautologies: 118
% 222.72/222.93 % inst_num_prop_implied: 0
% 222.72/222.93 % inst_num_existing_simplified: 0
% 222.72/222.93 % inst_num_eq_res_simplified: 0
% 222.72/222.93 % inst_num_child_elim: 0
% 222.72/222.93 % inst_num_of_dismatching_blockings: 11069
% 222.72/222.93 % inst_num_of_non_proper_insts: 10336
% 222.72/222.93 % inst_num_of_duplicates: 2545
% 222.72/222.93 % inst_inst_num_from_inst_to_res: 0
% 222.72/222.93 % inst_dismatching_checking_time: 0.338
% 222.72/222.93
% 222.72/222.93 % ------ Resolution
% 222.72/222.93
% 222.72/222.93 % res_num_of_clauses: 66860
% 222.72/222.93 % res_num_in_passive: 37124
% 222.72/222.93 % res_num_in_active: 29731
% 222.72/222.93 % res_num_of_loops: 38000
% 222.72/222.93 % res_forward_subset_subsumed: 18552
% 222.72/222.93 % res_backward_subset_subsumed: 0
% 222.72/222.93 % res_forward_subsumed: 5688
% 222.72/222.93 % res_backward_subsumed: 2589
% 222.72/222.93 % res_forward_subsumption_resolution: 3
% 222.72/222.93 % res_backward_subsumption_resolution: 0
% 222.72/222.93 % res_clause_to_clause_subsumption: 11613685
% 222.72/222.93 % res_orphan_elimination: 0
% 222.72/222.93 % res_tautology_del: 0
% 222.72/222.93 % res_num_eq_res_simplified: 0
% 222.72/222.93 % res_num_sel_changes: 0
% 222.72/222.93 % res_moves_from_active_to_pass: 0
% 222.72/222.93
% 222.72/222.93 % Status Unsatisfiable
% 222.72/222.93 % SZS status Unsatisfiable
% 222.72/222.93 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------