TSTP Solution File: LCL021-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL021-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : 300s
% DateTime : Mon May 20 23:44:38 EDT 2024
% Result : Unsatisfiable 2.72s 0.84s
% Output : CNFRefutation 2.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 3
% Syntax : Number of clauses : 71 ( 22 unt; 0 nHn; 37 RR)
% Number of literals : 147 ( 0 equ; 79 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 190 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(xhn,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xhn) ).
cnf(prove_xhk,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(a,c),b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_xhk) ).
cnf(c_0_3,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_4,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2)))),
xhn ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X4),X2)))
| ~ is_a_theorem(equivalent(X1,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_10,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X3,X4)),X1)),X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X1,X4)),X2))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,equivalent(X4,X1))))
| ~ is_a_theorem(X4)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),X3)))
| ~ is_a_theorem(X4)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_17,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X3))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X1)))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_6]) ).
cnf(c_0_22,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X2))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_24,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_5]) ).
cnf(c_0_26,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_27,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_5]) ).
cnf(c_0_28,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,equivalent(X4,X1)),X2)),X4)) ),
inference(spm,[status(thm)],[c_0_28,c_0_5]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_16]) ).
cnf(c_0_32,plain,
( is_a_theorem(equivalent(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_33,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_5]) ).
cnf(c_0_35,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_5]) ).
cnf(c_0_36,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X2,X1))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),X2)),
inference(spm,[status(thm)],[c_0_26,c_0_34]) ).
cnf(c_0_39,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_38]) ).
cnf(c_0_41,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X3))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_41]) ).
cnf(c_0_43,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(X3,X1)),X2),X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_42]) ).
cnf(c_0_44,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_45,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1))) ),
inference(spm,[status(thm)],[c_0_45,c_0_5]) ).
cnf(c_0_47,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_46]) ).
cnf(c_0_48,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1)),X3)),
inference(spm,[status(thm)],[c_0_47,c_0_5]) ).
cnf(c_0_49,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_48]) ).
cnf(c_0_50,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,X1),X2))),
inference(spm,[status(thm)],[c_0_26,c_0_48]) ).
cnf(c_0_51,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1)))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X1,X3))),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_35,c_0_51]) ).
cnf(c_0_53,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),X1),X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_50]) ).
cnf(c_0_54,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,equivalent(X3,X1))))),
inference(spm,[status(thm)],[c_0_49,c_0_52]) ).
cnf(c_0_55,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),X3)),X2)),
inference(spm,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_56,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X1,equivalent(X2,X3)))),X3)),
inference(spm,[status(thm)],[c_0_35,c_0_54]) ).
cnf(c_0_57,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1))) ),
inference(spm,[status(thm)],[c_0_33,c_0_54]) ).
cnf(c_0_58,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,equivalent(X3,X2)),X3))),
inference(spm,[status(thm)],[c_0_26,c_0_55]) ).
cnf(c_0_59,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X1,X3))),X2)),
inference(spm,[status(thm)],[c_0_53,c_0_56]) ).
cnf(c_0_60,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,equivalent(X1,X3))))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_48]) ).
cnf(c_0_62,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X2)),X3)),
inference(spm,[status(thm)],[c_0_53,c_0_59]) ).
cnf(c_0_63,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_60]) ).
cnf(c_0_64,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X2),equivalent(X1,X3))),
inference(spm,[status(thm)],[c_0_61,c_0_55]) ).
cnf(c_0_65,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(a,c),b)))),
inference(fof_simplification,[status(thm)],[prove_xhk]) ).
cnf(c_0_66,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_62]) ).
cnf(c_0_67,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,X3),X2))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(a,c),b)))),
c_0_65 ).
cnf(c_0_69,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X3),X2)))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL021-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n009.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 02:27:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 2.72/0.84 # Version: 3.1.0
% 2.72/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.72/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.72/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.72/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.72/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.72/0.84 # Starting sh5l with 300s (1) cores
% 2.72/0.84 # sh5l with pid 17194 completed with status 0
% 2.72/0.84 # Result found by sh5l
% 2.72/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.72/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.72/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.72/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.72/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.72/0.84 # Starting sh5l with 300s (1) cores
% 2.72/0.84 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.72/0.84 # Search class: FHUNF-FFSF22-MFFFFFNN
% 2.72/0.84 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.72/0.84 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 2.72/0.84 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 17201 completed with status 0
% 2.72/0.84 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 2.72/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.72/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.72/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.72/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.72/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.72/0.84 # Starting sh5l with 300s (1) cores
% 2.72/0.84 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.72/0.84 # Search class: FHUNF-FFSF22-MFFFFFNN
% 2.72/0.84 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.72/0.84 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 2.72/0.84 # Preprocessing time : 0.001 s
% 2.72/0.84
% 2.72/0.84 # Proof found!
% 2.72/0.84 # SZS status Unsatisfiable
% 2.72/0.84 # SZS output start CNFRefutation
% See solution above
% 2.72/0.84 # Parsed axioms : 3
% 2.72/0.84 # Removed by relevancy pruning/SinE : 0
% 2.72/0.84 # Initial clauses : 3
% 2.72/0.84 # Removed in clause preprocessing : 0
% 2.72/0.84 # Initial clauses in saturation : 3
% 2.72/0.84 # Processed clauses : 6381
% 2.72/0.84 # ...of these trivial : 433
% 2.72/0.84 # ...subsumed : 5167
% 2.72/0.84 # ...remaining for further processing : 781
% 2.72/0.84 # Other redundant clauses eliminated : 0
% 2.72/0.84 # Clauses deleted for lack of memory : 0
% 2.72/0.84 # Backward-subsumed : 4
% 2.72/0.84 # Backward-rewritten : 4
% 2.72/0.84 # Generated clauses : 52581
% 2.72/0.84 # ...of the previous two non-redundant : 32629
% 2.72/0.84 # ...aggressively subsumed : 0
% 2.72/0.84 # Contextual simplify-reflections : 0
% 2.72/0.84 # Paramodulations : 52581
% 2.72/0.84 # Factorizations : 0
% 2.72/0.84 # NegExts : 0
% 2.72/0.84 # Equation resolutions : 0
% 2.72/0.84 # Disequality decompositions : 0
% 2.72/0.84 # Total rewrite steps : 21255
% 2.72/0.84 # ...of those cached : 20650
% 2.72/0.84 # Propositional unsat checks : 0
% 2.72/0.84 # Propositional check models : 0
% 2.72/0.84 # Propositional check unsatisfiable : 0
% 2.72/0.84 # Propositional clauses : 0
% 2.72/0.84 # Propositional clauses after purity: 0
% 2.72/0.84 # Propositional unsat core size : 0
% 2.72/0.84 # Propositional preprocessing time : 0.000
% 2.72/0.84 # Propositional encoding time : 0.000
% 2.72/0.84 # Propositional solver time : 0.000
% 2.72/0.84 # Success case prop preproc time : 0.000
% 2.72/0.84 # Success case prop encoding time : 0.000
% 2.72/0.84 # Success case prop solver time : 0.000
% 2.72/0.84 # Current number of processed clauses : 773
% 2.72/0.84 # Positive orientable unit clauses : 537
% 2.72/0.84 # Positive unorientable unit clauses: 0
% 2.72/0.84 # Negative unit clauses : 0
% 2.72/0.84 # Non-unit-clauses : 236
% 2.72/0.84 # Current number of unprocessed clauses: 26209
% 2.72/0.84 # ...number of literals in the above : 56476
% 2.72/0.84 # Current number of archived formulas : 0
% 2.72/0.84 # Current number of archived clauses : 8
% 2.72/0.84 # Clause-clause subsumption calls (NU) : 78091
% 2.72/0.84 # Rec. Clause-clause subsumption calls : 77899
% 2.72/0.84 # Non-unit clause-clause subsumptions : 5171
% 2.72/0.84 # Unit Clause-clause subsumption calls : 3288
% 2.72/0.84 # Rewrite failures with RHS unbound : 0
% 2.72/0.84 # BW rewrite match attempts : 115766
% 2.72/0.84 # BW rewrite match successes : 4
% 2.72/0.84 # Condensation attempts : 0
% 2.72/0.84 # Condensation successes : 0
% 2.72/0.84 # Termbank termtop insertions : 520590
% 2.72/0.84 # Search garbage collected termcells : 8
% 2.72/0.84
% 2.72/0.84 # -------------------------------------------------
% 2.72/0.84 # User time : 0.304 s
% 2.72/0.84 # System time : 0.011 s
% 2.72/0.84 # Total time : 0.315 s
% 2.72/0.84 # Maximum resident set size: 1628 pages
% 2.72/0.84
% 2.72/0.84 # -------------------------------------------------
% 2.72/0.84 # User time : 0.305 s
% 2.72/0.84 # System time : 0.013 s
% 2.72/0.84 # Total time : 0.318 s
% 2.72/0.84 # Maximum resident set size: 1692 pages
% 2.72/0.84 % E---3.1 exiting
% 2.72/0.84 % E exiting
%------------------------------------------------------------------------------