TSTP Solution File: LCL122-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL122-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:11:37 EDT 2023
% Result : Unsatisfiable 0.82s 0.62s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 3
% Syntax : Number of clauses : 56 ( 14 unt; 0 nHn; 45 RR)
% Number of literals : 134 ( 0 equ; 112 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 142 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.C0xNHSLhRq/E---3.1_17118.p',condensed_detachment) ).
cnf(lg_2,axiom,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
file('/export/starexec/sandbox2/tmp/tmp.C0xNHSLhRq/E---3.1_17118.p',lg_2) ).
cnf(prove_lg_3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))),
file('/export/starexec/sandbox2/tmp/tmp.C0xNHSLhRq/E---3.1_17118.p',prove_lg_3) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
lg_2 ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))),
prove_lg_3 ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))),a))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))))
| ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))))
| ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(c,e))),a)) ),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_4]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))),a))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))),a))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(c,e))))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(c,f),equivalent(e,f))),equivalent(X2,equivalent(c,e))))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(equivalent(X1,b),a)) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(c,f)),equivalent(X2,equivalent(c,e))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(e,f)),b),a))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a)) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))))
| ~ is_a_theorem(equivalent(equivalent(X2,X4),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(e,f)),b),a))
| ~ is_a_theorem(equivalent(equivalent(X2,c),equivalent(X1,equivalent(c,f))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,e),b),a)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,f),equivalent(e,f)),b),a))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,e),b),a)) ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_21]) ).
cnf(c_0_32,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,f),equivalent(e,f)),b)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,e),b),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_33,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X3,X4))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,f),equivalent(e,f))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,e),b),a))
| ~ is_a_theorem(equivalent(equivalent(X1,b),a)) ),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_35,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_5]),c_0_22])]) ).
cnf(c_0_36,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,e),b),a)),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_37,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X4))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_38,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X1))
| ~ is_a_theorem(equivalent(X2,X4)) ),
inference(spm,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_39,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,e),b)))
| ~ is_a_theorem(equivalent(equivalent(X1,a),X3))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),X3)))
| ~ is_a_theorem(equivalent(X1,X4)) ),
inference(spm,[status(thm)],[c_0_38,c_0_22]) ).
cnf(c_0_41,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,e),b),a),X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,e),b),a),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_4]) ).
cnf(c_0_43,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,e),b),X2),equivalent(a,X2))),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_44,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,e),X2),equivalent(a,equivalent(X2,b)))),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_45,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(equivalent(X2,e),b)))),
inference(spm,[status(thm)],[c_0_44,c_0_24]) ).
cnf(c_0_46,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X4,X3),X1))
| ~ is_a_theorem(equivalent(X4,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_47,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,e),b)),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
~ is_a_theorem(equivalent(X1,a)),
inference(spm,[status(thm)],[c_0_47,c_0_4]) ).
cnf(c_0_49,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,a),X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_37]) ).
cnf(c_0_50,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,a),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_4]) ).
cnf(c_0_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,X2))),
inference(spm,[status(thm)],[c_0_50,c_0_22]) ).
cnf(c_0_52,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_53,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5))))))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_54,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_54,c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL122-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 12:41:16 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.C0xNHSLhRq/E---3.1_17118.p
% 0.82/0.62 # Version: 3.1pre001
% 0.82/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.82/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.82/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.82/0.62 # Starting sh5l with 300s (1) cores
% 0.82/0.62 # sh5l with pid 17230 completed with status 0
% 0.82/0.62 # Result found by sh5l
% 0.82/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.82/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.82/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.82/0.62 # Starting sh5l with 300s (1) cores
% 0.82/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.82/0.62 # Search class: FHUNF-FFSF22-DFFFFFNN
% 0.82/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 181s (1) cores
% 0.82/0.62 # G-E--_208_C18_F1_SE_CS_SP_PS_S00 with pid 17238 completed with status 0
% 0.82/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S00
% 0.82/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.82/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.82/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.82/0.62 # Starting sh5l with 300s (1) cores
% 0.82/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.82/0.62 # Search class: FHUNF-FFSF22-DFFFFFNN
% 0.82/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 181s (1) cores
% 0.82/0.62 # Preprocessing time : 0.001 s
% 0.82/0.62 # Presaturation interreduction done
% 0.82/0.62
% 0.82/0.62 # Proof found!
% 0.82/0.62 # SZS status Unsatisfiable
% 0.82/0.62 # SZS output start CNFRefutation
% See solution above
% 0.82/0.62 # Parsed axioms : 3
% 0.82/0.62 # Removed by relevancy pruning/SinE : 0
% 0.82/0.62 # Initial clauses : 3
% 0.82/0.62 # Removed in clause preprocessing : 0
% 0.82/0.62 # Initial clauses in saturation : 3
% 0.82/0.62 # Processed clauses : 497
% 0.82/0.62 # ...of these trivial : 0
% 0.82/0.62 # ...subsumed : 250
% 0.82/0.62 # ...remaining for further processing : 247
% 0.82/0.62 # Other redundant clauses eliminated : 0
% 0.82/0.62 # Clauses deleted for lack of memory : 0
% 0.82/0.62 # Backward-subsumed : 196
% 0.82/0.62 # Backward-rewritten : 0
% 0.82/0.62 # Generated clauses : 4430
% 0.82/0.62 # ...of the previous two non-redundant : 4387
% 0.82/0.62 # ...aggressively subsumed : 0
% 0.82/0.62 # Contextual simplify-reflections : 0
% 0.82/0.62 # Paramodulations : 4430
% 0.82/0.62 # Factorizations : 0
% 0.82/0.62 # NegExts : 0
% 0.82/0.62 # Equation resolutions : 0
% 0.82/0.62 # Total rewrite steps : 125
% 0.82/0.62 # Propositional unsat checks : 0
% 0.82/0.62 # Propositional check models : 0
% 0.82/0.62 # Propositional check unsatisfiable : 0
% 0.82/0.62 # Propositional clauses : 0
% 0.82/0.62 # Propositional clauses after purity: 0
% 0.82/0.62 # Propositional unsat core size : 0
% 0.82/0.62 # Propositional preprocessing time : 0.000
% 0.82/0.62 # Propositional encoding time : 0.000
% 0.82/0.62 # Propositional solver time : 0.000
% 0.82/0.62 # Success case prop preproc time : 0.000
% 0.82/0.62 # Success case prop encoding time : 0.000
% 0.82/0.62 # Success case prop solver time : 0.000
% 0.82/0.62 # Current number of processed clauses : 48
% 0.82/0.62 # Positive orientable unit clauses : 2
% 0.82/0.62 # Positive unorientable unit clauses: 0
% 0.82/0.62 # Negative unit clauses : 6
% 0.82/0.62 # Non-unit-clauses : 40
% 0.82/0.62 # Current number of unprocessed clauses: 3732
% 0.82/0.62 # ...number of literals in the above : 14945
% 0.82/0.62 # Current number of archived formulas : 0
% 0.82/0.62 # Current number of archived clauses : 199
% 0.82/0.62 # Clause-clause subsumption calls (NU) : 15860
% 0.82/0.62 # Rec. Clause-clause subsumption calls : 5142
% 0.82/0.62 # Non-unit clause-clause subsumptions : 240
% 0.82/0.62 # Unit Clause-clause subsumption calls : 950
% 0.82/0.62 # Rewrite failures with RHS unbound : 0
% 0.82/0.62 # BW rewrite match attempts : 4
% 0.82/0.62 # BW rewrite match successes : 1
% 0.82/0.62 # Condensation attempts : 0
% 0.82/0.62 # Condensation successes : 0
% 0.82/0.62 # Termbank termtop insertions : 98015
% 0.82/0.62
% 0.82/0.62 # -------------------------------------------------
% 0.82/0.62 # User time : 0.099 s
% 0.82/0.62 # System time : 0.002 s
% 0.82/0.62 # Total time : 0.101 s
% 0.82/0.62 # Maximum resident set size: 1644 pages
% 0.82/0.62
% 0.82/0.62 # -------------------------------------------------
% 0.82/0.62 # User time : 0.099 s
% 0.82/0.62 # System time : 0.005 s
% 0.82/0.62 # Total time : 0.104 s
% 0.82/0.62 # Maximum resident set size: 1680 pages
% 0.82/0.62 % E---3.1 exiting
% 0.82/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------