TSTP Solution File: SEV244^6 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV244^6 : TPTP v8.2.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 Jun 24 15:54:05 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV244^6 : TPTP v8.2.0. Released v5.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Fri Jun 21 19:11:39 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.22/0.49 Running higher-order theorem proving
% 0.22/0.49 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.7EPk1EjQdU/E---3.1_20108.p
% 0.22/0.53 # Version: 3.2.0-ho
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.22/0.53 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting sh2lt with 1200s (4) cores
% 0.22/0.53 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.53 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.53 # Starting ehoh_best3_rw with 300s (1) cores
% 0.22/0.53 # post_as_ho1 with pid 20189 completed with status 0
% 0.22/0.53 # Result found by post_as_ho1
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.22/0.53 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting sh2lt with 1200s (4) cores
% 0.22/0.53 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.53 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGHNF-FFSF21-SHHFFMBN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting pre_casc_2 with 109s (1) cores
% 0.22/0.53 # pre_casc_2 with pid 20196 completed with status 0
% 0.22/0.53 # Result found by pre_casc_2
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.22/0.53 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting sh2lt with 1200s (4) cores
% 0.22/0.53 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.53 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGHNF-FFSF21-SHHFFMBN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting pre_casc_2 with 109s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% 0.22/0.53 thf(decl_22, type, epred1_0: ($i > $o) > $i > $o).
% 0.22/0.53 thf(decl_23, type, esk1_2: ($i > $o) > ($i > $o) > $i).
% 0.22/0.53 thf(decl_24, type, esk2_0: $i).
% 0.22/0.53 thf(decl_25, type, esk3_1: ($i > $o) > $i).
% 0.22/0.53 thf(decl_26, type, epred2_0: $i > $o).
% 0.22/0.53 thf(decl_27, type, epred3_0: $i > $o).
% 0.22/0.53 thf(decl_28, type, epred4_1: $i > $i > $o).
% 0.22/0.53 thf(decl_29, type, esk4_2: $i > ($i > $o) > $i).
% 0.22/0.53 thf(cTHM2A_pme, conjecture, ![X1:($i > $o) > $i > $o]:((![X2:$i > $o, X3:$i > $o]:((![X4:$i]:(((X2 @ X4)=>(X3 @ X4)))=>![X4:$i]:(((X1 @ X2 @ X4)=>(X1 @ X3 @ X4)))))=>![X5:$i]:(((X1 @ (^[X4:$i]:(?[X6:$i > $o]:((![X7:$i]:(((X6 @ X7)=>(X1 @ X6 @ X7)))&(X6 @ X4))))) @ X5)<=>?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5))))))), file('/export/starexec/sandbox/tmp/tmp.7EPk1EjQdU/E---3.1_20108.p', cTHM2A_pme)).
% 0.22/0.53 thf(c_0_1, negated_conjecture, ~(![X1:($i > $o) > $i > $o]:((![X2:$i > $o, X3:$i > $o]:((![X4:$i]:(((X2 @ X4)=>(X3 @ X4)))=>![X4:$i]:(((X1 @ X2 @ X4)=>(X1 @ X3 @ X4)))))=>![X5:$i]:(((X1 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>X1 @ X6 @ X7))&X6 @ Z0)))) @ X5)<=>?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM2A_pme])])).
% 0.22/0.53 thf(c_0_2, negated_conjecture, ![X17:$i > $o, X18:$i > $o, X20:$i, X22:$i > $o, X25:$i]:(((((X17 @ (esk1_2 @ X17 @ X18))|(~(epred1_0 @ X17 @ X20)|(epred1_0 @ X18 @ X20)))&(~(X18 @ (esk1_2 @ X17 @ X18))|(~(epred1_0 @ X17 @ X20)|(epred1_0 @ X18 @ X20))))&((((X22 @ (esk3_1 @ X22))|~(X22 @ esk2_0)|~(epred1_0 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>epred1_0 @ X6 @ X7))&X6 @ Z0)))) @ esk2_0))&(~(epred1_0 @ X22 @ (esk3_1 @ X22))|~(X22 @ esk2_0)|~(epred1_0 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>epred1_0 @ X6 @ X7))&X6 @ Z0)))) @ esk2_0)))&((~(epred2_0 @ X25)|(epred1_0 @ epred2_0 @ X25)|(epred1_0 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>epred1_0 @ X6 @ X7))&X6 @ Z0)))) @ esk2_0))&((epred2_0 @ esk2_0)|(epred1_0 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>epred1_0 @ X6 @ X7))&X6 @ Z0)))) @ esk2_0)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
% 0.22/0.53 thf(c_0_3, plain, ![X28:$i]:(((epred3_0 @ X28)<=>?[X26:$i > $o]:((![X27:$i]:(((X26 @ X27)=>(epred1_0 @ X26 @ X27)))&(X26 @ X28))))), introduced(definition)).
% 0.22/0.53 thf(c_0_4, negated_conjecture, ![X4:$i]:(((epred1_0 @ epred2_0 @ X4)|(((epred1_0 @ epred3_0 @ esk2_0))=(($true)))|~((epred2_0 @ X4)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.22/0.53 thf(c_0_5, plain, ![X38:$i, X40:$i, X41:$i > $o]:((((~(epred4_1 @ X38 @ X40)|(epred1_0 @ (epred4_1 @ X38) @ X40)|~(epred3_0 @ X38))&((epred4_1 @ X38 @ X38)|~(epred3_0 @ X38)))&(((X41 @ (esk4_2 @ X38 @ X41))|~(X41 @ X38)|(epred3_0 @ X38))&(~(epred1_0 @ X41 @ (esk4_2 @ X38 @ X41))|~(X41 @ X38)|(epred3_0 @ X38))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])).
% 0.22/0.53 thf(c_0_6, negated_conjecture, ![X2:$i > $o, X3:$i > $o, X4:$i]:(((X2 @ (esk1_2 @ X2 @ X3))|(epred1_0 @ X3 @ X4)|~((epred1_0 @ X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.22/0.53 thf(c_0_7, negated_conjecture, ![X4:$i]:(((epred1_0 @ epred3_0 @ esk2_0)|(epred1_0 @ epred2_0 @ X4)|~((epred2_0 @ X4)))), inference(cn,[status(thm)],[c_0_4])).
% 0.22/0.53 thf(c_0_8, negated_conjecture, ((epred2_0 @ esk2_0)|(((epred1_0 @ epred3_0 @ esk2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.22/0.53 thf(c_0_9, negated_conjecture, ![X2:$i > $o]:((~((epred1_0 @ X2 @ (esk3_1 @ X2)))|~((X2 @ esk2_0))|~((((epred1_0 @ epred3_0 @ esk2_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.22/0.53 thf(c_0_10, negated_conjecture, ![X2:$i > $o]:(((X2 @ (esk3_1 @ X2))|~((X2 @ esk2_0))|~((((epred1_0 @ epred3_0 @ esk2_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.22/0.53 thf(c_0_11, negated_conjecture, ![X2:$i > $o, X3:$i > $o, X4:$i]:(((epred1_0 @ X2 @ X4)|~((X2 @ (esk1_2 @ X3 @ X2)))|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.22/0.53 thf(c_0_12, plain, ![X2:$i > $o, X4:$i]:(((epred3_0 @ X4)|~((epred1_0 @ X2 @ (esk4_2 @ X4 @ X2)))|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.22/0.53 thf(c_0_13, plain, ![X2:$i > $o, X4:$i]:(((X2 @ (esk4_2 @ X4 @ X2))|(epred3_0 @ X4)|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.22/0.53 thf(c_0_14, negated_conjecture, ![X2:$i > $o, X4:$i]:(((epred2_0 @ (esk1_2 @ epred2_0 @ X2))|(epred1_0 @ epred3_0 @ esk2_0)|(epred1_0 @ X2 @ X4)|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_6, c_0_7])).
% 0.22/0.53 thf(c_0_15, negated_conjecture, ((epred1_0 @ epred3_0 @ esk2_0)|(epred2_0 @ esk2_0)), inference(cn,[status(thm)],[c_0_8])).
% 0.22/0.53 thf(c_0_16, negated_conjecture, ![X2:$i > $o]:((~((epred1_0 @ X2 @ (esk3_1 @ X2)))|~((epred1_0 @ epred3_0 @ esk2_0))|~((X2 @ esk2_0)))), inference(cn,[status(thm)],[c_0_9])).
% 0.22/0.53 thf(c_0_17, plain, ![X5:$i, X4:$i]:(((epred1_0 @ (epred4_1 @ X4) @ X5)|~((epred4_1 @ X4 @ X5))|~((epred3_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.22/0.53 thf(c_0_18, negated_conjecture, ![X2:$i > $o]:(((X2 @ (esk3_1 @ X2))|~((epred1_0 @ epred3_0 @ esk2_0))|~((X2 @ esk2_0)))), inference(cn,[status(thm)],[c_0_10])).
% 0.22/0.53 thf(c_0_19, negated_conjecture, ![X2:$i > $o, X4:$i]:(((epred1_0 @ epred3_0 @ esk2_0)|(epred1_0 @ X2 @ X4)|~((X2 @ (esk1_2 @ epred2_0 @ X2)))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_11, c_0_7])).
% 0.22/0.53 thf(c_0_20, negated_conjecture, ![X4:$i]:(((epred1_0 @ epred3_0 @ esk2_0)|(epred3_0 @ X4)|~((epred2_0 @ X4)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_7]), c_0_13])).
% 0.22/0.53 thf(c_0_21, negated_conjecture, ![X2:$i > $o]:(((epred2_0 @ (esk1_2 @ epred2_0 @ X2))|(epred1_0 @ epred3_0 @ esk2_0)|(epred1_0 @ X2 @ esk2_0))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.22/0.53 thf(c_0_22, plain, ![X4:$i]:((~((epred1_0 @ epred3_0 @ esk2_0))|~((epred4_1 @ X4 @ esk2_0))|~((epred3_0 @ X4)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
% 0.22/0.53 thf(c_0_23, plain, ![X4:$i]:(((epred4_1 @ X4 @ X4)|~((epred3_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.22/0.53 thf(c_0_24, negated_conjecture, ![X2:$i > $o]:(((epred1_0 @ epred3_0 @ esk2_0)|(epred1_0 @ X2 @ esk2_0)|~((X2 @ (esk1_2 @ epred2_0 @ X2))))), inference(spm,[status(thm)],[c_0_19, c_0_15])).
% 0.22/0.53 thf(c_0_25, negated_conjecture, ![X2:$i > $o]:(((epred3_0 @ (esk1_2 @ epred2_0 @ X2))|(epred1_0 @ epred3_0 @ esk2_0)|(epred1_0 @ X2 @ esk2_0))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
% 0.22/0.53 thf(c_0_26, plain, ![X2:$i > $o, X5:$i, X4:$i]:(((epred4_1 @ X4 @ (esk1_2 @ (epred4_1 @ X4) @ X2))|(epred1_0 @ X2 @ X5)|~((epred4_1 @ X4 @ X5))|~((epred3_0 @ X4)))), inference(spm,[status(thm)],[c_0_6, c_0_17])).
% 0.22/0.53 thf(c_0_27, plain, (~((epred1_0 @ epred3_0 @ esk2_0))|~((epred3_0 @ esk2_0))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
% 0.22/0.53 thf(c_0_28, negated_conjecture, (epred1_0 @ epred3_0 @ esk2_0), inference(spm,[status(thm)],[c_0_24, c_0_25])).
% 0.22/0.53 thf(c_0_29, negated_conjecture, ![X2:$i > $o, X3:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ X3)))|~((epred1_0 @ epred3_0 @ esk2_0))|~((X2 @ (esk1_2 @ X3 @ X2)))|~((epred1_0 @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_11, c_0_18])).
% 0.22/0.53 thf(c_0_30, plain, ![X2:$i > $o, X4:$i, X5:$i]:(((epred1_0 @ X2 @ X4)|~((X2 @ (esk1_2 @ (epred4_1 @ X5) @ X2)))|~((epred4_1 @ X5 @ X4))|~((epred3_0 @ X5)))), inference(spm,[status(thm)],[c_0_11, c_0_17])).
% 0.22/0.53 thf(c_0_31, plain, ![X4:$i, X5:$i]:(((epred3_0 @ X4)|~((epred4_1 @ X5 @ X4))|~((epred3_0 @ X5)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_17]), c_0_13])).
% 0.22/0.53 thf(c_0_32, plain, ![X2:$i > $o, X4:$i]:(((epred4_1 @ X4 @ (esk1_2 @ (epred4_1 @ X4) @ X2))|(epred1_0 @ X2 @ X4)|~((epred3_0 @ X4)))), inference(spm,[status(thm)],[c_0_26, c_0_23])).
% 0.22/0.53 thf(c_0_33, plain, ![X2:$i > $o, X3:$i > $o, X4:$i]:(((epred1_0 @ X2 @ (esk4_2 @ X4 @ (epred1_0 @ X3)))|(X3 @ (esk1_2 @ X3 @ X2))|(epred3_0 @ X4)|~((epred1_0 @ X3 @ X4)))), inference(spm,[status(thm)],[c_0_6, c_0_13])).
% 0.22/0.53 thf(c_0_34, plain, ~((epred3_0 @ esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_28])])).
% 0.22/0.53 thf(c_0_35, negated_conjecture, ![X2:$i > $o, X3:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ X3)))|~((X2 @ (esk1_2 @ X3 @ X2)))|~((epred1_0 @ X3 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_28])])).
% 0.22/0.53 thf(c_0_36, plain, ![X2:$i > $o, X4:$i]:(((epred1_0 @ X2 @ X4)|~((X2 @ (esk1_2 @ (epred4_1 @ X4) @ X2)))|~((epred3_0 @ X4)))), inference(spm,[status(thm)],[c_0_30, c_0_23])).
% 0.22/0.53 thf(c_0_37, plain, ![X2:$i > $o, X4:$i]:(((epred3_0 @ (esk1_2 @ (epred4_1 @ X4) @ X2))|(epred1_0 @ X2 @ X4)|~((epred3_0 @ X4)))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 0.22/0.53 thf(c_0_38, plain, ![X2:$i > $o]:(((epred1_0 @ X2 @ (esk4_2 @ esk2_0 @ (epred1_0 @ epred3_0)))|(epred3_0 @ (esk1_2 @ epred3_0 @ X2)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_28]), c_0_34])).
% 0.22/0.53 thf(c_0_39, negated_conjecture, ![X2:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ epred3_0)))|~((X2 @ (esk1_2 @ epred3_0 @ X2))))), inference(spm,[status(thm)],[c_0_35, c_0_28])).
% 0.22/0.53 thf(c_0_40, plain, ![X4:$i]:(((epred1_0 @ epred3_0 @ X4)|~((epred3_0 @ X4)))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
% 0.22/0.53 thf(c_0_41, plain, (epred3_0 @ (esk1_2 @ epred3_0 @ (epred1_0 @ epred3_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_38]), c_0_28])]), c_0_34])).
% 0.22/0.53 thf(c_0_42, negated_conjecture, ![X2:$i > $o]:((~((epred1_0 @ X2 @ (esk3_1 @ X2)))|~((X2 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_28])])).
% 0.22/0.53 thf(c_0_43, negated_conjecture, (epred1_0 @ (epred1_0 @ epred3_0) @ (esk3_1 @ (epred1_0 @ epred3_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_41])])).
% 0.22/0.53 thf(c_0_44, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_28])]), ['proof']).
% 0.22/0.53 # SZS output end CNFRefutation
% 0.22/0.53 # Parsed axioms : 1
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 10
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 10
% 0.22/0.53 # Processed clauses : 290
% 0.22/0.53 # ...of these trivial : 1
% 0.22/0.53 # ...subsumed : 117
% 0.22/0.53 # ...remaining for further processing : 172
% 0.22/0.53 # Other redundant clauses eliminated : 5
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 56
% 0.22/0.53 # Backward-rewritten : 26
% 0.22/0.53 # Generated clauses : 492
% 0.22/0.53 # ...of the previous two non-redundant : 454
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 46
% 0.22/0.53 # Paramodulations : 422
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 23
% 0.22/0.53 # Equation resolutions : 5
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 43
% 0.22/0.53 # ...of those cached : 40
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 61
% 0.22/0.53 # Positive orientable unit clauses : 5
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 1
% 0.22/0.53 # Non-unit-clauses : 55
% 0.22/0.53 # Current number of unprocessed clauses: 138
% 0.22/0.53 # ...number of literals in the above : 677
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 111
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 2700
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 776
% 0.22/0.53 # Non-unit clause-clause subsumptions : 198
% 0.22/0.53 # Unit Clause-clause subsumption calls : 58
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 1
% 0.22/0.53 # BW rewrite match successes : 1
% 0.22/0.53 # Condensation attempts : 290
% 0.22/0.53 # Condensation successes : 1
% 0.22/0.53 # Termbank termtop insertions : 13635
% 0.22/0.53 # Search garbage collected termcells : 532
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.029 s
% 0.22/0.53 # System time : 0.001 s
% 0.22/0.53 # Total time : 0.031 s
% 0.22/0.53 # Maximum resident set size: 1896 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.030 s
% 0.22/0.53 # System time : 0.005 s
% 0.22/0.53 # Total time : 0.034 s
% 0.22/0.53 # Maximum resident set size: 1708 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------