TSTP Solution File: LCL495+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL495+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 09:26:24 EDT 2022
% Result : Theorem 20.85s 3.96s
% Output : CNFRefutation 20.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 24
% Syntax : Number of clauses : 101 ( 59 unt; 0 nHn; 49 RR)
% Number of literals : 157 ( 29 equ; 59 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 145 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_43) ).
cnf(i_0_21,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_21) ).
cnf(i_0_38,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_38) ).
cnf(i_0_52,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_52) ).
cnf(i_0_68,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_68) ).
cnf(i_0_59,plain,
r4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_59) ).
cnf(i_0_64,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_64) ).
cnf(i_0_57,plain,
r2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_57) ).
cnf(i_0_45,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_45) ).
cnf(i_0_22,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_22) ).
cnf(i_0_62,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_62) ).
cnf(i_0_56,plain,
r1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_56) ).
cnf(i_0_66,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_66) ).
cnf(i_0_58,plain,
r3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_58) ).
cnf(i_0_44,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_44) ).
cnf(i_0_55,plain,
op_implies_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_55) ).
cnf(i_0_41,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_41) ).
cnf(i_0_53,plain,
op_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_53) ).
cnf(i_0_42,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_42) ).
cnf(i_0_20,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_20) ).
cnf(i_0_74,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_74) ).
cnf(i_0_71,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_71) ).
cnf(i_0_17,plain,
( equivalence_3
| ~ is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),equiv(esk17_0,esk18_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_17) ).
cnf(i_0_19,negated_conjecture,
~ equivalence_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-85u_ta1y/input.p',i_0_19) ).
cnf(c_0_99,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_43 ).
cnf(c_0_100,plain,
op_implies_and,
i_0_21 ).
cnf(c_0_101,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_102,plain,
modus_ponens,
i_0_52 ).
cnf(c_0_103,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
i_0_68 ).
cnf(c_0_104,plain,
r4,
i_0_59 ).
cnf(c_0_105,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
i_0_64 ).
cnf(c_0_106,plain,
r2,
i_0_57 ).
cnf(c_0_107,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_45 ).
cnf(c_0_108,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100])]) ).
cnf(c_0_109,plain,
op_or,
i_0_22 ).
cnf(c_0_110,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
i_0_62 ).
cnf(c_0_111,plain,
r1,
i_0_56 ).
cnf(c_0_112,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_66 ).
cnf(c_0_113,plain,
r3,
i_0_58 ).
cnf(c_0_114,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102])]) ).
cnf(c_0_115,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]) ).
cnf(c_0_116,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_106])]) ).
cnf(c_0_117,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108]),c_0_109])]) ).
cnf(c_0_118,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_44 ).
cnf(c_0_119,plain,
op_implies_or,
i_0_55 ).
cnf(c_0_120,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_111])]) ).
cnf(c_0_121,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_113])]) ).
cnf(c_0_122,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_123,plain,
is_a_theorem(or(X1,or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_124,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_41 ).
cnf(c_0_125,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_119])]) ).
cnf(c_0_126,plain,
op_and,
i_0_53 ).
cnf(c_0_127,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_114,c_0_120]) ).
cnf(c_0_128,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_114,c_0_121]) ).
cnf(c_0_129,plain,
is_a_theorem(or(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_130,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_125]),c_0_126])]) ).
cnf(c_0_131,plain,
( is_a_theorem(not(X1))
| ~ is_a_theorem(implies(X1,not(X1))) ),
inference(spm,[status(thm)],[c_0_127,c_0_125]) ).
cnf(c_0_132,plain,
is_a_theorem(or(or(X1,not(X1)),X2)),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_133,plain,
or(implies(X1,not(X2)),X3) = implies(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_117,c_0_130]) ).
cnf(c_0_134,plain,
implies(and(X1,not(X2)),X3) = or(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_125,c_0_108]) ).
cnf(c_0_135,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_114,c_0_117]) ).
cnf(c_0_136,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(or(X1,not(not(X1)))) ),
inference(spm,[status(thm)],[c_0_131,c_0_117]) ).
cnf(c_0_137,plain,
is_a_theorem(or(implies(X1,X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_125]),c_0_133]),c_0_134]) ).
cnf(c_0_138,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_135,c_0_125]) ).
cnf(c_0_139,plain,
is_a_theorem(not(not(implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_140,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_128,c_0_125]) ).
cnf(c_0_141,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_42 ).
cnf(c_0_142,plain,
op_equiv,
i_0_20 ).
cnf(c_0_143,plain,
or(and(X1,X2),X3) = implies(implies(X1,not(X2)),X3),
inference(spm,[status(thm)],[c_0_125,c_0_130]) ).
cnf(c_0_144,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_145,plain,
is_a_theorem(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_125]),c_0_125]) ).
cnf(c_0_146,plain,
( is_a_theorem(not(X1))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_135,c_0_140]) ).
cnf(c_0_147,plain,
is_a_theorem(implies(implies(X1,not(X1)),not(X1))),
inference(spm,[status(thm)],[c_0_120,c_0_125]) ).
cnf(c_0_148,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_142])]) ).
cnf(c_0_149,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_108]),c_0_143]) ).
cnf(c_0_150,plain,
is_a_theorem(or(X1,implies(or(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_151,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(not(not(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_130]) ).
cnf(c_0_152,plain,
and(implies(X1,not(X2)),or(X2,X1)) = equiv(X1,not(X2)),
inference(spm,[status(thm)],[c_0_148,c_0_117]) ).
cnf(c_0_153,plain,
and(implies(X1,not(not(X2))),X3) = and(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_149]),c_0_130]) ).
cnf(c_0_154,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_125]),c_0_125]) ).
cnf(c_0_155,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_74 ).
cnf(c_0_156,plain,
substitution_of_equivalents,
i_0_71 ).
cnf(c_0_157,plain,
is_a_theorem(equiv(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_139]),c_0_148]) ).
cnf(c_0_158,plain,
equiv(X1,not(not(X2))) = equiv(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_125]),c_0_153]),c_0_148]) ).
cnf(c_0_159,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_154]) ).
cnf(c_0_160,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_156])]) ).
cnf(c_0_161,plain,
is_a_theorem(equiv(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_157,c_0_158]) ).
cnf(c_0_162,plain,
( is_a_theorem(not(implies(X1,X2)))
| ~ is_a_theorem(not(X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_146,c_0_159]) ).
cnf(c_0_163,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_164,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_130]),c_0_163]) ).
cnf(c_0_165,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_164,c_0_148]) ).
cnf(c_0_166,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_160,c_0_165]) ).
cnf(c_0_167,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_121,c_0_125]) ).
cnf(c_0_168,plain,
is_a_theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_121,c_0_125]) ).
cnf(c_0_169,plain,
( equivalence_3
| ~ is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),equiv(esk17_0,esk18_0)))) ),
i_0_17 ).
cnf(c_0_170,negated_conjecture,
~ equivalence_3,
i_0_19 ).
cnf(c_0_171,plain,
implies(implies(implies(X1,X2),not(implies(X2,X1))),X3) = or(equiv(X1,X2),X3),
inference(spm,[status(thm)],[c_0_143,c_0_148]) ).
cnf(c_0_172,plain,
or(X1,not(X2)) = implies(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_168])]) ).
cnf(c_0_173,plain,
~ is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),equiv(esk17_0,esk18_0)))),
inference(sr,[status(thm)],[c_0_169,c_0_170]) ).
cnf(c_0_174,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_171]),c_0_172]) ).
cnf(c_0_175,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_173,c_0_174])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL495+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 : Sat Jul 2 16:51:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 20.85/3.96 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 20.85/3.96 # Version: 2.1pre011
% 20.85/3.96 # Preprocessing time : 0.019 s
% 20.85/3.96
% 20.85/3.96 # Proof found!
% 20.85/3.96 # SZS status Theorem
% 20.85/3.96 # SZS output start CNFRefutation
% See solution above
% 20.85/3.96 # Proof object total steps : 101
% 20.85/3.96 # Proof object clause steps : 77
% 20.85/3.96 # Proof object formula steps : 24
% 20.85/3.96 # Proof object conjectures : 2
% 20.85/3.96 # Proof object clause conjectures : 1
% 20.85/3.96 # Proof object formula conjectures : 1
% 20.85/3.96 # Proof object initial clauses used : 24
% 20.85/3.96 # Proof object initial formulas used : 24
% 20.85/3.96 # Proof object generating inferences : 40
% 20.85/3.96 # Proof object simplifying inferences : 41
% 20.85/3.96 # Training examples: 0 positive, 0 negative
% 20.85/3.96 # Parsed axioms : 74
% 20.85/3.96 # Removed by relevancy pruning/SinE : 0
% 20.85/3.96 # Initial clauses : 74
% 20.85/3.96 # Removed in clause preprocessing : 0
% 20.85/3.96 # Initial clauses in saturation : 74
% 20.85/3.96 # Processed clauses : 4541
% 20.85/3.96 # ...of these trivial : 291
% 20.85/3.96 # ...subsumed : 2974
% 20.85/3.96 # ...remaining for further processing : 1276
% 20.85/3.96 # Other redundant clauses eliminated : 0
% 20.85/3.96 # Clauses deleted for lack of memory : 0
% 20.85/3.96 # Backward-subsumed : 69
% 20.85/3.96 # Backward-rewritten : 433
% 20.85/3.96 # Generated clauses : 121728
% 20.85/3.96 # ...of the previous two non-trivial : 109820
% 20.85/3.96 # Contextual simplify-reflections : 350
% 20.85/3.96 # Paramodulations : 121728
% 20.85/3.96 # Factorizations : 0
% 20.85/3.96 # Equation resolutions : 0
% 20.85/3.96 # Propositional unsat checks : 0
% 20.85/3.96 # Propositional unsat check successes : 0
% 20.85/3.96 # Current number of processed clauses : 774
% 20.85/3.96 # Positive orientable unit clauses : 176
% 20.85/3.96 # Positive unorientable unit clauses: 26
% 20.85/3.96 # Negative unit clauses : 9
% 20.85/3.96 # Non-unit-clauses : 563
% 20.85/3.96 # Current number of unprocessed clauses: 76725
% 20.85/3.96 # ...number of literals in the above : 161816
% 20.85/3.96 # Current number of archived formulas : 0
% 20.85/3.96 # Current number of archived clauses : 502
% 20.85/3.96 # Clause-clause subsumption calls (NU) : 130673
% 20.85/3.96 # Rec. Clause-clause subsumption calls : 128474
% 20.85/3.96 # Non-unit clause-clause subsumptions : 3149
% 20.85/3.96 # Unit Clause-clause subsumption calls : 5896
% 20.85/3.96 # Rewrite failures with RHS unbound : 361
% 20.85/3.96 # BW rewrite match attempts : 7916
% 20.85/3.96 # BW rewrite match successes : 622
% 20.85/3.96 # Condensation attempts : 0
% 20.85/3.96 # Condensation successes : 0
% 20.85/3.96 # Termbank termtop insertions : 1949287
% 20.85/3.96
% 20.85/3.96 # -------------------------------------------------
% 20.85/3.96 # User time : 1.585 s
% 20.85/3.96 # System time : 0.060 s
% 20.85/3.96 # Total time : 1.645 s
% 20.85/3.96 # ...preprocessing : 0.019 s
% 20.85/3.96 # ...main loop : 1.627 s
% 20.85/3.96 # Maximum resident set size: 100428 pages
% 20.85/3.96
%------------------------------------------------------------------------------