TSTP Solution File: LCL638+1.001 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.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:36:47 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 9
% Syntax : Number of formulae : 104 ( 19 unt; 0 def)
% Number of atoms : 460 ( 0 equ)
% Maximal formula atoms : 54 ( 4 avg)
% Number of connectives : 703 ( 347 ~; 335 |; 21 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 223 ( 0 sgn 53 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
& ~ p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) ) )
& ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ $true ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) ),
file('<stdin>',main) ).
fof(c_0_1,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
& ~ p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) ) )
& ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] : ~ r1(X2,X1) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_0])]) ).
fof(c_0_2,negated_conjecture,
! [X4,X5,X7,X8,X10,X11,X12,X15,X16,X17,X18,X20,X23] :
( ( r1(X5,esk2_2(X4,X5))
| ~ r1(X4,X5)
| p1(X4)
| ~ r1(esk1_0,X4) )
& ( ~ p1(esk2_2(X4,X5))
| ~ r1(X4,X5)
| p1(X4)
| ~ r1(esk1_0,X4) )
& ( r1(X8,esk3_2(X7,X8))
| ~ r1(X7,X8)
| ~ p1(X7)
| ~ r1(esk1_0,X7) )
& ( p1(esk3_2(X7,X8))
| ~ r1(X7,X8)
| ~ p1(X7)
| ~ r1(esk1_0,X7) )
& ( r1(X10,esk5_1(X10))
| r1(X12,esk4_3(X10,X11,X12))
| ~ r1(X11,X12)
| ~ r1(X10,X11)
| ~ r1(esk1_0,X10) )
& ( ~ r1(esk5_1(X10),X15)
| ~ p1(X15)
| r1(X12,esk4_3(X10,X11,X12))
| ~ r1(X11,X12)
| ~ r1(X10,X11)
| ~ r1(esk1_0,X10) )
& ( r1(X10,esk5_1(X10))
| p1(esk4_3(X10,X11,X12))
| ~ r1(X11,X12)
| ~ r1(X10,X11)
| ~ r1(esk1_0,X10) )
& ( ~ r1(esk5_1(X10),X15)
| ~ p1(X15)
| p1(esk4_3(X10,X11,X12))
| ~ r1(X11,X12)
| ~ r1(X10,X11)
| ~ r1(esk1_0,X10) )
& ( r1(X16,esk6_1(X16))
| ~ r1(X16,X17)
| ~ r1(X17,X18)
| p1(X18)
| ~ r1(esk1_0,X16) )
& ( ~ p1(esk6_1(X16))
| ~ r1(X16,X17)
| ~ r1(X17,X18)
| p1(X18)
| ~ r1(esk1_0,X16) )
& ( ~ r1(esk1_0,X20)
| r1(X20,esk7_1(X20)) )
& r1(esk1_0,esk8_0)
& ~ p1(esk8_0)
& ( ~ r1(esk8_0,X23)
| p1(X23) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( r1(X3,esk4_3(X1,X2,X3))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ p1(X4)
| ~ r1(esk5_1(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( p1(esk4_3(X1,X2,X3))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ p1(X4)
| ~ r1(esk5_1(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( r1(X3,esk4_3(X1,X2,X3))
| r1(X1,esk5_1(X1))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( p1(esk4_3(X1,X2,X3))
| r1(X1,esk5_1(X1))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( p1(X1)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ p1(esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( p1(X2)
| r1(X1,esk6_1(X1))
| ~ r1(esk1_0,X1)
| ~ r1(X3,X2)
| ~ r1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( r1(X2,esk3_2(X1,X2))
| ~ r1(esk1_0,X1)
| ~ p1(X1)
| ~ r1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( p1(X1)
| r1(X2,esk2_2(X1,X2))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( p1(X2)
| ~ r1(esk1_0,X1)
| ~ r1(X3,X2)
| ~ r1(X1,X3)
| ~ p1(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( p1(esk3_2(X1,X2))
| ~ r1(esk1_0,X1)
| ~ p1(X1)
| ~ r1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
r1(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
~ p1(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
( r1(X3,esk4_3(X1,X2,X3))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ p1(X4)
| ~ r1(esk5_1(X1),X4) ),
c_0_3,
[final] ).
cnf(c_0_18,negated_conjecture,
( p1(esk4_3(X1,X2,X3))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ p1(X4)
| ~ r1(esk5_1(X1),X4) ),
c_0_4,
[final] ).
cnf(c_0_19,negated_conjecture,
( r1(X3,esk4_3(X1,X2,X3))
| r1(X1,esk5_1(X1))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3) ),
c_0_5,
[final] ).
cnf(c_0_20,negated_conjecture,
( p1(esk4_3(X1,X2,X3))
| r1(X1,esk5_1(X1))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3) ),
c_0_6,
[final] ).
cnf(c_0_21,negated_conjecture,
( p1(X1)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ p1(esk2_2(X1,X2)) ),
c_0_7,
[final] ).
cnf(c_0_22,negated_conjecture,
( p1(X2)
| r1(X1,esk6_1(X1))
| ~ r1(esk1_0,X1)
| ~ r1(X3,X2)
| ~ r1(X1,X3) ),
c_0_8,
[final] ).
cnf(c_0_23,negated_conjecture,
( r1(X2,esk3_2(X1,X2))
| ~ r1(esk1_0,X1)
| ~ p1(X1)
| ~ r1(X1,X2) ),
c_0_9,
[final] ).
cnf(c_0_24,negated_conjecture,
( p1(X1)
| r1(X2,esk2_2(X1,X2))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2) ),
c_0_10,
[final] ).
cnf(c_0_25,negated_conjecture,
( p1(X2)
| ~ r1(esk1_0,X1)
| ~ r1(X3,X2)
| ~ r1(X1,X3)
| ~ p1(esk6_1(X1)) ),
c_0_11,
[final] ).
cnf(c_0_26,negated_conjecture,
( p1(esk3_2(X1,X2))
| ~ r1(esk1_0,X1)
| ~ p1(X1)
| ~ r1(X1,X2) ),
c_0_12,
[final] ).
cnf(c_0_27,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk1_0,X1) ),
c_0_13,
[final] ).
cnf(c_0_28,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,X1) ),
c_0_14,
[final] ).
cnf(c_0_29,negated_conjecture,
r1(esk1_0,esk8_0),
c_0_15,
[final] ).
cnf(c_0_30,negated_conjecture,
~ p1(esk8_0),
c_0_16,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_5,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| p1(X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94b474.p',c_0_22) ).
cnf(c_36,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| p1(X2) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_87,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| p1(X2) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_104,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| p1(X2) ),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_115,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| p1(X2) ),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_148,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| p1(X2) ),
inference(copy,[status(esa)],[c_115]) ).
cnf(c_7,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk2_2(X0,X1))
| ~ r1(X0,X1)
| p1(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94b474.p',c_0_24) ).
cnf(c_40,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk2_2(X0,X1))
| ~ r1(X0,X1)
| p1(X0) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_89,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk2_2(X0,X1))
| ~ r1(X0,X1)
| p1(X0) ),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_102,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk2_2(X0,X1))
| ~ r1(X0,X1)
| p1(X0) ),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_117,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk2_2(X0,X1))
| ~ r1(X0,X1)
| p1(X0) ),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_152,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk2_2(X0,X1))
| ~ r1(X0,X1)
| p1(X0) ),
inference(copy,[status(esa)],[c_117]) ).
cnf(c_228,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X2)
| ~ r1(X1,X2)
| p1(sk3_esk2_2(X1,X2))
| p1(X1) ),
inference(resolution,[status(thm)],[c_148,c_152]) ).
cnf(c_229,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X2)
| ~ r1(X1,X2)
| p1(sk3_esk2_2(X1,X2))
| p1(X1) ),
inference(rewriting,[status(thm)],[c_228]) ).
cnf(c_4,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ p1(sk3_esk2_2(X0,X1))
| p1(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94b474.p',c_0_21) ).
cnf(c_34,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ p1(sk3_esk2_2(X0,X1))
| p1(X0) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_86,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ p1(sk3_esk2_2(X0,X1))
| p1(X0) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_105,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ p1(sk3_esk2_2(X0,X1))
| p1(X0) ),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_114,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ p1(sk3_esk2_2(X0,X1))
| p1(X0) ),
inference(copy,[status(esa)],[c_105]) ).
cnf(c_146,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ p1(sk3_esk2_2(X0,X1))
| p1(X0) ),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_565,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X2)
| ~ r1(X1,X2)
| p1(X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_229,c_146]) ).
cnf(c_566,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,X2)
| ~ r1(X1,X2)
| p1(X1) ),
inference(rewriting,[status(thm)],[c_565]) ).
cnf(c_10,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94b474.p',c_0_27) ).
cnf(c_46,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_92,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_99,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_92]) ).
cnf(c_120,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_158,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_120]) ).
cnf(c_589,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,sk3_esk7_1(X1))
| p1(X1) ),
inference(resolution,[status(thm)],[c_566,c_158]) ).
cnf(c_590,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| r1(X0,sk3_esk6_1(X0))
| ~ r1(X0,sk3_esk7_1(X1))
| p1(X1) ),
inference(rewriting,[status(thm)],[c_589]) ).
cnf(c_683,plain,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk6_1(X0))
| p1(X0) ),
inference(resolution,[status(thm)],[c_590,c_158]) ).
cnf(c_684,plain,
( ~ r1(sk3_esk1_0,X0)
| r1(X0,sk3_esk6_1(X0))
| p1(X0) ),
inference(rewriting,[status(thm)],[c_683]) ).
cnf(c_11,negated_conjecture,
( ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94b474.p',c_0_28) ).
cnf(c_48,negated_conjecture,
( ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_93,negated_conjecture,
( ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_98,negated_conjecture,
( ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_121,negated_conjecture,
( ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_160,negated_conjecture,
( ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_705,plain,
( ~ r1(sk3_esk1_0,sk3_esk8_0)
| p1(sk3_esk6_1(sk3_esk8_0))
| p1(sk3_esk8_0) ),
inference(resolution,[status(thm)],[c_684,c_160]) ).
cnf(c_706,plain,
( ~ r1(sk3_esk1_0,sk3_esk8_0)
| p1(sk3_esk6_1(sk3_esk8_0))
| p1(sk3_esk8_0) ),
inference(rewriting,[status(thm)],[c_705]) ).
cnf(c_12,negated_conjecture,
~ p1(sk3_esk8_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94b474.p',c_0_30) ).
cnf(c_50,negated_conjecture,
~ p1(sk3_esk8_0),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_94,negated_conjecture,
~ p1(sk3_esk8_0),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_97,negated_conjecture,
~ p1(sk3_esk8_0),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_122,negated_conjecture,
~ p1(sk3_esk8_0),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_162,negated_conjecture,
~ p1(sk3_esk8_0),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_13,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94b474.p',c_0_29) ).
cnf(c_52,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_95,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_96,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_123,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_164,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_123]) ).
cnf(c_710,plain,
p1(sk3_esk6_1(sk3_esk8_0)),
inference(forward_subsumption_resolution,[status(thm)],[c_706,c_162,c_164]) ).
cnf(c_711,plain,
p1(sk3_esk6_1(sk3_esk8_0)),
inference(rewriting,[status(thm)],[c_710]) ).
cnf(c_8,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ p1(sk3_esk6_1(X0))
| p1(X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94b474.p',c_0_25) ).
cnf(c_42,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ p1(sk3_esk6_1(X0))
| p1(X2) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_90,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ p1(sk3_esk6_1(X0))
| p1(X2) ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_101,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ p1(sk3_esk6_1(X0))
| p1(X2) ),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_118,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ p1(sk3_esk6_1(X0))
| p1(X2) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_154,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ p1(sk3_esk6_1(X0))
| p1(X2) ),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_713,plain,
( ~ r1(sk3_esk1_0,sk3_esk8_0)
| ~ r1(sk3_esk8_0,X0)
| ~ r1(X0,X1)
| p1(X1) ),
inference(resolution,[status(thm)],[c_711,c_154]) ).
cnf(c_714,plain,
( ~ r1(sk3_esk1_0,sk3_esk8_0)
| ~ r1(sk3_esk8_0,X0)
| ~ r1(X0,X1)
| p1(X1) ),
inference(rewriting,[status(thm)],[c_713]) ).
cnf(c_719,plain,
( ~ r1(sk3_esk8_0,X0)
| ~ r1(X0,X1)
| p1(X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_714,c_164]) ).
cnf(c_720,plain,
( ~ r1(sk3_esk8_0,X0)
| ~ r1(X0,X1)
| p1(X1) ),
inference(rewriting,[status(thm)],[c_719]) ).
cnf(c_742,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| ~ r1(X0,X1)
| p1(sk3_esk2_2(X0,X1))
| p1(X0) ),
inference(resolution,[status(thm)],[c_720,c_152]) ).
cnf(c_743,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| ~ r1(X0,X1)
| p1(sk3_esk2_2(X0,X1))
| p1(X0) ),
inference(rewriting,[status(thm)],[c_742]) ).
cnf(c_761,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| ~ r1(X0,X1)
| p1(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_743,c_146]) ).
cnf(c_762,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| ~ r1(X0,X1)
| p1(X0) ),
inference(rewriting,[status(thm)],[c_761]) ).
cnf(c_787,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,sk3_esk7_1(X0))
| p1(X0) ),
inference(resolution,[status(thm)],[c_762,c_158]) ).
cnf(c_788,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,sk3_esk7_1(X0))
| p1(X0) ),
inference(rewriting,[status(thm)],[c_787]) ).
cnf(c_799,plain,
( ~ r1(sk3_esk1_0,sk3_esk8_0)
| p1(sk3_esk8_0) ),
inference(resolution,[status(thm)],[c_788,c_158]) ).
cnf(c_800,plain,
( ~ r1(sk3_esk1_0,sk3_esk8_0)
| p1(sk3_esk8_0) ),
inference(rewriting,[status(thm)],[c_799]) ).
cnf(c_803,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_800,c_162,c_164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 09:54:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.39 % FOF problem with conjecture
% 0.12/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_031677.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_94b474.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_53c221 | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 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
% 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_031677.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 false
% 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
% 0.19/0.45 % --inst_prop_sim_new false
% 0.19/0.45 % --inst_orphan_elimination true
% 0.19/0.45 % --inst_learning_loop_flag true
% 0.19/0.45 % --inst_learning_start 3000
% 0.19/0.45 % --inst_learning_factor 2
% 0.19/0.45 % --inst_start_prop_sim_after_learn 3
% 0.19/0.45 % --inst_sel_renew solver
% 0.19/0.45 % --inst_lit_activity_flag true
% 0.19/0.45 % --inst_out_proof true
% 0.19/0.45
% 0.19/0.45 % ------ Resolution Options
% 0.19/0.45
% 0.19/0.45 % --resolution_flag true
% 0.19/0.45 % --res_lit_sel kbo_max
% 0.19/0.45 % --res_to_prop_solver none
% 0.19/0.45 % --res_prop_simpl_new false
% 0.19/0.45 % --res_prop_simpl_given false
% 0.19/0.45 % --res_passive_queue_type priority_queues
% 0.19/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.45 % --res_passive_queues_freq [15;5]
% 0.19/0.45 % --res_forward_subs full
% 0.19/0.45 % --res_backward_subs full
% 0.19/0.45 % --res_forward_subs_resolution true
% 0.19/0.45 % --res_backward_subs_resolution true
% 0.19/0.45 % --res_orphan_elimination false
% 0.19/0.45 % --res_time_limit 1000.
% 0.19/0.45 % --res_out_proof true
% 0.19/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_031677.s
% 0.19/0.45 % --modulo true
% 0.19/0.45
% 0.19/0.45 % ------ Combination Options
% 0.19/0.45
% 0.19/0.45 % --comb_res_mult 1000
% 0.19/0.45 % --comb_inst_mult 300
% 0.19/0.45 % ------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 % ------ Proving...
% 0.19/0.45 %
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 % Resolution empty clause
% 0.19/0.45
% 0.19/0.45 % ------ Statistics
% 0.19/0.45
% 0.19/0.45 % ------ General
% 0.19/0.45
% 0.19/0.45 % num_of_input_clauses: 14
% 0.19/0.45 % num_of_input_neg_conjectures: 14
% 0.19/0.45 % num_of_splits: 0
% 0.19/0.45 % num_of_split_atoms: 0
% 0.19/0.45 % num_of_sem_filtered_clauses: 0
% 0.19/0.45 % num_of_subtypes: 0
% 0.19/0.45 % monotx_restored_types: 0
% 0.19/0.45 % sat_num_of_epr_types: 0
% 0.19/0.45 % sat_num_of_non_cyclic_types: 0
% 0.19/0.45 % sat_guarded_non_collapsed_types: 0
% 0.19/0.45 % is_epr: 0
% 0.19/0.45 % is_horn: 0
% 0.19/0.45 % has_eq: 0
% 0.19/0.45 % num_pure_diseq_elim: 0
% 0.19/0.45 % simp_replaced_by: 0
% 0.19/0.45 % res_preprocessed: 28
% 0.19/0.45 % prep_upred: 0
% 0.19/0.45 % prep_unflattend: 0
% 0.19/0.45 % pred_elim_cands: 0
% 0.19/0.45 % pred_elim: 0
% 0.19/0.45 % pred_elim_cl: 0
% 0.19/0.45 % pred_elim_cycles: 0
% 0.19/0.45 % forced_gc_time: 0
% 0.19/0.45 % gc_basic_clause_elim: 0
% 0.19/0.45 % parsing_time: 0.
% 0.19/0.45 % sem_filter_time: 0.
% 0.19/0.45 % pred_elim_time: 0.
% 0.19/0.45 % out_proof_time: 0.003
% 0.19/0.45 % monotx_time: 0.
% 0.19/0.45 % subtype_inf_time: 0.
% 0.19/0.45 % unif_index_cands_time: 0.
% 0.19/0.45 % unif_index_add_time: 0.
% 0.19/0.45 % total_time: 0.045
% 0.19/0.45 % num_of_symbols: 35
% 0.19/0.45 % num_of_terms: 400
% 0.19/0.45
% 0.19/0.45 % ------ Propositional Solver
% 0.19/0.45
% 0.19/0.45 % prop_solver_calls: 1
% 0.19/0.45 % prop_fast_solver_calls: 162
% 0.19/0.45 % prop_num_of_clauses: 26
% 0.19/0.45 % prop_preprocess_simplified: 234
% 0.19/0.45 % prop_fo_subsumed: 0
% 0.19/0.45 % prop_solver_time: 0.
% 0.19/0.45 % prop_fast_solver_time: 0.
% 0.19/0.45 % prop_unsat_core_time: 0.
% 0.19/0.45
% 0.19/0.45 % ------ QBF
% 0.19/0.45
% 0.19/0.45 % qbf_q_res: 0
% 0.19/0.45 % qbf_num_tautologies: 0
% 0.19/0.45 % qbf_prep_cycles: 0
% 0.19/0.45
% 0.19/0.45 % ------ BMC1
% 0.19/0.45
% 0.19/0.45 % bmc1_current_bound: -1
% 0.19/0.45 % bmc1_last_solved_bound: -1
% 0.19/0.45 % bmc1_unsat_core_size: -1
% 0.19/0.45 % bmc1_unsat_core_parents_size: -1
% 0.19/0.45 % bmc1_merge_next_fun: 0
% 0.19/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.19/0.45
% 0.19/0.45 % ------ Instantiation
% 0.19/0.45
% 0.19/0.45 % inst_num_of_clauses: 14
% 0.19/0.45 % inst_num_in_passive: 0
% 0.19/0.45 % inst_num_in_active: 0
% 0.19/0.45 % inst_num_in_unprocessed: 14
% 0.19/0.45 % inst_num_of_loops: 0
% 0.19/0.45 % inst_num_of_learning_restarts: 0
% 0.19/0.45 % inst_num_moves_active_passive: 0
% 0.19/0.45 % inst_lit_activity: 0
% 0.19/0.45 % inst_lit_activity_moves: 0
% 0.19/0.45 % inst_num_tautologies: 0
% 0.19/0.45 % inst_num_prop_implied: 0
% 0.19/0.45 % inst_num_existing_simplified: 0
% 0.19/0.45 % inst_num_eq_res_simplified: 0
% 0.19/0.45 % inst_num_child_elim: 0
% 0.19/0.45 % inst_num_of_dismatching_blockings: 0
% 0.19/0.45 % inst_num_of_non_proper_insts: 0
% 0.19/0.45 % inst_num_of_duplicates: 0
% 0.19/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.19/0.45 % inst_dismatching_checking_time: 0.
% 0.19/0.45
% 0.19/0.45 % ------ Resolution
% 0.19/0.45
% 0.19/0.45 % res_num_of_clauses: 138
% 0.19/0.45 % res_num_in_passive: 101
% 0.19/0.45 % res_num_in_active: 36
% 0.19/0.45 % res_num_of_loops: 50
% 0.19/0.45 % res_forward_subset_subsumed: 6
% 0.19/0.45 % res_backward_subset_subsumed: 2
% 0.19/0.45 % res_forward_subsumed: 9
% 0.19/0.45 % res_backward_subsumed: 2
% 0.19/0.45 % res_forward_subsumption_resolution: 17
% 0.19/0.45 % res_backward_subsumption_resolution: 0
% 0.19/0.45 % res_clause_to_clause_subsumption: 265
% 0.19/0.45 % res_orphan_elimination: 0
% 0.19/0.45 % res_tautology_del: 0
% 0.19/0.45 % res_num_eq_res_simplified: 0
% 0.19/0.45 % res_num_sel_changes: 0
% 0.19/0.45 % res_moves_from_active_to_pass: 0
% 0.19/0.45
% 0.19/0.45 % Status Unsatisfiable
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------