TSTP Solution File: LCL121-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL121-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:45:04 EDT 2024
% Result : Unsatisfiable 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 49
% Number of leaves : 3
% Syntax : Number of clauses : 63 ( 17 unt; 0 nHn; 54 RR)
% Number of literals : 142 ( 0 equ; 124 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 : 154 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.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/benchmark/theBenchmark.p',lg_2) ).
cnf(prove_lg_1,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_1) ).
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(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
lg_2 ).
cnf(c_0_6,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_4,c_0_5]) ).
cnf(c_0_7,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_4,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b)))),
inference(fof_simplification,[status(thm)],[prove_lg_1]) ).
cnf(c_0_9,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_4,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b)))),
c_0_8 ).
cnf(c_0_11,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_4,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b))))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,equivalent(c,c)),b)),a))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,equivalent(c,c)),b)),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,equivalent(c,c)),b))))
| ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,equivalent(c,c)),b))))
| ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_16,c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(c,c))),a))
| ~ is_a_theorem(equivalent(equivalent(X1,b),a))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(c,c))),a))
| ~ is_a_theorem(equivalent(equivalent(X1,b),a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,equivalent(c,c)))))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,equivalent(c,c)))))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_20,c_0_5]) ).
cnf(c_0_22,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(c,c)),b),a))
| ~ is_a_theorem(equivalent(equivalent(X1,b),a))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(c,c)),b),a))
| ~ is_a_theorem(equivalent(equivalent(X1,b),a)) ),
inference(spm,[status(thm)],[c_0_22,c_0_5]) ).
cnf(c_0_24,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(c,c)),b)))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_26,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(c,c)),b)))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_28,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(c,c))))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(equivalent(X1,b),a)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,c),b),a)),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,c),b)))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,c),b)))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_32,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_11,c_0_5]) ).
cnf(c_0_33,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,c),b)))
| ~ is_a_theorem(equivalent(X3,a))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,b),X2))
| ~ is_a_theorem(equivalent(X1,equivalent(X3,c)))
| ~ is_a_theorem(equivalent(X2,a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,c),b),X2))
| ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,c),b),X2))
| ~ is_a_theorem(equivalent(X2,a)) ),
inference(spm,[status(thm)],[c_0_35,c_0_5]) ).
cnf(c_0_37,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,c),X2),equivalent(b,X2)),a)),
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_38,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,c),X3),equivalent(b,X3))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,X2)),a))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X3,c),X2))) ),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_40,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(b,equivalent(X2,c))),a)),
inference(spm,[status(thm)],[c_0_39,c_0_25]) ).
cnf(c_0_41,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(b,equivalent(X3,c)))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(X2,c))),a))
| ~ is_a_theorem(equivalent(X1,equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_41,c_0_27]) ).
cnf(c_0_43,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_32,c_0_25]) ).
cnf(c_0_44,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,c)),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(equivalent(X1,b),a)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,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_4,c_0_32]) ).
cnf(c_0_46,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,b),a)),
inference(spm,[status(thm)],[c_0_44,c_0_5]) ).
cnf(c_0_47,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_45,c_0_27]) ).
cnf(c_0_48,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,a),X2))
| ~ is_a_theorem(equivalent(X1,equivalent(X3,b)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,b),a),X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_27]) ).
cnf(c_0_50,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,b),a),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_5]) ).
cnf(c_0_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,b),X2),equivalent(a,X2))),
inference(spm,[status(thm)],[c_0_50,c_0_25]) ).
cnf(c_0_52,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(X2,b)))),
inference(spm,[status(thm)],[c_0_51,c_0_43]) ).
cnf(c_0_53,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_32,c_0_27]) ).
cnf(c_0_54,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,b)),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
~ is_a_theorem(equivalent(X1,a)),
inference(spm,[status(thm)],[c_0_54,c_0_5]) ).
cnf(c_0_56,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_55,c_0_47]) ).
cnf(c_0_57,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,a),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_5]) ).
cnf(c_0_58,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,X2))),
inference(spm,[status(thm)],[c_0_57,c_0_25]) ).
cnf(c_0_59,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_58,c_0_43]) ).
cnf(c_0_60,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_32,c_0_5]) ).
cnf(c_0_61,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_61,c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : LCL121-1 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n003.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon May 20 00:51:22 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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/benchmark/theBenchmark.p
% 0.17/0.50 # Version: 3.1.0
% 0.17/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20020 completed with status 0
% 0.17/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.50 # No SInE strategy applied
% 0.17/0.50 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.17/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.17/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.50 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.17/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S00 with pid 20028 completed with status 0
% 0.17/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S00
% 0.17/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.51 # No SInE strategy applied
% 0.17/0.51 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.17/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.17/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.51 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.17/0.51 # Preprocessing time : 0.001 s
% 0.17/0.51 # Presaturation interreduction done
% 0.17/0.51
% 0.17/0.51 # Proof found!
% 0.17/0.51 # SZS status Unsatisfiable
% 0.17/0.51 # SZS output start CNFRefutation
% See solution above
% 0.17/0.51 # Parsed axioms : 3
% 0.17/0.51 # Removed by relevancy pruning/SinE : 0
% 0.17/0.51 # Initial clauses : 3
% 0.17/0.51 # Removed in clause preprocessing : 0
% 0.17/0.51 # Initial clauses in saturation : 3
% 0.17/0.51 # Processed clauses : 409
% 0.17/0.51 # ...of these trivial : 0
% 0.17/0.51 # ...subsumed : 221
% 0.17/0.51 # ...remaining for further processing : 188
% 0.17/0.51 # Other redundant clauses eliminated : 0
% 0.17/0.51 # Clauses deleted for lack of memory : 0
% 0.17/0.51 # Backward-subsumed : 141
% 0.17/0.51 # Backward-rewritten : 0
% 0.17/0.51 # Generated clauses : 3107
% 0.17/0.51 # ...of the previous two non-redundant : 3067
% 0.17/0.51 # ...aggressively subsumed : 0
% 0.17/0.51 # Contextual simplify-reflections : 0
% 0.17/0.51 # Paramodulations : 3107
% 0.17/0.51 # Factorizations : 0
% 0.17/0.51 # NegExts : 0
% 0.17/0.51 # Equation resolutions : 0
% 0.17/0.51 # Disequality decompositions : 0
% 0.17/0.51 # Total rewrite steps : 105
% 0.17/0.51 # ...of those cached : 100
% 0.17/0.51 # Propositional unsat checks : 0
% 0.17/0.51 # Propositional check models : 0
% 0.17/0.51 # Propositional check unsatisfiable : 0
% 0.17/0.51 # Propositional clauses : 0
% 0.17/0.51 # Propositional clauses after purity: 0
% 0.17/0.51 # Propositional unsat core size : 0
% 0.17/0.51 # Propositional preprocessing time : 0.000
% 0.17/0.51 # Propositional encoding time : 0.000
% 0.17/0.51 # Propositional solver time : 0.000
% 0.17/0.51 # Success case prop preproc time : 0.000
% 0.17/0.51 # Success case prop encoding time : 0.000
% 0.17/0.51 # Success case prop solver time : 0.000
% 0.17/0.51 # Current number of processed clauses : 44
% 0.17/0.51 # Positive orientable unit clauses : 2
% 0.17/0.51 # Positive unorientable unit clauses: 0
% 0.17/0.51 # Negative unit clauses : 5
% 0.17/0.51 # Non-unit-clauses : 37
% 0.17/0.51 # Current number of unprocessed clauses: 2463
% 0.17/0.51 # ...number of literals in the above : 9596
% 0.17/0.51 # Current number of archived formulas : 0
% 0.17/0.51 # Current number of archived clauses : 144
% 0.17/0.51 # Clause-clause subsumption calls (NU) : 7154
% 0.17/0.51 # Rec. Clause-clause subsumption calls : 3598
% 0.17/0.51 # Non-unit clause-clause subsumptions : 178
% 0.17/0.51 # Unit Clause-clause subsumption calls : 608
% 0.17/0.51 # Rewrite failures with RHS unbound : 0
% 0.17/0.51 # BW rewrite match attempts : 4
% 0.17/0.51 # BW rewrite match successes : 1
% 0.17/0.51 # Condensation attempts : 0
% 0.17/0.51 # Condensation successes : 0
% 0.17/0.51 # Termbank termtop insertions : 58116
% 0.17/0.51 # Search garbage collected termcells : 8
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.039 s
% 0.17/0.51 # System time : 0.005 s
% 0.17/0.51 # Total time : 0.043 s
% 0.17/0.51 # Maximum resident set size: 1644 pages
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.208 s
% 0.17/0.51 # System time : 0.014 s
% 0.17/0.51 # Total time : 0.222 s
% 0.17/0.51 # Maximum resident set size: 1696 pages
% 0.17/0.51 % E---3.1 exiting
% 0.17/0.51 % E exiting
%------------------------------------------------------------------------------