TSTP Solution File: SEU671^2 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEU671^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:09:57 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU671^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n018.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 21 16:34:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 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.ZsNsAArs9w/E---3.1_2737.p
% 0.21/0.49 # Version: 3.2.0-ho
% 0.21/0.49 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.49 # Starting new_ho_7 with 300s (1) cores
% 0.21/0.49 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.21/0.49 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.49 # new_ho_7 with pid 2816 completed with status 0
% 0.21/0.49 # Result found by new_ho_7
% 0.21/0.49 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.49 # Starting new_ho_7 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.21/0.49 # Search class: HHUSF-FFSF22-DHSFMSBN
% 0.21/0.49 # partial match(2): HHUSF-FFSF32-SHSFMSBN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.49 # new_ho_10 with pid 2820 completed with status 0
% 0.21/0.49 # Result found by new_ho_10
% 0.21/0.49 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.49 # Starting new_ho_7 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.21/0.49 # Search class: HHUSF-FFSF22-DHSFMSBN
% 0.21/0.49 # partial match(2): HHUSF-FFSF32-SHSFMSBN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% 0.21/0.49 thf(decl_22, type, in: $i > $i > $o).
% 0.21/0.49 thf(decl_23, type, dsetconstr: $i > ($i > $o) > $i).
% 0.21/0.49 thf(decl_24, type, dsetconstrER: $o).
% 0.21/0.49 thf(decl_25, type, kpair: $i > $i > $i).
% 0.21/0.49 thf(decl_26, type, cartprod: $i > $i > $i).
% 0.21/0.49 thf(decl_27, type, setukpairinjL: $o).
% 0.21/0.49 thf(decl_28, type, setukpairinjR: $o).
% 0.21/0.49 thf(decl_29, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
% 0.21/0.49 thf(decl_30, type, esk1_0: $i).
% 0.21/0.49 thf(decl_31, type, esk2_0: $i).
% 0.21/0.49 thf(decl_32, type, epred1_0: $i > $i > $o).
% 0.21/0.49 thf(decl_33, type, esk3_0: $i).
% 0.21/0.49 thf(decl_34, type, esk4_0: $i).
% 0.21/0.49 thf(decl_35, type, esk5_0: $i).
% 0.21/0.49 thf(decl_36, type, esk6_0: $i).
% 0.21/0.49 thf(decl_37, type, esk7_0: $i).
% 0.21/0.49 thf(decl_38, type, esk8_0: $i).
% 0.21/0.49 thf(decl_39, type, esk9_0: $i).
% 0.21/0.49 thf(decl_40, type, esk10_0: $i).
% 0.21/0.49 thf(decl_41, type, esk11_0: $i).
% 0.21/0.49 thf(decl_42, type, esk12_0: $i).
% 0.21/0.49 thf(dsetconstrER, axiom, ((dsetconstrER)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4)))))=>(X2 @ X3)))), file('/export/starexec/sandbox/tmp/tmp.ZsNsAArs9w/E---3.1_2737.p', dsetconstrER)).
% 0.21/0.49 thf(dpsetconstr, axiom, ((dpsetconstr)=(^[X1:$i, X7:$i, X8:$i > $i > $o]:(dsetconstr @ (cartprod @ X1 @ X7) @ (^[X6:$i]:(?[X3:$i]:(((in @ X3 @ X1)&?[X4:$i]:((((in @ X4 @ X7)&(X8 @ X3 @ X4))&((X6)=(kpair @ X3 @ X4))))))))))), file('/export/starexec/sandbox/tmp/tmp.ZsNsAArs9w/E---3.1_2737.p', dpsetconstr)).
% 0.21/0.49 thf(dpsetconstrER, conjecture, ((dsetconstrER)=>((setukpairinjL)=>((setukpairinjR)=>![X1:$i, X7:$i, X9:$i > $i > $o, X3:$i, X4:$i]:(((in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X7 @ (^[X5:$i, X6:$i]:((X9 @ X5 @ X6)))))=>(X9 @ X3 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.ZsNsAArs9w/E---3.1_2737.p', dpsetconstrER)).
% 0.21/0.49 thf(setukpairinjR, axiom, ((setukpairinjR)<=>![X3:$i, X4:$i, X5:$i, X6:$i]:((((kpair @ X3 @ X4)=(kpair @ X5 @ X6))=>((X4)=(X6))))), file('/export/starexec/sandbox/tmp/tmp.ZsNsAArs9w/E---3.1_2737.p', setukpairinjR)).
% 0.21/0.49 thf(setukpairinjL, axiom, ((setukpairinjL)<=>![X3:$i, X4:$i, X5:$i, X6:$i]:((((kpair @ X3 @ X4)=(kpair @ X5 @ X6))=>((X3)=(X5))))), file('/export/starexec/sandbox/tmp/tmp.ZsNsAArs9w/E---3.1_2737.p', setukpairinjL)).
% 0.21/0.49 thf(c_0_5, plain, ((dsetconstrER)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((X2 @ Z0)))))=>(X2 @ X3)))), inference(fof_simplification,[status(thm)],[dsetconstrER])).
% 0.21/0.49 thf(c_0_6, plain, ((dpsetconstr)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i > $i > $o]:(dsetconstr @ (cartprod @ Z0 @ Z1) @ (^[Z3/* 5 */:$i]:(?[X3:$i]:(((in @ X3 @ Z0)&?[X4:$i]:((((in @ X4 @ Z1)&(Z2 @ X3 @ X4))&((Z3)=(kpair @ X3 @ X4))))))))))), inference(fof_simplification,[status(thm)],[dpsetconstr])).
% 0.21/0.49 thf(c_0_7, negated_conjecture, ~((![X26:$i, X27:$i > $o, X28:$i]:(((in @ X28 @ (dsetconstr @ X26 @ X27))=>(X27 @ X28)))=>(![X29:$i, X30:$i, X31:$i, X32:$i]:((((kpair @ X29 @ X30)=(kpair @ X31 @ X32))=>((X29)=(X31))))=>(![X33:$i, X34:$i, X35:$i, X36:$i]:((((kpair @ X33 @ X34)=(kpair @ X35 @ X36))=>((X34)=(X36))))=>![X1:$i, X7:$i, X9:$i > $i > $o, X3:$i, X4:$i]:(((in @ (kpair @ X3 @ X4) @ (dsetconstr @ (cartprod @ X1 @ X7) @ (^[Z0/* 5 */:$i]:(?[X37:$i]:(((in @ X37 @ X1)&?[X38:$i]:((((in @ X38 @ X7)&X9 @ X37 @ X38)&((Z0)=(kpair @ X37 @ X38))))))))))=>(X9 @ X3 @ X4))))))), inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[dpsetconstrER])]), c_0_5]), setukpairinjR]), setukpairinjL]), c_0_6])])).
% 0.21/0.49 thf(c_0_8, negated_conjecture, ![X39:$i, X40:$i > $o, X41:$i, X42:$i, X43:$i, X44:$i, X45:$i, X46:$i, X47:$i, X48:$i, X49:$i]:(((~(in @ X41 @ (dsetconstr @ X39 @ X40))|(X40 @ X41))&((((kpair @ X42 @ X43)!=(kpair @ X44 @ X45))|((X42)=(X44)))&((((kpair @ X46 @ X47)!=(kpair @ X48 @ X49))|((X47)=(X49)))&((in @ (kpair @ esk3_0 @ esk4_0) @ (dsetconstr @ (cartprod @ esk1_0 @ esk2_0) @ (^[Z0/* 5 */:$i]:(?[X37:$i]:(((in @ X37 @ esk1_0)&?[X38:$i]:((((in @ X38 @ esk2_0)&epred1_0 @ X37 @ X38)&((Z0)=(kpair @ X37 @ X38))))))))))&~(epred1_0 @ esk3_0 @ esk4_0)))))), 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_7])])])])])).
% 0.21/0.49 thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(((X2 @ X1)|~((in @ X1 @ (dsetconstr @ X3 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.21/0.49 thf(c_0_10, negated_conjecture, (in @ (kpair @ esk3_0 @ esk4_0) @ (dsetconstr @ (cartprod @ esk1_0 @ esk2_0) @ (^[Z0/* 5 */:$i]:(?[X71:$i]:(((in @ X71 @ esk1_0)&?[X72:$i]:((((in @ X72 @ esk2_0)&(epred1_0 @ X71 @ X72))&((Z0)=(kpair @ X71 @ X72)))))))))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.21/0.49 thf(c_0_11, negated_conjecture, ?[X73:$i]:(((in @ X73 @ esk1_0)&?[X74:$i]:((((in @ X74 @ esk2_0)&(epred1_0 @ X73 @ X74))&((kpair @ esk3_0 @ esk4_0)=(kpair @ X73 @ X74)))))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.21/0.49 thf(c_0_12, negated_conjecture, ((kpair @ esk3_0 @ esk4_0)=(kpair @ esk5_0 @ esk6_0)), inference(dynamic_cnf,[status(thm)],[c_0_11])).
% 0.21/0.49 thf(c_0_13, negated_conjecture, (in @ (kpair @ esk5_0 @ esk6_0) @ (dsetconstr @ (cartprod @ esk1_0 @ esk2_0) @ (^[Z0/* 5 */:$i]:(?[X75:$i]:(((in @ X75 @ esk1_0)&?[X76:$i]:((((in @ X76 @ esk2_0)&(epred1_0 @ X75 @ X76))&((Z0)=(kpair @ X75 @ X76)))))))))), inference(rw,[status(thm)],[c_0_10, c_0_12])).
% 0.21/0.49 thf(c_0_14, negated_conjecture, ?[X77:$i]:(((in @ X77 @ esk1_0)&?[X78:$i]:((((in @ X78 @ esk2_0)&(epred1_0 @ X77 @ X78))&((kpair @ esk5_0 @ esk6_0)=(kpair @ X77 @ X78)))))), inference(spm,[status(thm)],[c_0_9, c_0_13])).
% 0.21/0.49 thf(c_0_15, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:((((X3)=(X5))|((kpair @ X1 @ X3)!=(kpair @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.21/0.49 thf(c_0_16, negated_conjecture, ((kpair @ esk5_0 @ esk6_0)=(kpair @ esk7_0 @ esk8_0)), inference(dynamic_cnf,[status(thm)],[c_0_14])).
% 0.21/0.49 thf(c_0_17, negated_conjecture, ![X3:$i, X1:$i]:((((X1)=(esk4_0))|((kpair @ X3 @ X1)!=(kpair @ esk5_0 @ esk6_0)))), inference(spm,[status(thm)],[c_0_15, c_0_12])).
% 0.21/0.49 thf(c_0_18, negated_conjecture, (in @ (kpair @ esk7_0 @ esk8_0) @ (dsetconstr @ (cartprod @ esk1_0 @ esk2_0) @ (^[Z0/* 5 */:$i]:(?[X79:$i]:(((in @ X79 @ esk1_0)&?[X80:$i]:((((in @ X80 @ esk2_0)&(epred1_0 @ X79 @ X80))&((Z0)=(kpair @ X79 @ X80)))))))))), inference(rw,[status(thm)],[c_0_13, c_0_16])).
% 0.21/0.49 thf(c_0_19, negated_conjecture, ((esk4_0)=(esk6_0)), inference(er,[status(thm)],[c_0_17])).
% 0.21/0.49 thf(c_0_20, negated_conjecture, ?[X81:$i]:(((in @ X81 @ esk1_0)&?[X82:$i]:((((in @ X82 @ esk2_0)&(epred1_0 @ X81 @ X82))&((kpair @ esk7_0 @ esk8_0)=(kpair @ X81 @ X82)))))), inference(spm,[status(thm)],[c_0_9, c_0_18])).
% 0.21/0.49 thf(c_0_21, negated_conjecture, ((kpair @ esk3_0 @ esk6_0)=(kpair @ esk5_0 @ esk6_0)), inference(rw,[status(thm)],[c_0_12, c_0_19])).
% 0.21/0.49 thf(c_0_22, negated_conjecture, ![X3:$i, X1:$i]:((((X1)=(esk6_0))|((kpair @ X3 @ X1)!=(kpair @ esk7_0 @ esk8_0)))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.21/0.49 thf(c_0_23, negated_conjecture, ((kpair @ esk7_0 @ esk8_0)=(kpair @ esk9_0 @ esk10_0)), inference(dynamic_cnf,[status(thm)],[c_0_20])).
% 0.21/0.49 thf(c_0_24, negated_conjecture, ((kpair @ esk3_0 @ esk6_0)=(kpair @ esk7_0 @ esk8_0)), inference(rw,[status(thm)],[c_0_21, c_0_16])).
% 0.21/0.49 thf(c_0_25, negated_conjecture, ((esk6_0)=(esk8_0)), inference(er,[status(thm)],[c_0_22])).
% 0.21/0.49 thf(c_0_26, negated_conjecture, (in @ (kpair @ esk9_0 @ esk10_0) @ (dsetconstr @ (cartprod @ esk1_0 @ esk2_0) @ (^[Z0/* 5 */:$i]:(?[X83:$i]:(((in @ X83 @ esk1_0)&?[X84:$i]:((((in @ X84 @ esk2_0)&(epred1_0 @ X83 @ X84))&((Z0)=(kpair @ X83 @ X84)))))))))), inference(rw,[status(thm)],[c_0_18, c_0_23])).
% 0.21/0.49 thf(c_0_27, negated_conjecture, ((kpair @ esk3_0 @ esk8_0)=(kpair @ esk7_0 @ esk8_0)), inference(rw,[status(thm)],[c_0_24, c_0_25])).
% 0.21/0.49 thf(c_0_28, negated_conjecture, ![X3:$i, X1:$i]:((((X1)=(esk8_0))|((kpair @ X3 @ X1)!=(kpair @ esk9_0 @ esk10_0)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_25]), c_0_23])).
% 0.21/0.49 thf(c_0_29, negated_conjecture, ?[X85:$i]:(((in @ X85 @ esk1_0)&?[X86:$i]:((((in @ X86 @ esk2_0)&(epred1_0 @ X85 @ X86))&((kpair @ esk9_0 @ esk10_0)=(kpair @ X85 @ X86)))))), inference(spm,[status(thm)],[c_0_9, c_0_26])).
% 0.21/0.49 thf(c_0_30, negated_conjecture, ((kpair @ esk3_0 @ esk8_0)=(kpair @ esk9_0 @ esk10_0)), inference(rw,[status(thm)],[c_0_27, c_0_23])).
% 0.21/0.49 thf(c_0_31, negated_conjecture, ((esk8_0)=(esk10_0)), inference(er,[status(thm)],[c_0_28])).
% 0.21/0.49 thf(c_0_32, negated_conjecture, ((kpair @ esk9_0 @ esk10_0)=(kpair @ esk11_0 @ esk12_0)), inference(dynamic_cnf,[status(thm)],[c_0_29])).
% 0.21/0.49 thf(c_0_33, negated_conjecture, ~((epred1_0 @ esk3_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.21/0.49 thf(c_0_34, negated_conjecture, ((kpair @ esk3_0 @ esk10_0)=(kpair @ esk9_0 @ esk10_0)), inference(rw,[status(thm)],[c_0_30, c_0_31])).
% 0.21/0.49 thf(c_0_35, negated_conjecture, ![X3:$i, X1:$i]:((((X1)=(esk10_0))|((kpair @ X3 @ X1)!=(kpair @ esk11_0 @ esk12_0)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_31]), c_0_32])).
% 0.21/0.49 thf(c_0_36, negated_conjecture, ~((epred1_0 @ esk3_0 @ esk6_0)), inference(rw,[status(thm)],[c_0_33, c_0_19])).
% 0.21/0.49 thf(c_0_37, negated_conjecture, ((kpair @ esk3_0 @ esk10_0)=(kpair @ esk11_0 @ esk12_0)), inference(rw,[status(thm)],[c_0_34, c_0_32])).
% 0.21/0.49 thf(c_0_38, negated_conjecture, ((esk10_0)=(esk12_0)), inference(er,[status(thm)],[c_0_35])).
% 0.21/0.49 thf(c_0_39, negated_conjecture, ~((epred1_0 @ esk3_0 @ esk8_0)), inference(rw,[status(thm)],[c_0_36, c_0_25])).
% 0.21/0.49 thf(c_0_40, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:((((X1)=(X4))|((kpair @ X1 @ X3)!=(kpair @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.21/0.49 thf(c_0_41, negated_conjecture, ((kpair @ esk3_0 @ esk12_0)=(kpair @ esk11_0 @ esk12_0)), inference(rw,[status(thm)],[c_0_37, c_0_38])).
% 0.21/0.49 thf(c_0_42, negated_conjecture, ~((epred1_0 @ esk3_0 @ esk10_0)), inference(rw,[status(thm)],[c_0_39, c_0_31])).
% 0.21/0.49 thf(c_0_43, negated_conjecture, ![X1:$i, X3:$i]:((((X1)=(esk3_0))|((kpair @ X1 @ X3)!=(kpair @ esk11_0 @ esk12_0)))), inference(spm,[status(thm)],[c_0_40, c_0_41])).
% 0.21/0.49 thf(c_0_44, negated_conjecture, ~((epred1_0 @ esk3_0 @ esk12_0)), inference(rw,[status(thm)],[c_0_42, c_0_38])).
% 0.21/0.49 thf(c_0_45, negated_conjecture, ((esk3_0)=(esk11_0)), inference(er,[status(thm)],[c_0_43])).
% 0.21/0.49 thf(c_0_46, negated_conjecture, (epred1_0 @ esk11_0 @ esk12_0), inference(dynamic_cnf,[status(thm)],[c_0_29])).
% 0.21/0.49 thf(c_0_47, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44, c_0_45]), c_0_46])]), ['proof']).
% 0.21/0.49 # SZS output end CNFRefutation
% 0.21/0.49 # Parsed axioms : 13
% 0.21/0.49 # Removed by relevancy pruning/SinE : 8
% 0.21/0.49 # Initial clauses : 5
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 5
% 0.21/0.49 # Processed clauses : 73
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 3
% 0.21/0.49 # ...remaining for further processing : 70
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 42
% 0.21/0.49 # Generated clauses : 85
% 0.21/0.49 # ...of the previous two non-redundant : 119
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 62
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 7
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 50
% 0.21/0.49 # ...of those cached : 37
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 19
% 0.21/0.49 # Positive orientable unit clauses : 16
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 0
% 0.21/0.49 # Non-unit-clauses : 3
% 0.21/0.49 # Current number of unprocessed clauses: 10
% 0.21/0.49 # ...number of literals in the above : 17
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 51
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 22
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 20
% 0.21/0.49 # Non-unit clause-clause subsumptions : 3
% 0.21/0.49 # Unit Clause-clause subsumption calls : 3
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 9
% 0.21/0.49 # BW rewrite match successes : 9
% 0.21/0.49 # Condensation attempts : 73
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 2300
% 0.21/0.49 # Search garbage collected termcells : 407
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.007 s
% 0.21/0.49 # System time : 0.000 s
% 0.21/0.49 # Total time : 0.007 s
% 0.21/0.49 # Maximum resident set size: 1944 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.008 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.010 s
% 0.21/0.49 # Maximum resident set size: 1732 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------