%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO248^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:42:38 AM UTC 2026
% Result : Theorem 0.25s 0.34s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO248^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 % Computer : n011.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Tue Sep 29 16:41:16 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.29 Running higher-order theorem proving
% 0.25/0.30 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.osPeOhoZel/E---3.1_321629.p
% 0.25/0.34 % Version: 3.5.1-ho
% 0.25/0.34 % Preprocessing class: HSMSSMSMSSSNSSA.
% 0.25/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.34 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.34 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.25/0.34 % Starting sh5l with 300s (1) cores
% 0.25/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.34 % new_bool_3 with pid 321645 completed with status 0
% 0.25/0.34 % Result found by new_bool_3
% 0.25/0.34 % Preprocessing class: HSMSSMSMSSSNSSA.
% 0.25/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.34 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.34 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.25/0.34 % Starting sh5l with 300s (1) cores
% 0.25/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.34 % Search class: HGHSF-FFSM00-SSSFFSBN
% 0.25/0.34 % partial match(1): HGHSF-FFSF00-SSSFFSBN
% 0.25/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.34 % SubtermCWHack with pid 321646 completed with status 0
% 0.25/0.34 % Result found by SubtermCWHack
% 0.25/0.34 % Preprocessing class: HSMSSMSMSSSNSSA.
% 0.25/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.34 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.34 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.25/0.34 % Starting sh5l with 300s (1) cores
% 0.25/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.34 % Search class: HGHSF-FFSM00-SSSFFSBN
% 0.25/0.34 % partial match(1): HGHSF-FFSF00-SSSFFSBN
% 0.25/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.34 % Preprocessing time : 0.002 s
% 0.25/0.34
% 0.25/0.34 % Proof found!
% 0.25/0.34 % SZS status Theorem
% 0.25/0.34 % SZS output start CNFRefutation
% 0.25/0.34 thf(decl_23, type, hh: $i).
% 0.25/0.34 thf(decl_24, type, h: $i).
% 0.25/0.34 thf(decl_25, type, ee: $i).
% 0.25/0.34 thf(decl_26, type, e: $i).
% 0.25/0.34 thf(decl_27, type, dd: $i).
% 0.25/0.34 thf(decl_28, type, d: $i).
% 0.25/0.34 thf(decl_29, type, cc: $i).
% 0.25/0.34 thf(decl_30, type, c: $i).
% 0.25/0.34 thf(decl_31, type, bb: $i).
% 0.25/0.34 thf(decl_32, type, b: $i).
% 0.25/0.34 thf(decl_33, type, aa: $i).
% 0.25/0.34 thf(decl_34, type, a: $i).
% 0.25/0.34 thf(decl_35, type, epred1_1: ($i > $i > $o) > $o).
% 0.25/0.34 thf(decl_36, type, epred2_0: $i > $i > $o).
% 0.25/0.34 thf(cSIXFRIENDS_AGAIN, conjecture, ![X1:$i > $i > $o]:((((((((((((X1 @ a)=(X1 @ aa))&((X1 @ b)=(X1 @ bb)))&((X1 @ e)=(X1 @ hh)))=>((X1 @ c)=(X1 @ dd)))&(((((X1 @ a)=(X1 @ aa))&((X1 @ h)=(X1 @ hh)))&((X1 @ b)=(X1 @ cc)))=>((X1 @ d)!=(X1 @ ee))))&((((((X1 @ c)=(X1 @ cc))&((X1 @ cc)=(X1 @ d)))&((X1 @ d)=(X1 @ dd)))&((X1 @ a)!=(X1 @ bb)))=>((X1 @ e)!=(X1 @ hh))))&(((((X1 @ a)=(X1 @ aa))&((X1 @ d)=(X1 @ dd)))&((X1 @ b)!=(X1 @ cc)))=>((X1 @ e)=(X1 @ hh))))&(((((X1 @ e)=(X1 @ ee))&((X1 @ h)=(X1 @ hh)))&((X1 @ c)=(X1 @ dd)))=>((X1 @ a)!=(X1 @ bb))))&((((((X1 @ b)=(X1 @ bb))&((X1 @ bb)=(X1 @ c)))&((X1 @ c)=(X1 @ cc)))&((X1 @ e)!=(X1 @ hh)))=>((X1 @ d)=(X1 @ ee))))=>(((X1 @ a)!=(X1 @ aa))|((X1 @ b)!=(X1 @ bb))|((X1 @ c)!=(X1 @ cc))|((X1 @ d)!=(X1 @ dd))|((X1 @ e)!=(X1 @ ee))|((X1 @ h)!=(X1 @ hh))))), file('/export/starexec/sandbox2/tmp/tmp.osPeOhoZel/E---3.1_321629.p', cSIXFRIENDS_AGAIN)).
% 0.25/0.34 thf(c_0_1, plain, ![X1:$i > $i > $o]:(((epred1_1 @ X1)<=>((((((((((X1 @ a)=(X1 @ aa))&((X1 @ b)=(X1 @ bb)))&((X1 @ e)=(X1 @ hh)))=>((X1 @ c)=(X1 @ dd)))&(((((X1 @ a)=(X1 @ aa))&((X1 @ h)=(X1 @ hh)))&((X1 @ b)=(X1 @ cc)))=>((X1 @ d)!=(X1 @ ee))))&((((((X1 @ c)=(X1 @ cc))&((X1 @ cc)=(X1 @ d)))&((X1 @ d)=(X1 @ dd)))&((X1 @ a)!=(X1 @ bb)))=>((X1 @ e)!=(X1 @ hh))))&(((((X1 @ a)=(X1 @ aa))&((X1 @ d)=(X1 @ dd)))&((X1 @ b)!=(X1 @ cc)))=>((X1 @ e)=(X1 @ hh))))&(((((X1 @ e)=(X1 @ ee))&((X1 @ h)=(X1 @ hh)))&((X1 @ c)=(X1 @ dd)))=>((X1 @ a)!=(X1 @ bb))))&((((((X1 @ b)=(X1 @ bb))&((X1 @ bb)=(X1 @ c)))&((X1 @ c)=(X1 @ cc)))&((X1 @ e)!=(X1 @ hh)))=>((X1 @ d)=(X1 @ ee)))))), introduced(definition)).
% 0.25/0.34 thf(c_0_2, negated_conjecture, ~(![X1:$i > $i > $o]:((((((((((((X1 @ a)=(X1 @ aa))&((X1 @ b)=(X1 @ bb)))&((X1 @ e)=(X1 @ hh)))=>((X1 @ c)=(X1 @ dd)))&(((((X1 @ a)=(X1 @ aa))&((X1 @ h)=(X1 @ hh)))&((X1 @ b)=(X1 @ cc)))=>((X1 @ d)!=(X1 @ ee))))&((((((X1 @ c)=(X1 @ cc))&((X1 @ cc)=(X1 @ d)))&((X1 @ d)=(X1 @ dd)))&((X1 @ a)!=(X1 @ bb)))=>((X1 @ e)!=(X1 @ hh))))&(((((X1 @ a)=(X1 @ aa))&((X1 @ d)=(X1 @ dd)))&((X1 @ b)!=(X1 @ cc)))=>((X1 @ e)=(X1 @ hh))))&(((((X1 @ e)=(X1 @ ee))&((X1 @ h)=(X1 @ hh)))&((X1 @ c)=(X1 @ dd)))=>((X1 @ a)!=(X1 @ bb))))&((((((X1 @ b)=(X1 @ bb))&((X1 @ bb)=(X1 @ c)))&((X1 @ c)=(X1 @ cc)))&((X1 @ e)!=(X1 @ hh)))=>((X1 @ d)=(X1 @ ee))))=>(((X1 @ a)!=(X1 @ aa))|((X1 @ b)!=(X1 @ bb))|((X1 @ c)!=(X1 @ cc))|((X1 @ d)!=(X1 @ dd))|((X1 @ e)!=(X1 @ ee))|((X1 @ h)!=(X1 @ hh)))))), inference(assume_negation,[status(cth)],[cSIXFRIENDS_AGAIN])).
% 0.25/0.34 thf(c_0_3, plain, ![X1:$i > $i > $o]:(((epred1_1 @ X1)=>((((((((((X1 @ a)=(X1 @ aa))&((X1 @ b)=(X1 @ bb)))&((X1 @ e)=(X1 @ hh)))=>((X1 @ c)=(X1 @ dd)))&(((((X1 @ a)=(X1 @ aa))&((X1 @ h)=(X1 @ hh)))&((X1 @ b)=(X1 @ cc)))=>((X1 @ d)!=(X1 @ ee))))&((((((X1 @ c)=(X1 @ cc))&((X1 @ cc)=(X1 @ d)))&((X1 @ d)=(X1 @ dd)))&((X1 @ a)!=(X1 @ bb)))=>((X1 @ e)!=(X1 @ hh))))&(((((X1 @ a)=(X1 @ aa))&((X1 @ d)=(X1 @ dd)))&((X1 @ b)!=(X1 @ cc)))=>((X1 @ e)=(X1 @ hh))))&(((((X1 @ e)=(X1 @ ee))&((X1 @ h)=(X1 @ hh)))&((X1 @ c)=(X1 @ dd)))=>((X1 @ a)!=(X1 @ bb))))&((((((X1 @ b)=(X1 @ bb))&((X1 @ bb)=(X1 @ c)))&((X1 @ c)=(X1 @ cc)))&((X1 @ e)!=(X1 @ hh)))=>((X1 @ d)=(X1 @ ee)))))), inference(split_equiv,[status(thm)],[c_0_1])).
% 0.25/0.34 thf(c_0_4, negated_conjecture, ~(![X1:$i > $i > $o]:(((epred1_1 @ X1)=>(((X1 @ a)!=(X1 @ aa))|((X1 @ b)!=(X1 @ bb))|((X1 @ c)!=(X1 @ cc))|((X1 @ d)!=(X1 @ dd))|((X1 @ e)!=(X1 @ ee))|((X1 @ h)!=(X1 @ hh)))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]), c_0_1])).
% 0.25/0.34 thf(c_0_5, plain, ![X4:$i > $i > $o]:(((((((((X4 @ a)!=(X4 @ aa))|((X4 @ b)!=(X4 @ bb))|((X4 @ e)!=(X4 @ hh))|((X4 @ c)=(X4 @ dd))|~(epred1_1 @ X4))&(((X4 @ a)!=(X4 @ aa))|((X4 @ h)!=(X4 @ hh))|((X4 @ b)!=(X4 @ cc))|((X4 @ d)!=(X4 @ ee))|~(epred1_1 @ X4)))&(((X4 @ c)!=(X4 @ cc))|((X4 @ cc)!=(X4 @ d))|((X4 @ d)!=(X4 @ dd))|((X4 @ a)=(X4 @ bb))|((X4 @ e)!=(X4 @ hh))|~(epred1_1 @ X4)))&(((X4 @ a)!=(X4 @ aa))|((X4 @ d)!=(X4 @ dd))|((X4 @ b)=(X4 @ cc))|((X4 @ e)=(X4 @ hh))|~(epred1_1 @ X4)))&(((X4 @ e)!=(X4 @ ee))|((X4 @ h)!=(X4 @ hh))|((X4 @ c)!=(X4 @ dd))|((X4 @ a)!=(X4 @ bb))|~(epred1_1 @ X4)))&(((X4 @ b)!=(X4 @ bb))|((X4 @ bb)!=(X4 @ c))|((X4 @ c)!=(X4 @ cc))|((X4 @ e)=(X4 @ hh))|((X4 @ d)=(X4 @ ee))|~(epred1_1 @ X4)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])).
% 0.25/0.34 thf(c_0_6, negated_conjecture, ((epred1_1 @ epred2_0)&(((((((epred2_0 @ a)=(epred2_0 @ aa))&((epred2_0 @ b)=(epred2_0 @ bb)))&((epred2_0 @ c)=(epred2_0 @ cc)))&((epred2_0 @ d)=(epred2_0 @ dd)))&((epred2_0 @ e)=(epred2_0 @ ee)))&((epred2_0 @ h)=(epred2_0 @ hh)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
% 0.25/0.34 thf(c_0_7, plain, ![X1:$i > $i > $o]:((((X1 @ a)!=(X1 @ aa))|((X1 @ h)!=(X1 @ hh))|((X1 @ b)!=(X1 @ cc))|((X1 @ d)!=(X1 @ ee))|~((epred1_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.25/0.34 thf(c_0_8, negated_conjecture, (epred1_1 @ epred2_0), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.25/0.34 thf(c_0_9, negated_conjecture, ((epred2_0 @ h)=(epred2_0 @ hh)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.25/0.34 thf(c_0_10, negated_conjecture, ((epred2_0 @ e)=(epred2_0 @ ee)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.25/0.34 thf(c_0_11, negated_conjecture, ((epred2_0 @ b)=(epred2_0 @ bb)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.25/0.34 thf(c_0_12, negated_conjecture, ((epred2_0 @ c)=(epred2_0 @ cc)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.25/0.34 thf(c_0_13, negated_conjecture, ((epred2_0 @ a)=(epred2_0 @ aa)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.25/0.34 thf(c_0_14, plain, ![X1:$i > $i > $o]:((((X1 @ b)=(X1 @ cc))|((X1 @ e)=(X1 @ hh))|((X1 @ a)!=(X1 @ aa))|((X1 @ d)!=(X1 @ dd))|~((epred1_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.25/0.34 thf(c_0_15, negated_conjecture, ((epred2_0 @ d)=(epred2_0 @ dd)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.25/0.34 thf(c_0_16, negated_conjecture, (((epred2_0 @ d)!=(epred2_0 @ e))|((epred2_0 @ bb)!=(epred2_0 @ c))), 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(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9]), c_0_10]), c_0_11]), c_0_12]), c_0_13])])).
% 0.25/0.34 thf(c_0_17, negated_conjecture, (((epred2_0 @ e)=(epred2_0 @ hh))|((epred2_0 @ bb)=(epred2_0 @ c))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_8]), c_0_11]), c_0_12]), c_0_15]), c_0_13])])).
% 0.25/0.34 thf(c_0_18, plain, ![X1:$i > $i > $o]:((((X1 @ c)=(X1 @ dd))|((X1 @ a)!=(X1 @ aa))|((X1 @ b)!=(X1 @ bb))|((X1 @ e)!=(X1 @ hh))|~((epred1_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.25/0.34 thf(c_0_19, plain, ![X1:$i > $i > $o]:((((X1 @ e)=(X1 @ hh))|((X1 @ d)=(X1 @ ee))|((X1 @ b)!=(X1 @ bb))|((X1 @ bb)!=(X1 @ c))|((X1 @ c)!=(X1 @ cc))|~((epred1_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.25/0.34 thf(c_0_20, negated_conjecture, (((epred2_0 @ e)=(epred2_0 @ hh))|((epred2_0 @ d)!=(epred2_0 @ e))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.25/0.34 thf(c_0_21, plain, ![X1:$i > $i > $o]:((((X1 @ e)!=(X1 @ ee))|((X1 @ h)!=(X1 @ hh))|((X1 @ c)!=(X1 @ dd))|((X1 @ a)!=(X1 @ bb))|~((epred1_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.25/0.34 thf(c_0_22, negated_conjecture, (((epred2_0 @ c)=(epred2_0 @ d))|((epred2_0 @ e)!=(epred2_0 @ hh))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_8]), c_0_15]), c_0_11]), c_0_13])])).
% 0.25/0.34 thf(c_0_23, negated_conjecture, ((epred2_0 @ e)=(epred2_0 @ hh)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_8]), c_0_10]), c_0_12]), c_0_11])]), c_0_17]), c_0_20])).
% 0.25/0.34 thf(c_0_24, negated_conjecture, (((epred2_0 @ c)!=(epred2_0 @ d))|((epred2_0 @ a)!=(epred2_0 @ bb))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_8]), c_0_9]), c_0_10]), c_0_15])])).
% 0.25/0.34 thf(c_0_25, negated_conjecture, ((epred2_0 @ c)=(epred2_0 @ d)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23])])).
% 0.25/0.34 thf(c_0_26, plain, ![X1:$i > $i > $o]:((((X1 @ a)=(X1 @ bb))|((X1 @ c)!=(X1 @ cc))|((X1 @ cc)!=(X1 @ d))|((X1 @ d)!=(X1 @ dd))|((X1 @ e)!=(X1 @ hh))|~((epred1_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.25/0.34 thf(c_0_27, negated_conjecture, ((epred2_0 @ a)!=(epred2_0 @ bb)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_25])])).
% 0.25/0.34 thf(c_0_28, negated_conjecture, ($false), inference(sr,[status(thm)],[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(spm,[status(thm)],[c_0_26, c_0_8]), c_0_23]), c_0_15]), c_0_12]), c_0_25]), c_0_12]), c_0_25]), c_0_25])]), c_0_27]), ['proof']).
% 0.25/0.34 % SZS output end CNFRefutation
% 0.25/0.34 % Parsed axioms : 13
% 0.25/0.34 % Removed by relevancy pruning/SinE : 12
% 0.25/0.34 % Initial clauses : 13
% 0.25/0.34 % Removed in clause preprocessing : 0
% 0.25/0.34 % Initial clauses in saturation : 13
% 0.25/0.34 % Processed clauses : 66
% 0.25/0.34 % ...of these trivial : 0
% 0.25/0.34 % ...subsumed : 4
% 0.25/0.34 % ...remaining for further processing : 62
% 0.25/0.34 % Other redundant clauses eliminated : 0
% 0.25/0.34 % Clauses deleted for lack of memory : 0
% 0.25/0.34 % Backward-subsumed : 0
% 0.25/0.34 % Backward-rewritten : 15
% 0.25/0.34 % Generated clauses : 76
% 0.25/0.34 % ...of the previous two non-redundant : 70
% 0.25/0.34 % ...aggressively subsumed : 0
% 0.25/0.34 % Contextual simplify-reflections : 2
% 0.25/0.34 % Paramodulations : 24
% 0.25/0.34 % Factorizations : 0
% 0.25/0.34 % NegExts : 0
% 0.25/0.34 % Equation resolutions : 0
% 0.25/0.34 % Disequality decompositions : 0
% 0.25/0.34 % Total rewrite steps : 41
% 0.25/0.34 % ...of those cached : 33
% 0.25/0.34 % Propositional unsat checks : 0
% 0.25/0.34 % Propositional check models : 0
% 0.25/0.34 % Propositional check unsatisfiable : 0
% 0.25/0.34 % Propositional clauses : 0
% 0.25/0.34 % Propositional clauses after purity: 0
% 0.25/0.34 % Propositional unsat core size : 0
% 0.25/0.34 % Propositional preprocessing time : 0.000
% 0.25/0.34 % Propositional encoding time : 0.000
% 0.25/0.34 % Propositional solver time : 0.000
% 0.25/0.34 % Success case prop preproc time : 0.000
% 0.25/0.34 % Success case prop encoding time : 0.000
% 0.25/0.34 % Success case prop solver time : 0.000
% 0.25/0.34 % Current number of processed clauses : 33
% 0.25/0.34 % Positive orientable unit clauses : 9
% 0.25/0.34 % Positive unorientable unit clauses: 0
% 0.25/0.34 % Negative unit clauses : 1
% 0.25/0.34 % Non-unit-clauses : 23
% 0.25/0.34 % Current number of unprocessed clauses: 16
% 0.25/0.34 % ...number of literals in the above : 52
% 0.25/0.34 % Current number of archived formulas : 0
% 0.25/0.34 % Current number of archived clauses : 29
% 0.25/0.34 % Clause-clause subsumption calls (NU) : 202
% 0.25/0.34 % Rec. Clause-clause subsumption calls : 135
% 0.25/0.34 % Non-unit clause-clause subsumptions : 6
% 0.25/0.34 % Unit Clause-clause subsumption calls : 12
% 0.25/0.34 % Rewrite failures with RHS unbound : 0
% 0.25/0.34 % BW rewrite match attempts : 2
% 0.25/0.34 % BW rewrite match successes : 2
% 0.25/0.34 % Condensation attempts : 0
% 0.25/0.34 % Condensation successes : 0
% 0.25/0.34 % Termbank termtop insertions : 4319
% 0.25/0.34 % Search garbage collected termcells : 304
% 0.25/0.34
% 0.25/0.34 % -------------------------------------------------
% 0.25/0.34 % User time : 0.013 s
% 0.25/0.34 % System time : 0.004 s
% 0.25/0.34 % Total time : 0.016 s
% 0.25/0.34 % Maximum resident set size: 3584 pages
% 0.25/0.34
% 0.25/0.34 % -------------------------------------------------
% 0.25/0.34 % User time : 0.015 s
% 0.25/0.34 % System time : 0.008 s
% 0.25/0.34 % Total time : 0.023 s
% 0.25/0.34 % Maximum resident set size: 4864 pages
% 0.25/0.34 % E exiting
%------------------------------------------------------------------------------