TSTP Solution File: SEV129^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV129^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Tue May 21 04:07:50 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV129^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 18:54:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.53 Running higher-order theorem proving
% 0.20/0.53 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/benchmark/theBenchmark.p
% 0.20/0.55 # Version: 3.1.0-ho
% 0.20/0.55 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.20/0.55 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting full_lambda_6 with 900s (3) cores
% 0.20/0.55 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.55 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.20/0.55 # Starting ho_unfolding_1 with 300s (1) cores
% 0.20/0.55 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.55 # Starting ho_unfolding_2 with 300s (1) cores
% 0.20/0.55 # full_lambda_6 with pid 9804 completed with status 0
% 0.20/0.55 # Result found by full_lambda_6
% 0.20/0.55 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.20/0.55 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting full_lambda_6 with 900s (3) cores
% 0.20/0.55 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.55 # Search class: HGUSF-FFSF11-DHHFFMBN
% 0.20/0.55 # partial match(1): HGUSF-FFSF11-SHHFFMBN
% 0.20/0.55 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.20/0.55 # Starting ho_unfolding_3 with 487s (1) cores
% 0.20/0.55 # Starting full_lambda_6 with 91s (1) cores
% 0.20/0.55 # Starting sh5l with 82s (1) cores
% 0.20/0.55 # sh5l with pid 9812 completed with status 0
% 0.20/0.55 # Result found by sh5l
% 0.20/0.55 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.20/0.55 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting full_lambda_6 with 900s (3) cores
% 0.20/0.55 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.55 # Search class: HGUSF-FFSF11-DHHFFMBN
% 0.20/0.55 # partial match(1): HGUSF-FFSF11-SHHFFMBN
% 0.20/0.55 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.20/0.55 # Starting ho_unfolding_3 with 487s (1) cores
% 0.20/0.55 # Starting full_lambda_6 with 91s (1) cores
% 0.20/0.55 # Starting sh5l with 82s (1) cores
% 0.20/0.55 # Preprocessing time : 0.001 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Theorem
% 0.20/0.55 # SZS output start CNFRefutation
% 0.20/0.55 thf(decl_sort1, type, a: $tType).
% 0.20/0.55 thf(decl_22, type, epred1_0: (a > a > $o) > $o).
% 0.20/0.55 thf(decl_23, type, esk1_0: a).
% 0.20/0.55 thf(decl_24, type, esk2_0: a).
% 0.20/0.55 thf(decl_25, type, esk3_1: (a > a > $o) > a).
% 0.20/0.55 thf(decl_26, type, esk4_1: (a > a > $o) > a).
% 0.20/0.55 thf(decl_27, type, epred2_1: (a > a > $o) > a > a > $o).
% 0.20/0.55 thf(decl_28, type, esk5_1: (a > a > $o) > a).
% 0.20/0.55 thf(decl_29, type, esk6_1: (a > a > $o) > a).
% 0.20/0.55 thf(decl_30, type, esk7_1: (a > a > $o) > a).
% 0.20/0.55 thf(decl_31, type, epred3_0: a > a > $o).
% 0.20/0.55 thf(decl_32, type, epred4_3: a > a > (a > a > $o) > a > a > $o).
% 0.20/0.55 thf(cTHM253_A_pme, conjecture, ![X1:(a > a > $o) > $o, X2:a, X3:a]:((![X4:a > a > $o]:(((![X5:a, X6:a]:((?[X7:a > a > $o]:(((X1 @ X7)&(X7 @ X5 @ X6)))=>(X4 @ X5 @ X6)))&![X5:a, X6:a, X8:a]:((((X4 @ X5 @ X6)&(X4 @ X6 @ X8))=>(X4 @ X5 @ X8))))=>(X4 @ X2 @ X3)))=>![X4:a > a > $o]:(((![X5:a, X6:a]:((?[X7:a > a > $o]:((?[X9:a > a > $o]:(((X1 @ X9)&((X7)=(^[X10:a, X11:a]:(![X12:a > a > $o]:(((![X13:a, X14:a]:(((X9 @ X13 @ X14)=>(X12 @ X13 @ X14)))&![X13:a, X14:a, X8:a]:((((X12 @ X13 @ X14)&(X12 @ X14 @ X8))=>(X12 @ X13 @ X8))))=>(X12 @ X10 @ X11))))))))&(X7 @ X5 @ X6)))=>(X4 @ X5 @ X6)))&![X5:a, X6:a, X8:a]:((((X4 @ X5 @ X6)&(X4 @ X6 @ X8))=>(X4 @ X5 @ X8))))=>(X4 @ X2 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM253_A_pme)).
% 0.20/0.55 thf(c_0_1, negated_conjecture, ~(![X1:(a > a > $o) > $o, X2:a, X3:a]:((![X4:a > a > $o]:(((![X5:a, X6:a]:((?[X7:a > a > $o]:(((X1 @ X7)&(X7 @ X5 @ X6)))=>(X4 @ X5 @ X6)))&![X5:a, X6:a, X8:a]:((((X4 @ X5 @ X6)&(X4 @ X6 @ X8))=>(X4 @ X5 @ X8))))=>(X4 @ X2 @ X3)))=>![X4:a > a > $o]:(((![X5:a, X6:a]:((?[X7:a > a > $o]:((?[X9:a > a > $o]:(((X1 @ X9)&((X7)=(^[Z0/* 19 */:a, Z1:a]:(![X12:a > a > $o]:(((![X13:a, X14:a]:((X9 @ X13 @ X14=>X12 @ X13 @ X14))&![X13:a, X14:a, X8:a]:(((X12 @ X13 @ X14&X12 @ X14 @ X8)=>X12 @ X13 @ X8)))=>X12 @ Z0 @ Z1)))))))&(X7 @ X5 @ X6)))=>(X4 @ X5 @ X6)))&![X5:a, X6:a, X8:a]:((((X4 @ X5 @ X6)&(X4 @ X6 @ X8))=>(X4 @ X5 @ X8))))=>(X4 @ X2 @ X3)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM253_A_pme])])).
% 0.20/0.55 thf(c_0_2, negated_conjecture, ![X36:a > a > $o, X44:a, X45:a, X46:a > a > $o, X47:a > a > $o, X48:a, X49:a, X50:a]:((((((((X36 @ (esk5_1 @ X36) @ (esk6_1 @ X36))|(epred1_0 @ (epred2_1 @ X36))|(X36 @ esk1_0 @ esk2_0))&((X36 @ (esk6_1 @ X36) @ (esk7_1 @ X36))|(epred1_0 @ (epred2_1 @ X36))|(X36 @ esk1_0 @ esk2_0)))&(~(X36 @ (esk5_1 @ X36) @ (esk7_1 @ X36))|(epred1_0 @ (epred2_1 @ X36))|(X36 @ esk1_0 @ esk2_0)))&((((X36 @ (esk5_1 @ X36) @ (esk6_1 @ X36))|(epred2_1 @ X36 @ (esk3_1 @ X36) @ (esk4_1 @ X36))|(X36 @ esk1_0 @ esk2_0))&((X36 @ (esk6_1 @ X36) @ (esk7_1 @ X36))|(epred2_1 @ X36 @ (esk3_1 @ X36) @ (esk4_1 @ X36))|(X36 @ esk1_0 @ esk2_0)))&(~(X36 @ (esk5_1 @ X36) @ (esk7_1 @ X36))|(epred2_1 @ X36 @ (esk3_1 @ X36) @ (esk4_1 @ X36))|(X36 @ esk1_0 @ esk2_0))))&((((X36 @ (esk5_1 @ X36) @ (esk6_1 @ X36))|~(X36 @ (esk3_1 @ X36) @ (esk4_1 @ X36))|(X36 @ esk1_0 @ esk2_0))&((X36 @ (esk6_1 @ X36) @ (esk7_1 @ X36))|~(X36 @ (esk3_1 @ X36) @ (esk4_1 @ X36))|(X36 @ esk1_0 @ esk2_0)))&(~(X36 @ (esk5_1 @ X36) @ (esk7_1 @ X36))|~(X36 @ (esk3_1 @ X36) @ (esk4_1 @ X36))|(X36 @ esk1_0 @ esk2_0))))&(((~(epred1_0 @ X47)|((X46)!=(^[Z0/* 19 */:a, Z1:a]:(![X12:a > a > $o]:(((![X13:a, X14:a]:((X47 @ X13 @ X14=>X12 @ X13 @ X14))&![X13:a, X14:a, X8:a]:(((X12 @ X13 @ X14&X12 @ X14 @ X8)=>X12 @ X13 @ X8)))=>X12 @ Z0 @ Z1)))))|~(X46 @ X44 @ X45)|(epred3_0 @ X44 @ X45))&(~(epred3_0 @ X48 @ X49)|~(epred3_0 @ X49 @ X50)|(epred3_0 @ X48 @ X50)))&~(epred3_0 @ esk1_0 @ 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.20/0.55 thf(c_0_3, negated_conjecture, ![X4:a > a > $o, X6:a, X7:a > a > $o, X8:a]:(((epred3_0 @ X6 @ X8)|~((epred1_0 @ X4))|((X7)!=(^[Z0/* 19 */:a, Z1:a]:(![X66:a > a > $o]:(((![X67:a, X68:a]:(((X4 @ X67 @ X68)=>(X66 @ X67 @ X68)))&![X69:a, X70:a, X71:a]:((((X66 @ X69 @ X70)&(X66 @ X70 @ X71))=>(X66 @ X69 @ X71))))=>(X66 @ Z0 @ Z1))))))|~((X7 @ X6 @ X8)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_4, negated_conjecture, ![X2:a, X3:a, X4:a > a > $o]:(((epred3_0 @ X2 @ X3)|~(![X72:a > a > $o]:(((![X73:a, X74:a]:(((X4 @ X73 @ X74)=>(X72 @ X73 @ X74)))&![X75:a, X76:a, X77:a]:((((X72 @ X75 @ X76)&(X72 @ X76 @ X77))=>(X72 @ X75 @ X77))))=>(X72 @ X2 @ X3))))|~((epred1_0 @ X4)))), inference(er,[status(thm)],[c_0_3])).
% 0.20/0.55 thf(c_0_5, negated_conjecture, ![X2:a, X3:a, X5:a]:(((epred3_0 @ X2 @ X5)|~((epred3_0 @ X2 @ X3))|~((epred3_0 @ X3 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_6, negated_conjecture, ![X4:a > a > $o]:(((X4 @ (esk6_1 @ X4) @ (esk7_1 @ X4))|(epred1_0 @ (epred2_1 @ X4))|(X4 @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_7, negated_conjecture, ~((epred3_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_8, negated_conjecture, ![X2:a, X3:a, X4:a > a > $o]:(((epred3_0 @ X2 @ X3)|~((epred4_3 @ X2 @ X3 @ X4 @ X2 @ X3))|~((epred1_0 @ X4)))), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.20/0.55 thf(c_0_9, negated_conjecture, ![X2:a, X3:a, X6:a, X5:a, X4:a > a > $o]:(((epred4_3 @ X2 @ X3 @ X4 @ X5 @ X6)|(epred3_0 @ X2 @ X3)|~((X4 @ X5 @ X6))|~((epred1_0 @ X4)))), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.20/0.55 thf(c_0_10, negated_conjecture, ![X4:a > a > $o]:(((epred1_0 @ (epred2_1 @ X4))|(X4 @ esk1_0 @ esk2_0)|~((X4 @ (esk5_1 @ X4) @ (esk7_1 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_11, negated_conjecture, ![X2:a]:(((epred3_0 @ X2 @ (esk7_1 @ epred3_0))|(epred1_0 @ (epred2_1 @ epred3_0))|~((epred3_0 @ X2 @ (esk6_1 @ epred3_0))))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
% 0.20/0.55 thf(c_0_12, negated_conjecture, ![X4:a > a > $o]:(((X4 @ (esk6_1 @ X4) @ (esk7_1 @ X4))|(X4 @ esk1_0 @ esk2_0)|~((X4 @ (esk3_1 @ X4) @ (esk4_1 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_13, negated_conjecture, ![X2:a, X4:a > a > $o, X3:a]:(((epred3_0 @ X2 @ X3)|~((epred1_0 @ X4))|~((X4 @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.20/0.55 thf(c_0_14, negated_conjecture, ((epred1_0 @ (epred2_1 @ epred3_0))|~((epred3_0 @ (esk5_1 @ epred3_0) @ (esk6_1 @ epred3_0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_7])).
% 0.20/0.55 thf(c_0_15, negated_conjecture, ![X4:a > a > $o]:(((X4 @ (esk5_1 @ X4) @ (esk6_1 @ X4))|(epred1_0 @ (epred2_1 @ X4))|(X4 @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_16, negated_conjecture, ![X4:a > a > $o]:(((epred3_0 @ (esk6_1 @ epred3_0) @ (esk7_1 @ epred3_0))|~((X4 @ (esk3_1 @ epred3_0) @ (esk4_1 @ epred3_0)))|~((epred1_0 @ X4)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_7])).
% 0.20/0.55 thf(c_0_17, negated_conjecture, ![X4:a > a > $o]:(((X4 @ (esk6_1 @ X4) @ (esk7_1 @ X4))|(epred2_1 @ X4 @ (esk3_1 @ X4) @ (esk4_1 @ X4))|(X4 @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_18, negated_conjecture, (epred1_0 @ (epred2_1 @ epred3_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_7])).
% 0.20/0.55 thf(c_0_19, negated_conjecture, ![X4:a > a > $o]:(((X4 @ (esk5_1 @ X4) @ (esk6_1 @ X4))|(X4 @ esk1_0 @ esk2_0)|~((X4 @ (esk3_1 @ X4) @ (esk4_1 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_20, negated_conjecture, ![X4:a > a > $o]:(((X4 @ esk1_0 @ esk2_0)|~((X4 @ (esk5_1 @ X4) @ (esk7_1 @ X4)))|~((X4 @ (esk3_1 @ X4) @ (esk4_1 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_21, negated_conjecture, (epred3_0 @ (esk6_1 @ epred3_0) @ (esk7_1 @ epred3_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])]), c_0_7])).
% 0.20/0.55 thf(c_0_22, negated_conjecture, ![X4:a > a > $o]:(((epred3_0 @ (esk5_1 @ epred3_0) @ (esk6_1 @ epred3_0))|~((X4 @ (esk3_1 @ epred3_0) @ (esk4_1 @ epred3_0)))|~((epred1_0 @ X4)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_13]), c_0_7])).
% 0.20/0.55 thf(c_0_23, negated_conjecture, ![X4:a > a > $o]:(((X4 @ (esk5_1 @ X4) @ (esk6_1 @ X4))|(epred2_1 @ X4 @ (esk3_1 @ X4) @ (esk4_1 @ X4))|(X4 @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_24, negated_conjecture, ![X4:a > a > $o]:((~((epred3_0 @ (esk5_1 @ epred3_0) @ (esk7_1 @ epred3_0)))|~((X4 @ (esk3_1 @ epred3_0) @ (esk4_1 @ epred3_0)))|~((epred1_0 @ X4)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_13]), c_0_7])).
% 0.20/0.55 thf(c_0_25, negated_conjecture, ![X2:a]:(((epred3_0 @ X2 @ (esk7_1 @ epred3_0))|~((epred3_0 @ X2 @ (esk6_1 @ epred3_0))))), inference(spm,[status(thm)],[c_0_5, c_0_21])).
% 0.20/0.55 thf(c_0_26, negated_conjecture, (epred3_0 @ (esk5_1 @ epred3_0) @ (esk6_1 @ epred3_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_18])]), c_0_7])).
% 0.20/0.55 thf(c_0_27, negated_conjecture, ![X4:a > a > $o]:(((epred2_1 @ X4 @ (esk3_1 @ X4) @ (esk4_1 @ X4))|(X4 @ esk1_0 @ esk2_0)|~((X4 @ (esk5_1 @ X4) @ (esk7_1 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.55 thf(c_0_28, negated_conjecture, ![X4:a > a > $o]:((~((X4 @ (esk3_1 @ epred3_0) @ (esk4_1 @ epred3_0)))|~((epred1_0 @ X4)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])])).
% 0.20/0.55 thf(c_0_29, negated_conjecture, (epred2_1 @ epred3_0 @ (esk3_1 @ epred3_0) @ (esk4_1 @ epred3_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_25]), c_0_26])]), c_0_7])).
% 0.20/0.55 thf(c_0_30, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_18])]), ['proof']).
% 0.20/0.55 # SZS output end CNFRefutation
% 0.20/0.55 # Parsed axioms : 2
% 0.20/0.55 # Removed by relevancy pruning/SinE : 1
% 0.20/0.55 # Initial clauses : 12
% 0.20/0.55 # Removed in clause preprocessing : 0
% 0.20/0.55 # Initial clauses in saturation : 12
% 0.20/0.55 # Processed clauses : 56
% 0.20/0.55 # ...of these trivial : 1
% 0.20/0.55 # ...subsumed : 3
% 0.20/0.55 # ...remaining for further processing : 52
% 0.20/0.55 # Other redundant clauses eliminated : 1
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 2
% 0.20/0.55 # Backward-rewritten : 7
% 0.20/0.55 # Generated clauses : 117
% 0.20/0.55 # ...of the previous two non-redundant : 95
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 1
% 0.20/0.55 # Paramodulations : 103
% 0.20/0.55 # Factorizations : 0
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 1
% 0.20/0.55 # Disequality decompositions : 0
% 0.20/0.55 # Total rewrite steps : 28
% 0.20/0.55 # ...of those cached : 23
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 27
% 0.20/0.55 # Positive orientable unit clauses : 5
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 1
% 0.20/0.55 # Non-unit-clauses : 21
% 0.20/0.55 # Current number of unprocessed clauses: 59
% 0.20/0.55 # ...number of literals in the above : 221
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 24
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 124
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 88
% 0.20/0.55 # Non-unit clause-clause subsumptions : 5
% 0.20/0.55 # Unit Clause-clause subsumption calls : 16
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 5
% 0.20/0.55 # BW rewrite match successes : 5
% 0.20/0.55 # Condensation attempts : 56
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 8039
% 0.20/0.55 # Search garbage collected termcells : 504
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.011 s
% 0.20/0.55 # System time : 0.003 s
% 0.20/0.55 # Total time : 0.014 s
% 0.20/0.55 # Maximum resident set size: 1968 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.034 s
% 0.20/0.55 # System time : 0.006 s
% 0.20/0.55 # Total time : 0.040 s
% 0.20/0.55 # Maximum resident set size: 1728 pages
% 0.20/0.55 % E---3.1 exiting
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------