%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LCL230-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 12:20:25 PM UTC 2026
% Result : Unsatisfiable 150.34s 269.21s
% Output : CNFRefutation 150.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 117 ( 64 unt; 0 def)
% Number of atoms : 212 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 196 ( 101 ~; 95 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 208 ( 7 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(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
file('<stdin>',prove_this) ).
fof(c_0_1_002,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
c_0_1 ).
cnf(c_0_3_004,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_4,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_448233.p',c_0_32_0) ).
cnf(c_447036,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_447541,plain,
axiom(or(not(or(not(X0),or(not(X1),X2))),or(not(or(X3,X0)),or(X3,or(not(X1),X2))))),
inference(instantiation,[status(thm)],[c_447036]) ).
cnf(c_448419,plain,
axiom(or(not(or(not(or(not(or(p,q)),r)),or(not(q),r))),or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r))))),
inference(instantiation,[status(thm)],[c_447541]) ).
cnf(c_3,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_448233.p',c_0_33_0) ).
cnf(c_447035,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_447110,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_447035]) ).
cnf(c_447493,plain,
axiom(or(not(or(not(q),or(not(or(not(or(p,q)),r)),r))),or(not(or(not(or(p,q)),r)),or(not(q),r)))),
inference(instantiation,[status(thm)],[c_447110]) ).
cnf(c_237211,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_237759,plain,
axiom(or(not(or(X0,or(not(X1),X2))),or(not(X1),or(X0,X2)))),
inference(instantiation,[status(thm)],[c_237211]) ).
cnf(c_295376,plain,
axiom(or(not(or(not(X0),or(not(X1),X2))),or(not(X1),or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_237759]) ).
cnf(c_329339,plain,
axiom(or(not(or(not(or(not(or(p,q)),r)),or(not(or(X0,q)),r))),or(not(or(X0,q)),or(not(or(not(or(p,q)),r)),r)))),
inference(instantiation,[status(thm)],[c_295376]) ).
cnf(c_329340,plain,
axiom(or(not(or(not(or(not(or(p,q)),r)),or(not(or(p,q)),r))),or(not(or(p,q)),or(not(or(not(or(p,q)),r)),r)))),
inference(instantiation,[status(thm)],[c_329339]) ).
cnf(c_237212,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_285395,plain,
axiom(or(not(or(not(r),r)),or(not(or(not(or(p,q)),r)),or(not(or(p,q)),r)))),
inference(instantiation,[status(thm)],[c_237212]) ).
cnf(c_9,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_448233.p',c_0_38_0) ).
cnf(c_237217,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_237232,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_237217]) ).
cnf(c_237288,plain,
( ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1))))
| theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(instantiation,[status(thm)],[c_237232]) ).
cnf(c_246854,plain,
( ~ axiom(or(not(or(not(X0),X1)),or(not(or(not(X2),X0)),or(not(X2),X1))))
| theorem(or(not(or(not(X2),X0)),or(not(X2),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(instantiation,[status(thm)],[c_237288]) ).
cnf(c_256404,plain,
( ~ axiom(or(not(or(not(r),r)),or(not(or(not(or(p,q)),r)),or(not(or(p,q)),r))))
| theorem(or(not(or(not(or(p,q)),r)),or(not(or(p,q)),r)))
| ~ theorem(or(not(r),r)) ),
inference(instantiation,[status(thm)],[c_246854]) ).
cnf(c_0,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_448233.p',c_0_37_0) ).
cnf(c_237208,plain,
axiom(or(not(X0),or(X1,X0))),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_247132,plain,
axiom(or(not(r),or(r,r))),
inference(instantiation,[status(thm)],[c_237208]) ).
cnf(c_237286,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_237232]) ).
cnf(c_238941,plain,
( ~ axiom(or(not(or(not(or(not(or(p,q)),r)),or(not(or(X0,q)),r))),or(not(or(X0,q)),or(not(or(not(or(p,q)),r)),r))))
| ~ theorem(or(not(or(not(or(p,q)),r)),or(not(or(X0,q)),r)))
| theorem(or(not(or(X0,q)),or(not(or(not(or(p,q)),r)),r))) ),
inference(instantiation,[status(thm)],[c_237286]) ).
cnf(c_238942,plain,
( ~ axiom(or(not(or(not(or(not(or(p,q)),r)),or(not(or(p,q)),r))),or(not(or(p,q)),or(not(or(not(or(p,q)),r)),r))))
| ~ theorem(or(not(or(not(or(p,q)),r)),or(not(or(p,q)),r)))
| theorem(or(not(or(p,q)),or(not(or(not(or(p,q)),r)),r))) ),
inference(instantiation,[status(thm)],[c_238941]) ).
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_448233.p',c_0_35_2) ).
cnf(c_237218,plain,
( theorem(or(not(X0),X1))
| ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2)) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_237706,plain,
( ~ axiom(or(not(q),X0))
| theorem(or(not(q),or(not(or(not(or(p,q)),r)),r)))
| ~ theorem(or(not(X0),or(not(or(not(or(p,q)),r)),r))) ),
inference(instantiation,[status(thm)],[c_237218]) ).
cnf(c_238013,plain,
( ~ axiom(or(not(q),or(X0,q)))
| ~ theorem(or(not(or(X0,q)),or(not(or(not(or(p,q)),r)),r)))
| theorem(or(not(q),or(not(or(not(or(p,q)),r)),r))) ),
inference(instantiation,[status(thm)],[c_237706]) ).
cnf(c_238014,plain,
( ~ axiom(or(not(q),or(p,q)))
| ~ theorem(or(not(or(p,q)),or(not(or(not(or(p,q)),r)),r)))
| theorem(or(not(q),or(not(or(not(or(p,q)),r)),r))) ),
inference(instantiation,[status(thm)],[c_238013]) ).
cnf(c_237569,plain,
( ~ axiom(or(not(or(not(q),or(not(or(not(or(p,q)),r)),r))),or(not(or(not(or(p,q)),r)),or(not(q),r))))
| theorem(or(not(or(not(or(p,q)),r)),or(not(q),r)))
| ~ theorem(or(not(q),or(not(or(not(or(p,q)),r)),r))) ),
inference(instantiation,[status(thm)],[c_237286]) ).
cnf(c_237544,plain,
( ~ axiom(or(not(or(not(or(not(or(p,q)),r)),or(not(q),r))),or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r)))))
| ~ theorem(or(not(or(not(or(p,q)),r)),or(not(q),r)))
| theorem(or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r)))) ),
inference(instantiation,[status(thm)],[c_237288]) ).
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_448233.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_7578,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_10099,plain,
( ~ axiom(or(not(X0),or(X1,X0)))
| ~ theorem(or(not(or(X1,X0)),r))
| theorem(or(not(X0),r)) ),
inference(instantiation,[status(thm)],[c_7578]) ).
cnf(c_121908,plain,
( ~ axiom(or(not(r),or(r,r)))
| ~ theorem(or(not(or(r,r)),r))
| theorem(or(not(r),r)) ),
inference(instantiation,[status(thm)],[c_10099]) ).
cnf(c_6,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_448233.p',c_0_39_0) ).
cnf(c_33,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_7566,plain,
( ~ axiom(or(not(or(X0,X0)),X0))
| theorem(or(not(or(X0,X0)),X0)) ),
inference(instantiation,[status(thm)],[c_33]) ).
cnf(c_10103,plain,
( ~ axiom(or(not(or(r,r)),r))
| theorem(or(not(or(r,r)),r)) ),
inference(instantiation,[status(thm)],[c_7566]) ).
cnf(c_27,plain,
axiom(or(not(X0),or(X1,X0))),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_10064,plain,
axiom(or(not(q),or(X0,q))),
inference(instantiation,[status(thm)],[c_27]) ).
cnf(c_10065,plain,
axiom(or(not(q),or(p,q))),
inference(instantiation,[status(thm)],[c_10064]) ).
cnf(c_1,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_448233.p',c_0_36_0) ).
cnf(c_28,plain,
axiom(or(not(or(X0,X0)),X0)),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_10027,plain,
axiom(or(not(or(r,r)),r)),
inference(instantiation,[status(thm)],[c_28]) ).
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_7672,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_30]) ).
cnf(c_8533,plain,
axiom(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(or(p,q)),r)))),
inference(instantiation,[status(thm)],[c_7672]) ).
cnf(c_12,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(or(not(X1),X2))
| theorem(or(not(X0),X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_448233.p',c_0_35_0) ).
cnf(c_39,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(or(not(X1),X2))
| theorem(or(not(X0),X2)) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_7589,plain,
( ~ axiom(or(not(or(not(or(p,q)),or(p,r))),X0))
| theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))))
| ~ theorem(or(not(X0),or(p,or(not(q),r)))) ),
inference(instantiation,[status(thm)],[c_39]) ).
cnf(c_7693,plain,
( ~ axiom(or(not(or(not(or(p,q)),or(p,r))),or(X0,X1)))
| theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))))
| ~ theorem(or(not(or(X0,X1)),or(p,or(not(q),r)))) ),
inference(instantiation,[status(thm)],[c_7589]) ).
cnf(c_8532,plain,
( ~ axiom(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(or(p,q)),r))))
| theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))))
| ~ theorem(or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r)))) ),
inference(instantiation,[status(thm)],[c_7693]) ).
cnf(c_13,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_448233.p',c_0_4) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_448419,c_447493,c_329340,c_285395,c_256404,c_247132,c_238942,c_238014,c_237569,c_237544,c_121908,c_10103,c_10065,c_10027,c_8533,c_8532,c_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL230-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : iprover_modulo %s %d
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 4 14:42:23 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Running in mono-core mode
% 0.10/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.10/0.43 % Orientation found
% 0.10/0.43 % 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_92aff8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_448233.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_0bcabb | grep -v "SZS"
% 0.20/0.46
% 0.20/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.46
% 0.20/0.46 %
% 0.20/0.46 % ------ iProver source info
% 0.20/0.46
% 0.20/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.46 % git: non_committed_changes: true
% 0.20/0.46 % git: last_make_outside_of_git: true
% 0.20/0.46
% 0.20/0.46 %
% 0.20/0.46 % ------ Input Options
% 0.20/0.46
% 0.20/0.46 % --out_options all
% 0.20/0.46 % --tptp_safe_out true
% 0.20/0.46 % --problem_path ""
% 0.20/0.46 % --include_path ""
% 0.20/0.46 % --clausifier .//eprover
% 0.20/0.46 % --clausifier_options --tstp-format
% 0.20/0.46 % --stdin false
% 0.20/0.46 % --dbg_backtrace false
% 0.20/0.46 % --dbg_dump_prop_clauses false
% 0.20/0.46 % --dbg_dump_prop_clauses_file -
% 0.20/0.46 % --dbg_out_stat false
% 0.20/0.46
% 0.20/0.46 % ------ General Options
% 0.20/0.46
% 0.20/0.46 % --fof false
% 0.20/0.46 % --time_out_real 150.
% 0.20/0.46 % --time_out_prep_mult 0.2
% 0.20/0.46 % --time_out_virtual -1.
% 0.20/0.46 % --schedule none
% 0.20/0.46 % --ground_splitting input
% 0.20/0.46 % --splitting_nvd 16
% 0.20/0.46 % --non_eq_to_eq false
% 0.20/0.46 % --prep_gs_sim true
% 0.20/0.46 % --prep_unflatten false
% 0.20/0.46 % --prep_res_sim true
% 0.20/0.46 % --prep_upred true
% 0.20/0.46 % --res_sim_input true
% 0.20/0.46 % --clause_weak_htbl true
% 0.20/0.46 % --gc_record_bc_elim false
% 0.20/0.46 % --symbol_type_check false
% 0.20/0.46 % --clausify_out false
% 0.20/0.46 % --large_theory_mode false
% 0.20/0.46 % --prep_sem_filter none
% 0.20/0.46 % --prep_sem_filter_out false
% 0.20/0.46 % --preprocessed_out false
% 0.20/0.46 % --sub_typing false
% 0.20/0.46 % --brand_transform false
% 0.20/0.46 % --pure_diseq_elim true
% 0.20/0.46 % --min_unsat_core false
% 0.20/0.46 % --pred_elim true
% 0.20/0.46 % --add_important_lit false
% 0.20/0.46 % --soft_assumptions false
% 0.20/0.47 % --reset_solvers false
% 0.20/0.47 % --bc_imp_inh []
% 0.20/0.47 % --conj_cone_tolerance 1.5
% 0.20/0.47 % --prolific_symb_bound 500
% 0.20/0.47 % --lt_threshold 2000
% 0.20/0.47
% 0.20/0.47 % ------ SAT Options
% 0.20/0.47
% 0.20/0.47 % --sat_mode false
% 0.20/0.47 % --sat_fm_restart_options ""
% 0.20/0.47 % --sat_gr_def false
% 0.20/0.47 % --sat_epr_types true
% 0.20/0.47 % --sat_non_cyclic_types false
% 0.20/0.47 % --sat_finite_models false
% 0.20/0.47 % --sat_fm_lemmas false
% 0.20/0.47 % --sat_fm_prep false
% 0.20/0.47 % --sat_fm_uc_incr true
% 0.20/0.47 % --sat_out_model small
% 0.20/0.47 % --sat_out_clauses false
% 0.20/0.47
% 0.20/0.47 % ------ QBF Options
% 0.20/0.47
% 0.20/0.47 % --qbf_mode false
% 0.20/0.47 % --qbf_elim_univ true
% 0.20/0.47 % --qbf_sk_in true
% 0.20/0.47 % --qbf_pred_elim true
% 0.20/0.47 % --qbf_split 32
% 0.20/0.47
% 0.20/0.47 % ------ BMC1 Options
% 0.20/0.47
% 0.20/0.47 % --bmc1_incremental false
% 0.20/0.47 % --bmc1_axioms reachable_all
% 0.20/0.47 % --bmc1_min_bound 0
% 0.20/0.47 % --bmc1_max_bound -1
% 0.20/0.47 % --bmc1_max_bound_default -1
% 0.20/0.47 % --bmc1_symbol_reachability true
% 0.20/0.47 % --bmc1_property_lemmas false
% 0.20/0.47 % --bmc1_k_induction false
% 0.20/0.47 % --bmc1_non_equiv_states false
% 0.20/0.47 % --bmc1_deadlock false
% 0.20/0.47 % --bmc1_ucm false
% 0.20/0.47 % --bmc1_add_unsat_core none
% 0.20/0.47 % --bmc1_unsat_core_children false
% 0.20/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.47 % --bmc1_out_stat full
% 0.20/0.47 % --bmc1_ground_init false
% 0.20/0.47 % --bmc1_pre_inst_next_state false
% 0.20/0.47 % --bmc1_pre_inst_state false
% 0.20/0.47 % --bmc1_pre_inst_reach_state false
% 0.20/0.47 % --bmc1_out_unsat_core false
% 0.20/0.47 % --bmc1_aig_witness_out false
% 0.20/0.47 % --bmc1_verbose false
% 0.20/0.47 % --bmc1_dump_clauses_tptp false
% 0.20/0.47 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.47 % --bmc1_dump_file -
% 0.20/0.47 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.47 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.47 % --bmc1_ucm_extend_mode 1
% 0.20/0.47 % --bmc1_ucm_init_mode 2
% 0.20/0.47 % --bmc1_ucm_cone_mode none
% 0.20/0.47 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.47 % --bmc1_ucm_relax_model 4
% 0.20/0.47 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.47 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.47 % --bmc1_ucm_layered_model none
% 0.20/0.47 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.47
% 0.20/0.47 % ------ AIG Options
% 0.20/0.47
% 0.20/0.47 % --aig_mode false
% 0.20/0.47
% 0.20/0.47 % ------ Instantiation Options
% 0.20/0.47
% 0.20/0.47 % --instantiation_flag true
% 0.20/0.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.47 % --inst_solver_per_active 750
% 0.20/0.47 % --inst_solver_calls_frac 0.5
% 0.20/0.47 % --inst_passive_queue_type priority_queues
% 0.20/0.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.47 % --inst_passive_queues_freq [25;2]
% 0.20/0.47 % --inst_dismatching true
% 0.20/0.47 % --inst_eager_unprocessed_to_passive true
% 0.20/0.47 % --inst_prop_sim_given true
% 0.20/0.47 % --inst_prop_sim_new false
% 0.20/0.47 % --inst_orphan_elimination true
% 0.20/0.47 % --inst_learning_loop_flag true
% 0.20/0.47 % --inst_learning_start 3000
% 0.20/0.47 % --inst_learning_factor 2
% 0.20/0.47 % --inst_start_prop_sim_after_learn 3
% 0.20/0.47 % --inst_sel_renew solver
% 0.20/0.47 % --inst_lit_activity_flag true
% 0.20/0.47 % --inst_out_proof true
% 0.20/0.47
% 0.20/0.47 % ------ Resolution Options
% 0.20/0.47
% 0.20/0.47 % --resolution_flag true
% 0.20/0.47 % --res_lit_sel kbo_max
% 0.20/0.47 % --res_to_prop_solver none
% 0.20/0.47 % --res_prop_simpl_new false
% 0.20/0.47 % --res_prop_simpl_given false
% 0.20/0.47 % --res_passive_queue_type priority_queues
% 0.20/0.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.47 % --res_passive_queues_freq [15;5]
% 0.20/0.47 % --res_forward_subs full
% 0.20/0.47 % --res_backward_subs full
% 0.20/0.47 % --res_forward_subs_resolution true
% 0.20/0.47 % --res_backward_subs_resolution true
% 0.20/0.47 % --res_orphan_elimination false
% 0.20/0.47 % --res_time_limit 1000.
% 0.20/0.47 % --res_out_proof true
% 0.20/0.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_92aff8.s
% 0.20/0.47 % --modulo true
% 0.20/0.47
% 0.20/0.47 % ------ Combination Options
% 0.20/0.47
% 0.20/0.47 % --comb_res_mult 1000
% 0.20/0.47 % --comb_inst_mult 300
% 0.20/0.47 % ------
% 0.20/0.47
% 0.20/0.47 % ------ Parsing...% successful
% 0.20/0.47
% 0.20/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.20/0.47
% 0.20/0.47 % ------ Proving...
% 0.20/0.47 % ------ Problem Properties
% 0.20/0.47
% 0.20/0.47 %
% 0.20/0.47 % EPR false
% 0.20/0.47 % Horn true
% 0.20/0.47 % Has equality false
% 0.20/0.47
% 0.20/0.47 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 % % ------ Current options:
% 0.20/0.47
% 0.20/0.47 % ------ Input Options
% 0.20/0.47
% 0.20/0.47 % --out_options all
% 0.20/0.47 % --tptp_safe_out true
% 0.20/0.47 % --problem_path ""
% 0.20/0.47 % --include_path ""
% 0.20/0.47 % --clausifier .//eprover
% 0.20/0.47 % --clausifier_options --tstp-format
% 0.20/0.47 % --stdin false
% 0.20/0.47 % --dbg_backtrace false
% 0.20/0.47 % --dbg_dump_prop_clauses false
% 0.20/0.47 % --dbg_dump_prop_clauses_file -
% 0.20/0.47 % --dbg_out_stat false
% 0.20/0.47
% 0.20/0.47 % ------ General Options
% 0.20/0.47
% 0.20/0.47 % --fof false
% 0.20/0.47 % --time_out_real 150.
% 0.20/0.47 % --time_out_prep_mult 0.2
% 0.20/0.47 % --time_out_virtual -1.
% 0.20/0.47 % --schedule none
% 0.20/0.47 % --ground_splitting input
% 0.20/0.47 % --splitting_nvd 16
% 0.20/0.47 % --non_eq_to_eq false
% 0.20/0.47 % --prep_gs_sim true
% 0.20/0.47 % --prep_unflatten false
% 0.20/0.47 % --prep_res_sim true
% 0.20/0.47 % --prep_upred true
% 0.20/0.47 % --res_sim_input true
% 0.20/0.47 % --clause_weak_htbl true
% 0.20/0.47 % --gc_record_bc_elim false
% 0.20/0.47 % --symbol_type_check false
% 0.20/0.47 % --clausify_out false
% 0.20/0.47 % --large_theory_mode false
% 0.20/0.47 % --prep_sem_filter none
% 0.20/0.47 % --prep_sem_filter_out false
% 0.20/0.47 % --preprocessed_out false
% 0.20/0.47 % --sub_typing false
% 0.20/0.47 % --brand_transform false
% 0.20/0.47 % --pure_diseq_elim true
% 0.20/0.47 % --min_unsat_core false
% 0.20/0.47 % --pred_elim true
% 0.20/0.47 % --add_important_lit false
% 0.20/0.47 % --soft_assumptions false
% 0.20/0.47 % --reset_solvers false
% 0.20/0.47 % --bc_imp_inh []
% 0.20/0.47 % --conj_cone_tolerance 1.5
% 0.20/0.47 % --prolific_symb_bound 500
% 0.20/0.47 % --lt_threshold 2000
% 0.20/0.47
% 0.20/0.47 % ------ SAT Options
% 0.20/0.47
% 0.20/0.47 % --sat_mode false
% 0.20/0.47 % --sat_fm_restart_options ""
% 0.20/0.47 % --sat_gr_def false
% 0.20/0.47 % --sat_epr_types true
% 0.20/0.47 % --sat_non_cyclic_types false
% 0.20/0.47 % --sat_finite_models false
% 0.20/0.47 % --sat_fm_lemmas false
% 0.20/0.47 % --sat_fm_prep false
% 0.20/0.47 % --sat_fm_uc_incr true
% 0.20/0.47 % --sat_out_model small
% 0.20/0.47 % --sat_out_clauses false
% 0.20/0.47
% 0.20/0.47 % ------ QBF Options
% 0.20/0.47
% 0.20/0.47 % --qbf_mode false
% 0.20/0.47 % --qbf_elim_univ true
% 0.20/0.47 % --qbf_sk_in true
% 0.20/0.47 % --qbf_pred_elim true
% 0.20/0.47 % --qbf_split 32
% 0.20/0.47
% 0.20/0.47 % ------ BMC1 Options
% 0.20/0.47
% 0.20/0.47 % --bmc1_incremental false
% 0.20/0.47 % --bmc1_axioms reachable_all
% 0.20/0.47 % --bmc1_min_bound 0
% 0.20/0.47 % --bmc1_max_bound -1
% 0.20/0.47 % --bmc1_max_bound_default -1
% 0.20/0.47 % --bmc1_symbol_reachability true
% 0.20/0.47 % --bmc1_property_lemmas false
% 0.20/0.47 % --bmc1_k_induction false
% 0.20/0.47 % --bmc1_non_equiv_states false
% 0.20/0.47 % --bmc1_deadlock false
% 0.20/0.47 % --bmc1_ucm false
% 0.20/0.47 % --bmc1_add_unsat_core none
% 0.20/0.47 % --bmc1_unsat_core_children false
% 0.20/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.47 % --bmc1_out_stat full
% 0.20/0.47 % --bmc1_ground_init false
% 0.20/0.47 % --bmc1_pre_inst_next_state false
% 0.20/0.47 % --bmc1_pre_inst_state false
% 0.20/0.47 % --bmc1_pre_inst_reach_state false
% 0.20/0.47 % --bmc1_out_unsat_core false
% 0.20/0.47 % --bmc1_aig_witness_out false
% 0.20/0.47 % --bmc1_verbose false
% 0.20/0.47 % --bmc1_dump_clauses_tptp false
% 0.20/0.47 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.47 % --bmc1_dump_file -
% 0.20/0.47 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.47 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.47 % --bmc1_ucm_extend_mode 1
% 0.20/0.47 % --bmc1_ucm_init_mode 2
% 0.20/0.47 % --bmc1_ucm_cone_mode none
% 0.20/0.47 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.47 % --bmc1_ucm_relax_model 4
% 0.20/0.47 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.47 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.47 % --bmc1_ucm_layered_model none
% 0.20/0.47 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.47
% 0.20/0.47 % ------ AIG Options
% 0.20/0.47
% 0.20/0.47 % --aig_mode false
% 0.20/0.47
% 0.20/0.47 % ------ Instantiation Options
% 0.20/0.47
% 0.20/0.47 % --instantiation_flag true
% 0.20/0.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.47 % --inst_solver_per_active 750
% 0.20/0.47 % --inst_solver_calls_frac 0.5
% 0.20/0.47 % --inst_passive_queue_type priority_queues
% 0.20/0.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.47 % --inst_passive_queues_freq [25;2]
% 0.20/0.47 % --inst_dismatching true
% 0.20/0.47 % --inst_eager_unprocessed_to_passive true
% 0.20/0.47 % --inst_prop_sim_given true
% 150.15/150.47 % --inst_prop_sim_new false
% 150.15/150.47 % --inst_orphan_elimination true
% 150.15/150.47 % --inst_learning_loop_flag true
% 150.15/150.47 % --inst_learning_start 3000
% 150.15/150.47 % --inst_learning_factor 2
% 150.15/150.47 % --inst_start_prop_sim_after_learn 3
% 150.15/150.47 % --inst_sel_renew solver
% 150.15/150.47 % --inst_lit_activity_flag true
% 150.15/150.47 % --inst_out_proof true
% 150.15/150.47
% 150.15/150.47 % ------ Resolution Options
% 150.15/150.47
% 150.15/150.47 % --resolution_flag true
% 150.15/150.47 % --res_lit_sel kbo_max
% 150.15/150.47 % --res_to_prop_solver none
% 150.15/150.47 % --res_prop_simpl_new false
% 150.15/150.47 % --res_prop_simpl_given false
% 150.15/150.47 % --res_passive_queue_type priority_queues
% 150.15/150.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.15/150.47 % --res_passive_queues_freq [15;5]
% 150.15/150.47 % --res_forward_subs full
% 150.15/150.47 % --res_backward_subs full
% 150.15/150.47 % --res_forward_subs_resolution true
% 150.15/150.47 % --res_backward_subs_resolution true
% 150.15/150.47 % --res_orphan_elimination false
% 150.15/150.47 % --res_time_limit 1000.
% 150.15/150.47 % --res_out_proof true
% 150.15/150.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_92aff8.s
% 150.15/150.47 % --modulo true
% 150.15/150.47
% 150.15/150.47 % ------ Combination Options
% 150.15/150.47
% 150.15/150.47 % --comb_res_mult 1000
% 150.15/150.47 % --comb_inst_mult 300
% 150.15/150.47 % ------
% 150.15/150.47
% 150.15/150.47
% 150.15/150.47
% 150.15/150.47 % ------ Proving...
% 150.15/150.47 %
% 150.15/150.47
% 150.15/150.47
% 150.15/150.47 % Time Out Real
% 150.15/150.47
% 150.15/150.47 % ------ Statistics
% 150.15/150.47
% 150.15/150.47 % ------ General
% 150.15/150.47
% 150.15/150.47 % num_of_input_clauses: 14
% 150.15/150.47 % num_of_input_neg_conjectures: 1
% 150.15/150.47 % num_of_splits: 0
% 150.15/150.47 % num_of_split_atoms: 0
% 150.15/150.47 % num_of_sem_filtered_clauses: 0
% 150.15/150.47 % num_of_subtypes: 0
% 150.15/150.47 % monotx_restored_types: 0
% 150.15/150.47 % sat_num_of_epr_types: 0
% 150.15/150.47 % sat_num_of_non_cyclic_types: 0
% 150.15/150.47 % sat_guarded_non_collapsed_types: 0
% 150.15/150.47 % is_epr: 0
% 150.15/150.47 % is_horn: 1
% 150.15/150.47 % has_eq: 0
% 150.15/150.47 % num_pure_diseq_elim: 0
% 150.15/150.47 % simp_replaced_by: 0
% 150.15/150.47 % res_preprocessed: 2
% 150.15/150.47 % prep_upred: 0
% 150.15/150.47 % prep_unflattend: 0
% 150.15/150.47 % pred_elim_cands: 0
% 150.15/150.47 % pred_elim: 0
% 150.15/150.47 % pred_elim_cl: 0
% 150.15/150.47 % pred_elim_cycles: 0
% 150.15/150.47 % forced_gc_time: 0
% 150.15/150.47 % gc_basic_clause_elim: 0
% 150.15/150.47 % parsing_time: 0.
% 150.15/150.47 % sem_filter_time: 0.
% 150.15/150.47 % pred_elim_time: 0.
% 150.15/150.47 % out_proof_time: 0.
% 150.15/150.47 % monotx_time: 0.
% 150.15/150.47 % subtype_inf_time: 0.
% 150.15/150.47 % unif_index_cands_time: 0.329
% 150.15/150.47 % unif_index_add_time: 0.463
% 150.15/150.47 % total_time: 150.025
% 150.15/150.47 % num_of_symbols: 32
% 150.15/150.47 % num_of_terms: 578824
% 150.15/150.47
% 150.15/150.47 % ------ Propositional Solver
% 150.15/150.47
% 150.15/150.47 % prop_solver_calls: 29
% 150.15/150.47 % prop_fast_solver_calls: 3
% 150.15/150.47 % prop_num_of_clauses: 18716
% 150.15/150.47 % prop_preprocess_simplified: 17418
% 150.15/150.47 % prop_fo_subsumed: 0
% 150.15/150.47 % prop_solver_time: 0.028
% 150.15/150.47 % prop_fast_solver_time: 0.
% 150.15/150.47 % prop_unsat_core_time: 0.
% 150.15/150.47
% 150.15/150.47 % ------ QBF
% 150.15/150.47
% 150.15/150.47 % qbf_q_res: 0
% 150.15/150.47 % qbf_num_tautologies: 0
% 150.15/150.47 % qbf_prep_cycles: 0
% 150.15/150.47
% 150.15/150.47 % ------ BMC1
% 150.15/150.47
% 150.15/150.47 % bmc1_current_bound: -1
% 150.15/150.47 % bmc1_last_solved_bound: -1
% 150.15/150.47 % bmc1_unsat_core_size: -1
% 150.15/150.47 % bmc1_unsat_core_parents_size: -1
% 150.15/150.47 % bmc1_merge_next_fun: 0
% 150.15/150.47 % bmc1_unsat_core_clauses_time: 0.
% 150.15/150.47
% 150.15/150.47 % ------ Instantiation
% 150.15/150.47
% 150.15/150.47 % inst_num_of_clauses: 3292
% 150.15/150.47 % inst_num_in_passive: 753
% 150.15/150.47 % inst_num_in_active: 1442
% 150.15/150.47 % inst_num_in_unprocessed: 1060
% 150.15/150.47 % inst_num_of_loops: 1499
% 0.20/150.54 % inst_num_of_learning_restarts: 1
% 0.20/150.54 % inst_num_moves_active_passive: 16
% 0.20/150.54 % inst_lit_activity: 303
% 0.20/150.54 % inst_lit_activity_moves: 0
% 0.20/150.54 % inst_num_tautologies: 37
% 0.20/150.54 % inst_num_prop_implied: 0
% 0.20/150.54 % inst_num_existing_simplified: 0
% 0.20/150.54 % inst_num_eq_res_simplified: 0
% 0.20/150.54 % inst_num_child_elim: 0
% 0.20/150.54 % inst_num_of_dismatching_blockings: 6992
% 0.20/150.54 % inst_num_of_non_proper_insts: 7029
% 0.20/150.54 % inst_num_of_duplicates: 2103
% 0.20/150.54 % inst_inst_num_from_inst_to_res: 0
% 0.20/150.54 % inst_dismatching_checking_time: 1.107
% 0.20/150.54
% 0.20/150.54 % ------ Resolution
% 0.20/150.54
% 0.20/150.54 % res_num_of_clauses: 22078
% 0.20/150.54 % res_num_in_passive: 6832
% 0.20/150.54 % res_num_in_active: 15240
% 0.20/150.54 % res_num_of_loops: 15425
% 0.20/150.54 % res_forward_subset_subsumed: 8158
% 0.20/150.54 % res_backward_subset_subsumed: 0
% 0.20/150.54 % res_forward_subsumed: 194
% 0.20/150.54 % res_backward_subsumed: 0
% 0.20/150.54 % res_forward_subsumption_resolution: 0
% 0.20/150.54 % res_backward_subsumption_resolution: 0
% 0.20/150.54 % res_clause_to_clause_subsumption: 73511
% 0.20/150.54 % res_orphan_elimination: 0
% 0.20/150.54 % res_tautology_del: 0
% 0.20/150.54 % res_num_eq_res_simplified: 0
% 0.20/150.54 % res_num_sel_changes: 0
% 0.20/150.54 % res_moves_from_active_to_pass: 0
% 0.20/150.54
% 0.20/150.54 % Status Unknown
% 0.20/150.58 % Orienting using strategy ClausalAll
% 0.20/150.58 % Orientation found
% 0.20/150.58 % 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_92aff8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_448233.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_a6ba65 | grep -v "SZS"
% 150.34/150.61
% 150.34/150.61 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.34/150.61
% 150.34/150.61 %
% 150.34/150.61 % ------ iProver source info
% 150.34/150.61
% 150.34/150.61 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.34/150.61 % git: non_committed_changes: true
% 150.34/150.61 % git: last_make_outside_of_git: true
% 150.34/150.61
% 150.34/150.61 %
% 150.34/150.61 % ------ Input Options
% 150.34/150.61
% 150.34/150.61 % --out_options all
% 150.34/150.61 % --tptp_safe_out true
% 150.34/150.61 % --problem_path ""
% 150.34/150.61 % --include_path ""
% 150.34/150.61 % --clausifier .//eprover
% 150.34/150.61 % --clausifier_options --tstp-format
% 150.34/150.61 % --stdin false
% 150.34/150.61 % --dbg_backtrace false
% 150.34/150.61 % --dbg_dump_prop_clauses false
% 150.34/150.61 % --dbg_dump_prop_clauses_file -
% 150.34/150.61 % --dbg_out_stat false
% 150.34/150.61
% 150.34/150.61 % ------ General Options
% 150.34/150.61
% 150.34/150.61 % --fof false
% 150.34/150.61 % --time_out_real 150.
% 150.34/150.61 % --time_out_prep_mult 0.2
% 150.34/150.61 % --time_out_virtual -1.
% 150.34/150.61 % --schedule none
% 150.34/150.61 % --ground_splitting input
% 150.34/150.61 % --splitting_nvd 16
% 150.34/150.61 % --non_eq_to_eq false
% 150.34/150.61 % --prep_gs_sim true
% 150.34/150.61 % --prep_unflatten false
% 150.34/150.61 % --prep_res_sim true
% 150.34/150.61 % --prep_upred true
% 150.34/150.61 % --res_sim_input true
% 150.34/150.61 % --clause_weak_htbl true
% 150.34/150.61 % --gc_record_bc_elim false
% 150.34/150.61 % --symbol_type_check false
% 150.34/150.61 % --clausify_out false
% 150.34/150.61 % --large_theory_mode false
% 150.34/150.61 % --prep_sem_filter none
% 150.34/150.61 % --prep_sem_filter_out false
% 150.34/150.61 % --preprocessed_out false
% 150.34/150.61 % --sub_typing false
% 150.34/150.61 % --brand_transform false
% 150.34/150.61 % --pure_diseq_elim true
% 150.34/150.61 % --min_unsat_core false
% 150.34/150.61 % --pred_elim true
% 150.34/150.61 % --add_important_lit false
% 150.34/150.61 % --soft_assumptions false
% 150.34/150.61 % --reset_solvers false
% 150.34/150.61 % --bc_imp_inh []
% 150.34/150.61 % --conj_cone_tolerance 1.5
% 150.34/150.61 % --prolific_symb_bound 500
% 150.34/150.61 % --lt_threshold 2000
% 150.34/150.61
% 150.34/150.61 % ------ SAT Options
% 150.34/150.61
% 150.34/150.61 % --sat_mode false
% 150.34/150.61 % --sat_fm_restart_options ""
% 150.34/150.61 % --sat_gr_def false
% 150.34/150.61 % --sat_epr_types true
% 150.34/150.61 % --sat_non_cyclic_types false
% 150.34/150.61 % --sat_finite_models false
% 150.34/150.61 % --sat_fm_lemmas false
% 150.34/150.61 % --sat_fm_prep false
% 150.34/150.61 % --sat_fm_uc_incr true
% 150.34/150.61 % --sat_out_model small
% 150.34/150.61 % --sat_out_clauses false
% 150.34/150.61
% 150.34/150.61 % ------ QBF Options
% 150.34/150.61
% 150.34/150.61 % --qbf_mode false
% 150.34/150.61 % --qbf_elim_univ true
% 150.34/150.61 % --qbf_sk_in true
% 150.34/150.61 % --qbf_pred_elim true
% 150.34/150.61 % --qbf_split 32
% 150.34/150.61
% 150.34/150.61 % ------ BMC1 Options
% 150.34/150.61
% 150.34/150.61 % --bmc1_incremental false
% 150.34/150.61 % --bmc1_axioms reachable_all
% 150.34/150.61 % --bmc1_min_bound 0
% 150.34/150.61 % --bmc1_max_bound -1
% 150.34/150.61 % --bmc1_max_bound_default -1
% 150.34/150.61 % --bmc1_symbol_reachability true
% 150.34/150.61 % --bmc1_property_lemmas false
% 150.34/150.61 % --bmc1_k_induction false
% 150.34/150.61 % --bmc1_non_equiv_states false
% 150.34/150.61 % --bmc1_deadlock false
% 150.34/150.61 % --bmc1_ucm false
% 150.34/150.61 % --bmc1_add_unsat_core none
% 150.34/150.61 % --bmc1_unsat_core_children false
% 150.34/150.61 % --bmc1_unsat_core_extrapolate_axioms false
% 150.34/150.61 % --bmc1_out_stat full
% 150.34/150.61 % --bmc1_ground_init false
% 150.34/150.61 % --bmc1_pre_inst_next_state false
% 150.34/150.61 % --bmc1_pre_inst_state false
% 150.34/150.61 % --bmc1_pre_inst_reach_state false
% 150.34/150.61 % --bmc1_out_unsat_core false
% 150.34/150.61 % --bmc1_aig_witness_out false
% 150.34/150.61 % --bmc1_verbose false
% 150.34/150.61 % --bmc1_dump_clauses_tptp false
% 150.34/150.61 % --bmc1_dump_unsat_core_tptp false
% 150.34/150.61 % --bmc1_dump_file -
% 150.34/150.61 % --bmc1_ucm_expand_uc_limit 128
% 150.34/150.61 % --bmc1_ucm_n_expand_iterations 6
% 150.34/150.61 % --bmc1_ucm_extend_mode 1
% 150.34/150.61 % --bmc1_ucm_init_mode 2
% 150.34/150.61 % --bmc1_ucm_cone_mode none
% 150.34/150.61 % --bmc1_ucm_reduced_relation_type 0
% 150.34/150.61 % --bmc1_ucm_relax_model 4
% 150.34/150.61 % --bmc1_ucm_full_tr_after_sat true
% 150.34/150.61 % --bmc1_ucm_expand_neg_assumptions false
% 150.34/150.61 % --bmc1_ucm_layered_model none
% 150.34/150.61 % --bmc1_ucm_max_lemma_size 10
% 150.34/150.61
% 150.34/150.61 % ------ AIG Options
% 150.34/150.61
% 150.34/150.61 % --aig_mode false
% 150.34/150.61
% 150.34/150.61 % ------ Instantiation Options
% 150.34/150.61
% 150.34/150.61 % --instantiation_flag true
% 150.34/150.61 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.34/150.61 % --inst_solver_per_active 750
% 150.34/150.61 % --inst_solver_calls_frac 0.5
% 150.34/150.61 % --inst_passive_queue_type priority_queues
% 150.34/150.61 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.34/150.61 % --inst_passive_queues_freq [25;2]
% 150.34/150.61 % --inst_dismatching true
% 150.34/150.61 % --inst_eager_unprocessed_to_passive true
% 150.34/150.61 % --inst_prop_sim_given true
% 150.34/150.61 % --inst_prop_sim_new false
% 150.34/150.61 % --inst_orphan_elimination true
% 150.34/150.61 % --inst_learning_loop_flag true
% 150.34/150.61 % --inst_learning_start 3000
% 150.34/150.61 % --inst_learning_factor 2
% 150.34/150.61 % --inst_start_prop_sim_after_learn 3
% 150.34/150.61 % --inst_sel_renew solver
% 150.34/150.61 % --inst_lit_activity_flag true
% 150.34/150.61 % --inst_out_proof true
% 150.34/150.61
% 150.34/150.61 % ------ Resolution Options
% 150.34/150.61
% 150.34/150.61 % --resolution_flag true
% 150.34/150.61 % --res_lit_sel kbo_max
% 150.34/150.61 % --res_to_prop_solver none
% 150.34/150.61 % --res_prop_simpl_new false
% 150.34/150.61 % --res_prop_simpl_given false
% 150.34/150.61 % --res_passive_queue_type priority_queues
% 150.34/150.61 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.34/150.61 % --res_passive_queues_freq [15;5]
% 150.34/150.61 % --res_forward_subs full
% 150.34/150.61 % --res_backward_subs full
% 150.34/150.61 % --res_forward_subs_resolution true
% 150.34/150.61 % --res_backward_subs_resolution true
% 150.34/150.61 % --res_orphan_elimination false
% 150.34/150.61 % --res_time_limit 1000.
% 150.34/150.61 % --res_out_proof true
% 150.34/150.61 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_92aff8.s
% 150.34/150.61 % --modulo true
% 150.34/150.61
% 150.34/150.61 % ------ Combination Options
% 150.34/150.61
% 150.34/150.61 % --comb_res_mult 1000
% 150.34/150.61 % --comb_inst_mult 300
% 150.34/150.61 % ------
% 150.34/150.61
% 150.34/150.61 % ------ Parsing...% successful
% 150.34/150.61
% 150.34/150.61 % ------ 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.34/150.61
% 150.34/150.61 % ------ Proving...
% 150.34/150.61 % ------ Problem Properties
% 150.34/150.61
% 150.34/150.61 %
% 150.34/150.61 % EPR false
% 150.34/150.61 % Horn true
% 150.34/150.61 % Has equality false
% 150.34/150.61
% 150.34/150.61 % % ------ Input Options Time Limit: Unbounded
% 150.34/150.61
% 150.34/150.61
% 150.34/150.61 % % ------ Current options:
% 150.34/150.61
% 150.34/150.61 % ------ Input Options
% 150.34/150.61
% 150.34/150.61 % --out_options all
% 150.34/150.61 % --tptp_safe_out true
% 150.34/150.61 % --problem_path ""
% 150.34/150.61 % --include_path ""
% 150.34/150.61 % --clausifier .//eprover
% 150.34/150.61 % --clausifier_options --tstp-format
% 150.34/150.61 % --stdin false
% 150.34/150.61 % --dbg_backtrace false
% 150.34/150.61 % --dbg_dump_prop_clauses false
% 150.34/150.61 % --dbg_dump_prop_clauses_file -
% 150.34/150.61 % --dbg_out_stat false
% 150.34/150.61
% 150.34/150.61 % ------ General Options
% 150.34/150.61
% 150.34/150.61 % --fof false
% 150.34/150.61 % --time_out_real 150.
% 150.34/150.61 % --time_out_prep_mult 0.2
% 150.34/150.61 % --time_out_virtual -1.
% 150.34/150.61 % --schedule none
% 150.34/150.61 % --ground_splitting input
% 150.34/150.61 % --splitting_nvd 16
% 150.34/150.61 % --non_eq_to_eq false
% 150.34/150.61 % --prep_gs_sim true
% 150.34/150.61 % --prep_unflatten false
% 150.34/150.61 % --prep_res_sim true
% 150.34/150.61 % --prep_upred true
% 150.34/150.61 % --res_sim_input true
% 150.34/150.61 % --clause_weak_htbl true
% 150.34/150.61 % --gc_record_bc_elim false
% 150.34/150.61 % --symbol_type_check false
% 150.34/150.61 % --clausify_out false
% 150.34/150.61 % --large_theory_mode false
% 150.34/150.61 % --prep_sem_filter none
% 150.34/150.61 % --prep_sem_filter_out false
% 150.34/150.61 % --preprocessed_out false
% 150.34/150.61 % --sub_typing false
% 150.34/150.61 % --brand_transform false
% 150.34/150.61 % --pure_diseq_elim true
% 150.34/150.61 % --min_unsat_core false
% 150.34/150.61 % --pred_elim true
% 150.34/150.61 % --add_important_lit false
% 150.34/150.61 % --soft_assumptions false
% 150.34/150.61 % --reset_solvers false
% 150.34/150.61 % --bc_imp_inh []
% 150.34/150.61 % --conj_cone_tolerance 1.5
% 150.34/150.61 % --prolific_symb_bound 500
% 150.34/150.61 % --lt_threshold 2000
% 150.34/150.61
% 150.34/150.61 % ------ SAT Options
% 150.34/150.61
% 150.34/150.61 % --sat_mode false
% 150.34/150.61 % --sat_fm_restart_options ""
% 150.34/150.61 % --sat_gr_def false
% 150.34/150.61 % --sat_epr_types true
% 150.34/150.61 % --sat_non_cyclic_types false
% 150.34/150.61 % --sat_finite_models false
% 150.34/150.61 % --sat_fm_lemmas false
% 150.34/150.61 % --sat_fm_prep false
% 150.34/150.61 % --sat_fm_uc_incr true
% 150.34/150.61 % --sat_out_model small
% 150.34/150.61 % --sat_out_clauses false
% 150.34/150.61
% 150.34/150.61 % ------ QBF Options
% 150.34/150.61
% 150.34/150.61 % --qbf_mode false
% 150.34/150.61 % --qbf_elim_univ true
% 150.34/150.61 % --qbf_sk_in true
% 150.34/150.61 % --qbf_pred_elim true
% 150.34/150.61 % --qbf_split 32
% 150.34/150.61
% 150.34/150.61 % ------ BMC1 Options
% 150.34/150.61
% 150.34/150.61 % --bmc1_incremental false
% 150.34/150.61 % --bmc1_axioms reachable_all
% 150.34/150.61 % --bmc1_min_bound 0
% 150.34/150.61 % --bmc1_max_bound -1
% 150.34/150.61 % --bmc1_max_bound_default -1
% 150.34/150.62 % --bmc1_symbol_reachability true
% 150.34/150.62 % --bmc1_property_lemmas false
% 150.34/150.62 % --bmc1_k_induction false
% 150.34/150.62 % --bmc1_non_equiv_states false
% 150.34/150.62 % --bmc1_deadlock false
% 150.34/150.62 % --bmc1_ucm false
% 150.34/150.62 % --bmc1_add_unsat_core none
% 150.34/150.62 % --bmc1_unsat_core_children false
% 150.34/150.62 % --bmc1_unsat_core_extrapolate_axioms false
% 150.34/150.62 % --bmc1_out_stat full
% 150.34/150.62 % --bmc1_ground_init false
% 150.34/150.62 % --bmc1_pre_inst_next_state false
% 150.34/150.62 % --bmc1_pre_inst_state false
% 150.34/150.62 % --bmc1_pre_inst_reach_state false
% 150.34/150.62 % --bmc1_out_unsat_core false
% 150.34/150.62 % --bmc1_aig_witness_out false
% 150.34/150.62 % --bmc1_verbose false
% 150.34/150.62 % --bmc1_dump_clauses_tptp false
% 150.34/150.62 % --bmc1_dump_unsat_core_tptp false
% 150.34/150.62 % --bmc1_dump_file -
% 150.34/150.62 % --bmc1_ucm_expand_uc_limit 128
% 150.34/150.62 % --bmc1_ucm_n_expand_iterations 6
% 150.34/150.62 % --bmc1_ucm_extend_mode 1
% 150.34/150.62 % --bmc1_ucm_init_mode 2
% 150.34/150.62 % --bmc1_ucm_cone_mode none
% 150.34/150.62 % --bmc1_ucm_reduced_relation_type 0
% 150.34/150.62 % --bmc1_ucm_relax_model 4
% 150.34/150.62 % --bmc1_ucm_full_tr_after_sat true
% 150.34/150.62 % --bmc1_ucm_expand_neg_assumptions false
% 150.34/150.62 % --bmc1_ucm_layered_model none
% 150.34/150.62 % --bmc1_ucm_max_lemma_size 10
% 150.34/150.62
% 150.34/150.62 % ------ AIG Options
% 150.34/150.62
% 150.34/150.62 % --aig_mode false
% 150.34/150.62
% 150.34/150.62 % ------ Instantiation Options
% 150.34/150.62
% 150.34/150.62 % --instantiation_flag true
% 150.34/150.62 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.34/150.62 % --inst_solver_per_active 750
% 150.34/150.62 % --inst_solver_calls_frac 0.5
% 150.34/150.62 % --inst_passive_queue_type priority_queues
% 150.34/150.62 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.34/150.62 % --inst_passive_queues_freq [25;2]
% 150.34/150.62 % --inst_dismatching true
% 150.34/150.62 % --inst_eager_unprocessed_to_passive true
% 150.34/150.62 % --inst_prop_sim_given true
% 268.87/269.16 % --inst_prop_sim_new false
% 268.87/269.16 % --inst_orphan_elimination true
% 268.87/269.16 % --inst_learning_loop_flag true
% 268.87/269.16 % --inst_learning_start 3000
% 268.87/269.16 % --inst_learning_factor 2
% 268.87/269.16 % --inst_start_prop_sim_after_learn 3
% 268.87/269.16 % --inst_sel_renew solver
% 268.87/269.16 % --inst_lit_activity_flag true
% 268.87/269.16 % --inst_out_proof true
% 268.87/269.16
% 268.87/269.16 % ------ Resolution Options
% 268.87/269.16
% 268.87/269.16 % --resolution_flag true
% 268.87/269.16 % --res_lit_sel kbo_max
% 268.87/269.16 % --res_to_prop_solver none
% 268.87/269.16 % --res_prop_simpl_new false
% 268.87/269.16 % --res_prop_simpl_given false
% 268.87/269.16 % --res_passive_queue_type priority_queues
% 268.87/269.16 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 268.87/269.16 % --res_passive_queues_freq [15;5]
% 268.87/269.16 % --res_forward_subs full
% 268.87/269.16 % --res_backward_subs full
% 268.87/269.16 % --res_forward_subs_resolution true
% 268.87/269.16 % --res_backward_subs_resolution true
% 268.87/269.16 % --res_orphan_elimination false
% 268.87/269.16 % --res_time_limit 1000.
% 268.87/269.16 % --res_out_proof true
% 268.87/269.16 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_92aff8.s
% 268.87/269.16 % --modulo true
% 268.87/269.16
% 268.87/269.16 % ------ Combination Options
% 268.87/269.16
% 268.87/269.16 % --comb_res_mult 1000
% 268.87/269.16 % --comb_inst_mult 300
% 268.87/269.16 % ------
% 268.87/269.16
% 268.87/269.16
% 268.87/269.16
% 268.87/269.16 % ------ Proving...
% 268.87/269.16 %
% 268.87/269.16
% 268.87/269.16
% 268.87/269.16 % ------ Statistics
% 268.87/269.16
% 268.87/269.16 % ------ General
% 268.87/269.16
% 268.87/269.16 % num_of_input_clauses: 14
% 268.87/269.16 % num_of_input_neg_conjectures: 1
% 268.87/269.16 % num_of_splits: 0
% 268.87/269.16 % num_of_split_atoms: 0
% 268.87/269.16 % num_of_sem_filtered_clauses: 0
% 268.87/269.16 % num_of_subtypes: 0
% 268.87/269.16 % monotx_restored_types: 0
% 268.87/269.16 % sat_num_of_epr_types: 0
% 268.87/269.16 % sat_num_of_non_cyclic_types: 0
% 268.87/269.16 % sat_guarded_non_collapsed_types: 0
% 268.87/269.16 % is_epr: 0
% 268.87/269.16 % is_horn: 1
% 268.87/269.16 % has_eq: 0
% 268.87/269.16 % num_pure_diseq_elim: 0
% 268.87/269.16 % simp_replaced_by: 0
% 268.87/269.16 % res_preprocessed: 2
% 268.87/269.16 % prep_upred: 0
% 268.87/269.16 % prep_unflattend: 0
% 268.87/269.16 % pred_elim_cands: 0
% 268.87/269.16 % pred_elim: 0
% 268.87/269.16 % pred_elim_cl: 0
% 268.87/269.16 % pred_elim_cycles: 0
% 268.87/269.16 % forced_gc_time: 0
% 268.87/269.16 % gc_basic_clause_elim: 0
% 268.87/269.16 % parsing_time: 0.
% 268.87/269.16 % sem_filter_time: 0.
% 268.87/269.16 % pred_elim_time: 0.
% 268.87/269.16 % out_proof_time: 0.009
% 268.87/269.16 % monotx_time: 0.
% 268.87/269.16 % subtype_inf_time: 0.
% 268.87/269.16 % unif_index_cands_time: 0.55
% 268.87/269.16 % unif_index_add_time: 0.312
% 268.87/269.16 % total_time: 118.572
% 268.87/269.16 % num_of_symbols: 32
% 268.87/269.16 % num_of_terms: 548900
% 268.87/269.16
% 268.87/269.16 % ------ Propositional Solver
% 268.87/269.16
% 268.87/269.16 % prop_solver_calls: 45
% 268.87/269.16 % prop_fast_solver_calls: 3
% 268.87/269.16 % prop_num_of_clauses: 24807
% 268.87/269.16 % prop_preprocess_simplified: 31842
% 268.87/269.16 % prop_fo_subsumed: 0
% 268.87/269.16 % prop_solver_time: 0.058
% 268.87/269.16 % prop_fast_solver_time: 0.
% 268.87/269.16 % prop_unsat_core_time: 0.005
% 268.87/269.16
% 268.87/269.16 % ------ QBF
% 268.87/269.16
% 268.87/269.16 % qbf_q_res: 0
% 268.87/269.16 % qbf_num_tautologies: 0
% 268.87/269.16 % qbf_prep_cycles: 0
% 268.87/269.16
% 268.87/269.16 % ------ BMC1
% 268.87/269.16
% 268.87/269.16 % bmc1_current_bound: -1
% 268.87/269.16 % bmc1_last_solved_bound: -1
% 268.87/269.16 % bmc1_unsat_core_size: -1
% 268.87/269.16 % bmc1_unsat_core_parents_size: -1
% 268.87/269.16 % bmc1_merge_next_fun: 0
% 268.87/269.16 % bmc1_unsat_core_clauses_time: 0.
% 268.87/269.16
% 268.87/269.16 % ------ Instantiation
% 268.87/269.16
% 268.87/269.16 % inst_num_of_clauses: 368
% 268.87/269.16 % inst_num_in_passive: 28
% 268.87/269.16 % inst_num_in_active: 229
% 268.87/269.16 % inst_num_in_unprocessed: 108
% 268.87/269.16 % inst_num_of_loops: 237
% 150.34/269.21 % inst_num_of_learning_restarts: 2
% 150.34/269.21 % inst_num_moves_active_passive: 2
% 150.34/269.21 % inst_lit_activity: 59
% 150.34/269.21 % inst_lit_activity_moves: 0
% 150.34/269.21 % inst_num_tautologies: 1
% 150.34/269.21 % inst_num_prop_implied: 0
% 150.34/269.21 % inst_num_existing_simplified: 0
% 150.34/269.21 % inst_num_eq_res_simplified: 0
% 150.34/269.21 % inst_num_child_elim: 0
% 150.34/269.21 % inst_num_of_dismatching_blockings: 604
% 150.34/269.21 % inst_num_of_non_proper_insts: 672
% 150.34/269.21 % inst_num_of_duplicates: 266
% 150.34/269.21 % inst_inst_num_from_inst_to_res: 0
% 150.34/269.21 % inst_dismatching_checking_time: 1.282
% 150.34/269.21
% 150.34/269.21 % ------ Resolution
% 150.34/269.21
% 150.34/269.21 % res_num_of_clauses: 40499
% 150.34/269.21 % res_num_in_passive: 20778
% 150.34/269.21 % res_num_in_active: 19718
% 150.34/269.21 % res_num_of_loops: 31000
% 150.34/269.21 % res_forward_subset_subsumed: 12996
% 150.34/269.21 % res_backward_subset_subsumed: 0
% 150.34/269.21 % res_forward_subsumed: 5594
% 150.34/269.21 % res_backward_subsumed: 5698
% 150.34/269.21 % res_forward_subsumption_resolution: 4
% 150.34/269.21 % res_backward_subsumption_resolution: 0
% 150.34/269.21 % res_clause_to_clause_subsumption: 1281418
% 150.34/269.21 % res_orphan_elimination: 0
% 150.34/269.21 % res_tautology_del: 0
% 150.34/269.21 % res_num_eq_res_simplified: 0
% 150.34/269.21 % res_num_sel_changes: 0
% 150.34/269.21 % res_moves_from_active_to_pass: 0
% 150.34/269.21
% 150.34/269.21 % Status Unsatisfiable
% 150.34/269.21 % SZS status Unsatisfiable
% 150.34/269.21 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------