%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP121^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:05:35 AM UTC 2026
% Result : Theorem 5.39s 1.05s
% Output : CNFRefutation 5.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 32 ( 24 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 627 ( 10 ~; 3 |; 0 &; 613 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 4 con; 0-5 aty)
% Number of variables : 48 ( 0 ^; 48 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_37,type,
modula1936294176_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(decl_38,type,
modula1144073633_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(decl_53,type,
a2: a ).
thf(decl_54,type,
b: a ).
thf(decl_55,type,
c: a ).
thf(decl_56,type,
inf: a > a > a ).
thf(decl_57,type,
less_eq: a > a > $o ).
thf(decl_58,type,
sup: a > a > a ).
thf(conj_0,conjecture,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uhhVd7U3fv/E---3.1_3849622.p',conj_0) ).
thf(fact_1_local_Oinf_Ocommute,axiom,
! [X1: a,X2: a] :
( ( inf @ X1 @ X2 )
= ( inf @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.uhhVd7U3fv/E---3.1_3849622.p',fact_1_local_Oinf_Ocommute) ).
thf(fact_7_local_Osup_Ocommute,axiom,
! [X1: a,X2: a] :
( ( sup @ X1 @ X2 )
= ( sup @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.uhhVd7U3fv/E---3.1_3849622.p',fact_7_local_Osup_Ocommute) ).
thf(fact_6_local_Osup_Oassoc,axiom,
! [X1: a,X2: a,X3: a] :
( ( sup @ ( sup @ X1 @ X2 ) @ X3 )
= ( sup @ X1 @ ( sup @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uhhVd7U3fv/E---3.1_3849622.p',fact_6_local_Osup_Oassoc) ).
thf(fact_126_local_Omodular,axiom,
! [X4: a,X5: a,X6: a] :
( ( less_eq @ X4 @ X5 )
=> ( ( sup @ X4 @ ( inf @ X5 @ X6 ) )
= ( inf @ X5 @ ( sup @ X4 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uhhVd7U3fv/E---3.1_3849622.p',fact_126_local_Omodular) ).
thf(fact_16_local_Ob__join__d,axiom,
! [X2: a,X1: a,X3: a] :
( ( sup @ X2 @ ( modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) )
= ( sup @ X2 @ ( inf @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uhhVd7U3fv/E---3.1_3849622.p',fact_16_local_Ob__join__d) ).
thf(fact_82_local_Oinf__le2,axiom,
! [X4: a,X5: a] : ( less_eq @ ( inf @ X4 @ X5 ) @ X5 ),
file('/export/starexec/sandbox/tmp/tmp.uhhVd7U3fv/E---3.1_3849622.p',fact_82_local_Oinf__le2) ).
thf(c_0_7,negated_conjecture,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_8,negated_conjecture,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_10,plain,
! [X401: a,X402: a] :
( ( inf @ X401 @ X402 )
= ( inf @ X402 @ X401 ) ),
inference(variable_rename,[status(thm)],[fact_1_local_Oinf_Ocommute]) ).
thf(c_0_11,negated_conjecture,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
! [X2: a,X1: a] :
( ( inf @ X1 @ X2 )
= ( inf @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
! [X527: a,X528: a] :
( ( sup @ X527 @ X528 )
= ( sup @ X528 @ X527 ) ),
inference(variable_rename,[status(thm)],[fact_7_local_Osup_Ocommute]) ).
thf(c_0_14,negated_conjecture,
( ( sup @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
thf(c_0_15,plain,
! [X2: a,X1: a] :
( ( sup @ X1 @ X2 )
= ( sup @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,plain,
! [X524: a,X525: a,X526: a] :
( ( sup @ ( sup @ X524 @ X525 ) @ X526 )
= ( sup @ X524 @ ( sup @ X525 @ X526 ) ) ),
inference(variable_rename,[status(thm)],[fact_6_local_Osup_Oassoc]) ).
thf(c_0_17,plain,
! [X509: a,X510: a,X511: a] :
( ~ ( less_eq @ X509 @ X510 )
| ( ( sup @ X509 @ ( inf @ X510 @ X511 ) )
= ( inf @ X510 @ ( sup @ X509 @ X511 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_126_local_Omodular])])]) ).
thf(c_0_18,negated_conjecture,
( ( sup @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
thf(c_0_19,plain,
! [X1: a,X2: a,X3: a] :
( ( sup @ ( sup @ X1 @ X2 ) @ X3 )
= ( sup @ X1 @ ( sup @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,plain,
! [X1: a,X3: a,X2: a] :
( ( ( sup @ X1 @ ( inf @ X2 @ X3 ) )
= ( inf @ X2 @ ( sup @ X1 @ X3 ) ) )
| ~ ( less_eq @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,plain,
! [X633: a,X634: a,X635: a] :
( ( sup @ X633 @ ( modula1936294176_aux_a @ inf @ sup @ X634 @ X633 @ X635 ) )
= ( sup @ X633 @ ( inf @ X635 @ X634 ) ) ),
inference(variable_rename,[status(thm)],[fact_16_local_Ob__join__d]) ).
thf(c_0_22,plain,
! [X468: a,X469: a] : ( less_eq @ ( inf @ X468 @ X469 ) @ X469 ),
inference(variable_rename,[status(thm)],[fact_82_local_Oinf__le2]) ).
thf(c_0_23,negated_conjecture,
( ( sup @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( sup @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ) ) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_24,plain,
! [X3: a,X2: a,X1: a] :
( ( ( sup @ ( inf @ X1 @ X2 ) @ X3 )
= ( inf @ X1 @ ( sup @ X3 @ X2 ) ) )
| ~ ( less_eq @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
thf(c_0_25,plain,
! [X1: a,X3: a,X2: a] :
( ( sup @ X1 @ ( modula1936294176_aux_a @ inf @ sup @ X2 @ X1 @ X3 ) )
= ( sup @ X1 @ ( inf @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_26,plain,
! [X1: a,X2: a] : ( less_eq @ ( inf @ X1 @ X2 ) @ X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]),c_0_19]),c_0_25]),c_0_12]),c_0_12]),c_0_25]),c_0_12]),c_0_12]),c_0_25]),c_0_12]),c_0_12]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP121^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n007.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 19:54:41 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.26 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.uhhVd7U3fv/E---3.1_3849622.p
% 5.39/1.05 % Version: 3.5.1-ho
% 5.39/1.05 % Preprocessing class: HSLSSMSSSSSNHSA.
% 5.39/1.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/1.05 % Starting full_lambda_9 with 1500s (5) cores
% 5.39/1.05 % Starting new_ho_11 with 300s (1) cores
% 5.39/1.05 % Starting sh2l with 300s (1) cores
% 5.39/1.05 % Starting new_bool_6 with 300s (1) cores
% 5.39/1.05 % full_lambda_9 with pid 3849651 completed with status 0
% 5.39/1.05 % Result found by full_lambda_9
% 5.39/1.05 % Preprocessing class: HSLSSMSSSSSNHSA.
% 5.39/1.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/1.05 % Starting full_lambda_9 with 1500s (5) cores
% 5.39/1.05 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 5.39/1.05 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 5.39/1.05 % Search class: HGUSM-FFLS32-MHSFFFNN
% 5.39/1.05 % partial match(2): HGUSM-FSLM32-MHSFFFNN
% 5.39/1.05 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.39/1.05 % Starting SubtermCWHack with 136s (1) cores
% 5.39/1.05 % Starting full_lambda_9 with 151s (1) cores
% 5.39/1.05 % Starting sh5l with 136s (1) cores
% 5.39/1.05 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 5.39/1.05 % Starting lpo1_def_fix with 136s (1) cores
% 5.39/1.05 % ehoh_best_sine_rwall with pid 3849658 completed with status 0
% 5.39/1.05 % Result found by ehoh_best_sine_rwall
% 5.39/1.05 % Preprocessing class: HSLSSMSSSSSNHSA.
% 5.39/1.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/1.05 % Starting full_lambda_9 with 1500s (5) cores
% 5.39/1.05 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 5.39/1.05 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 5.39/1.05 % Search class: HGUSM-FFLS32-MHSFFFNN
% 5.39/1.05 % partial match(2): HGUSM-FSLM32-MHSFFFNN
% 5.39/1.05 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.39/1.05 % Starting SubtermCWHack with 136s (1) cores
% 5.39/1.05 % Starting full_lambda_9 with 151s (1) cores
% 5.39/1.05 % Starting sh5l with 136s (1) cores
% 5.39/1.05 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 5.39/1.05 % Preprocessing time : 0.004 s
% 5.39/1.05 % Presaturation interreduction done
% 5.39/1.05
% 5.39/1.05 % Proof found!
% 5.39/1.05 % SZS status Theorem
% 5.39/1.05 % SZS output start CNFRefutation
% See solution above
% 5.39/1.05 % Parsed axioms : 293
% 5.39/1.05 % Removed by relevancy pruning/SinE : 160
% 5.39/1.05 % Initial clauses : 158
% 5.39/1.05 % Removed in clause preprocessing : 8
% 5.39/1.05 % Initial clauses in saturation : 150
% 5.39/1.05 % Processed clauses : 3636
% 5.39/1.05 % ...of these trivial : 166
% 5.39/1.05 % ...subsumed : 2580
% 5.39/1.05 % ...remaining for further processing : 890
% 5.39/1.05 % Other redundant clauses eliminated : 390
% 5.39/1.05 % Clauses deleted for lack of memory : 0
% 5.39/1.05 % Backward-subsumed : 201
% 5.39/1.05 % Backward-rewritten : 25
% 5.39/1.05 % Generated clauses : 31151
% 5.39/1.05 % ...of the previous two non-redundant : 26529
% 5.39/1.05 % ...aggressively subsumed : 0
% 5.39/1.05 % Contextual simplify-reflections : 15
% 5.39/1.05 % Paramodulations : 30745
% 5.39/1.05 % Factorizations : 0
% 5.39/1.05 % NegExts : 0
% 5.39/1.05 % Equation resolutions : 390
% 5.39/1.05 % Disequality decompositions : 0
% 5.39/1.05 % Total rewrite steps : 15536
% 5.39/1.05 % ...of those cached : 13031
% 5.39/1.05 % Propositional unsat checks : 0
% 5.39/1.05 % Propositional check models : 0
% 5.39/1.05 % Propositional check unsatisfiable : 0
% 5.39/1.05 % Propositional clauses : 0
% 5.39/1.05 % Propositional clauses after purity: 0
% 5.39/1.05 % Propositional unsat core size : 0
% 5.39/1.05 % Propositional preprocessing time : 0.000
% 5.39/1.05 % Propositional encoding time : 0.000
% 5.39/1.05 % Propositional solver time : 0.000
% 5.39/1.05 % Success case prop preproc time : 0.000
% 5.39/1.05 % Success case prop encoding time : 0.000
% 5.39/1.05 % Success case prop solver time : 0.000
% 5.39/1.05 % Current number of processed clauses : 584
% 5.39/1.05 % Positive orientable unit clauses : 104
% 5.39/1.05 % Positive unorientable unit clauses: 8
% 5.39/1.05 % Negative unit clauses : 38
% 5.39/1.05 % Non-unit-clauses : 434
% 5.39/1.05 % Current number of unprocessed clauses: 22765
% 5.39/1.05 % ...number of literals in the above : 62633
% 5.39/1.05 % Current number of archived formulas : 0
% 5.39/1.05 % Current number of archived clauses : 305
% 5.39/1.05 % Clause-clause subsumption calls (NU) : 46435
% 5.39/1.05 % Rec. Clause-clause subsumption calls : 25912
% 5.39/1.05 % Non-unit clause-clause subsumptions : 1708
% 5.39/1.05 % Unit Clause-clause subsumption calls : 2297
% 5.39/1.05 % Rewrite failures with RHS unbound : 0
% 5.39/1.05 % BW rewrite match attempts : 439
% 5.39/1.05 % BW rewrite match successes : 235
% 5.39/1.05 % Condensation attempts : 0
% 5.39/1.05 % Condensation successes : 0
% 5.39/1.05 % Termbank termtop insertions : 812310
% 5.39/1.05 % Search garbage collected termcells : 3296
% 5.39/1.05
% 5.39/1.05 % -------------------------------------------------
% 5.39/1.05 % User time : 0.729 s
% 5.39/1.05 % System time : 0.025 s
% 5.39/1.05 % Total time : 0.755 s
% 5.39/1.05 % Maximum resident set size: 4488 pages
% 5.39/1.05
% 5.39/1.05 % -------------------------------------------------
% 5.39/1.05 % User time : 3.529 s
% 5.39/1.05 % System time : 0.149 s
% 5.39/1.05 % Total time : 3.678 s
% 5.39/1.05 % Maximum resident set size: 5120 pages
% 5.39/1.05 % E exiting
%------------------------------------------------------------------------------