0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.12/0.33 % Computer : n018.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 02:02:49 EDT 2025 0.12/0.33 % CPUTime : 0.20/0.48 Running first-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.52 # Version: 3.0.0 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN. 0.20/0.52 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1200s (5) cores 0.20/0.52 # Starting new_bool_3 with 240s (1) cores 0.20/0.52 # Starting new_bool_1 with 240s (1) cores 0.20/0.52 # Starting sh5l with 240s (1) cores 0.20/0.52 # new_bool_3 with pid 13198 completed with status 0 0.20/0.52 # Result found by new_bool_3 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN. 0.20/0.52 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1200s (5) cores 0.20/0.52 # Starting new_bool_3 with 240s (1) cores 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.20/0.52 # Search class: FGHSF-FSLM22-SFFFFFNN 0.20/0.52 # Scheduled 5 strats onto 1 cores with 240 seconds (240 total) 0.20/0.52 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 145s (1) cores 0.20/0.52 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 13202 completed with status 0 0.20/0.52 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN. 0.20/0.52 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1200s (5) cores 0.20/0.52 # Starting new_bool_3 with 240s (1) cores 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.20/0.52 # Search class: FGHSF-FSLM22-SFFFFFNN 0.20/0.52 # Scheduled 5 strats onto 1 cores with 240 seconds (240 total) 0.20/0.52 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 145s (1) cores 0.20/0.52 # Preprocessing time : 0.002 s 0.20/0.52 # Presaturation interreduction done 0.20/0.52 0.20/0.52 # Proof found! 0.20/0.52 # SZS status Theorem 0.20/0.52 # SZS output start CNFRefutation 0.20/0.52 fof(happens_terminates_not_holds, axiom, ![X1, X6, X7]:(((terminates(X1,X7,X6)&happens(X1,X6))=>~(holdsAt(X7,plus(X6,n1))))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax', happens_terminates_not_holds)). 0.20/0.52 fof(symmetry_of_plus, axiom, ![X9, X10]:(plus(X10,X9)=plus(X9,X10)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', symmetry_of_plus)). 0.20/0.52 fof(plus0_1, axiom, n1=plus(n0,n1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus0_1)). 0.20/0.52 fof(terminates_all_defn, axiom, ![X1, X7, X6]:((terminates(X1,X7,X6)<=>(((X1=pull&happens(push,X6))&X7=backwards)|((spinning=X7&~(happens(push,X6)))&X1=pull)|((push=X1&X7=spinning)&~(happens(pull,X6)))|((pull=X1&forwards=X7)&happens(push,X6))|((~(happens(push,X6))&X7=forwards)&pull=X1)|((~(happens(pull,X6))&backwards=X7)&X1=push)))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', terminates_all_defn)). 0.20/0.52 fof(less_property, axiom, ![X9, X10]:((less(X9,X10)<=>(~(less(X10,X9))&X10!=X9))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_property)). 0.20/0.52 fof(happens_all_defn, axiom, ![X1, X6]:((((push=X1&n0=X6)|(pull=X1&n2=X6)|(X1=push&n2=X6)|(X6=n1&X1=pull))<=>happens(X1,X6))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', happens_all_defn)). 0.20/0.52 fof(less_or_equal, axiom, ![X9, X10]:((less_or_equal(X9,X10)<=>(less(X9,X10)|X10=X9))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_or_equal)). 0.20/0.52 fof(not_backwards_1, conjecture, ~(holdsAt(backwards,n1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', not_backwards_1)). 0.20/0.52 fof(push_not_pull, axiom, push!=pull, file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', push_not_pull)). 0.20/0.52 fof(less2, axiom, ![X9]:((less_or_equal(X9,n1)<=>less(X9,n2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less2)). 0.20/0.52 fof(less1, axiom, ![X9]:((less(X9,n1)<=>less_or_equal(X9,n0))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less1)). 0.20/0.52 fof(c_0_11, plain, ![X1, X6, X7]:(((terminates(X1,X7,X6)&happens(X1,X6))=>~holdsAt(X7,plus(X6,n1)))), inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])). 0.20/0.52 fof(c_0_12, plain, ![X13, X14, X15]:((~terminates(X13,X15,X14)|~happens(X13,X14)|~holdsAt(X15,plus(X14,n1)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])). 0.20/0.52 fof(c_0_13, plain, ![X39, X40]:(plus(X40,X39)=plus(X39,X40)), inference(variable_rename,[status(thm)],[symmetry_of_plus])). 0.20/0.52 fof(c_0_14, plain, ![X7, X6, X1]:((epred3_3(X1,X6,X7)<=>(((X1=pull&happens(push,X6))&X7=backwards)|((spinning=X7&~happens(push,X6))&X1=pull)|((push=X1&X7=spinning)&~happens(pull,X6))|((pull=X1&forwards=X7)&happens(push,X6))|((~happens(push,X6)&X7=forwards)&pull=X1)|((~happens(pull,X6)&backwards=X7)&X1=push)))), introduced(definition)). 0.20/0.52 fof(c_0_15, plain, ![X1, X7, X6]:((epred2_3(X6,X7,X1)<=>(((X1=pull&happens(push,X6))&X7=backwards)|((spinning=X7&~happens(push,X6))&X1=pull)|((push=X1&X7=spinning)&~happens(pull,X6))))), introduced(definition)). 0.20/0.52 cnf(c_0_16, plain, (~terminates(X1,X2,X3)|~happens(X1,X3)|~holdsAt(X2,plus(X3,n1))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.20/0.52 cnf(c_0_17, plain, (plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.52 cnf(c_0_18, plain, (n1=plus(n0,n1)), inference(split_conjunct,[status(thm)],[plus0_1])). 0.20/0.52 fof(c_0_19, plain, ![X1, X7, X6]:((terminates(X1,X7,X6)<=>epred3_3(X1,X6,X7))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[terminates_all_defn]), c_0_14])). 0.20/0.52 fof(c_0_20, plain, ![X7, X6, X1]:((epred3_3(X1,X6,X7)<=>(epred2_3(X6,X7,X1)|((pull=X1&forwards=X7)&happens(push,X6))|((~happens(push,X6)&X7=forwards)&pull=X1)|((~happens(pull,X6)&backwards=X7)&X1=push)))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])). 0.20/0.52 fof(c_0_21, plain, ![X9, X10]:((less(X9,X10)<=>(~less(X10,X9)&X10!=X9))), inference(fof_simplification,[status(thm)],[less_property])). 0.20/0.52 cnf(c_0_22, plain, (~happens(X1,X2)|~terminates(X1,X3,X2)|~holdsAt(X3,plus(n1,X2))), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.20/0.52 cnf(c_0_23, plain, (plus(n1,n0)=n1), inference(rw,[status(thm)],[c_0_18, c_0_17])). 0.20/0.52 fof(c_0_24, plain, ![X30, X31, X32]:(((~terminates(X30,X31,X32)|epred3_3(X30,X32,X31))&(~epred3_3(X30,X32,X31)|terminates(X30,X31,X32)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])). 0.20/0.52 fof(c_0_25, plain, ![X55, X56, X57]:(((((((((~happens(pull,X56)|(~happens(push,X56)|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(~happens(push,X56)|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(~happens(push,X56)|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(((~happens(pull,X56)|(X55=forwards|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(X55=forwards|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(X55=forwards|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))))&(((~happens(pull,X56)|(pull=X57|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(pull=X57|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(pull=X57|(pull=X57|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))))&(((((~happens(pull,X56)|(~happens(push,X56)|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(~happens(push,X56)|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(~happens(push,X56)|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(((~happens(pull,X56)|(X55=forwards|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(X55=forwards|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(X55=forwards|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))))&(((~happens(pull,X56)|(pull=X57|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(pull=X57|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(pull=X57|(forwards=X55|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))))&(((((~happens(pull,X56)|(~happens(push,X56)|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(~happens(push,X56)|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(~happens(push,X56)|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(((~happens(pull,X56)|(X55=forwards|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(X55=forwards|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(X55=forwards|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))))&(((~happens(pull,X56)|(pull=X57|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55))&(backwards=X55|(pull=X57|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))&(X57=push|(pull=X57|(happens(push,X56)|epred2_3(X56,X55,X57)))|~epred3_3(X57,X56,X55)))))&((((~epred2_3(X56,X55,X57)|epred3_3(X57,X56,X55))&(pull!=X57|forwards!=X55|~happens(push,X56)|epred3_3(X57,X56,X55)))&(happens(push,X56)|X55!=forwards|pull!=X57|epred3_3(X57,X56,X55)))&(happens(pull,X56)|backwards!=X55|X57!=push|epred3_3(X57,X56,X55))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])). 0.20/0.52 fof(c_0_26, plain, ![X47, X48]:((((((push!=X47|n0!=X48|happens(X47,X48))&(pull!=X47|n2!=X48|happens(X47,X48)))&(X47!=push|n2!=X48|happens(X47,X48)))&(X48!=n1|X47!=pull|happens(X47,X48)))&(((((X48=n1|(X47=push|(pull=X47|push=X47))|~happens(X47,X48))&(X47=pull|(X47=push|(pull=X47|push=X47))|~happens(X47,X48)))&((X48=n1|(n2=X48|(pull=X47|push=X47))|~happens(X47,X48))&(X47=pull|(n2=X48|(pull=X47|push=X47))|~happens(X47,X48))))&(((X48=n1|(X47=push|(n2=X48|push=X47))|~happens(X47,X48))&(X47=pull|(X47=push|(n2=X48|push=X47))|~happens(X47,X48)))&((X48=n1|(n2=X48|(n2=X48|push=X47))|~happens(X47,X48))&(X47=pull|(n2=X48|(n2=X48|push=X47))|~happens(X47,X48)))))&((((X48=n1|(X47=push|(pull=X47|n0=X48))|~happens(X47,X48))&(X47=pull|(X47=push|(pull=X47|n0=X48))|~happens(X47,X48)))&((X48=n1|(n2=X48|(pull=X47|n0=X48))|~happens(X47,X48))&(X47=pull|(n2=X48|(pull=X47|n0=X48))|~happens(X47,X48))))&(((X48=n1|(X47=push|(n2=X48|n0=X48))|~happens(X47,X48))&(X47=pull|(X47=push|(n2=X48|n0=X48))|~happens(X47,X48)))&((X48=n1|(n2=X48|(n2=X48|n0=X48))|~happens(X47,X48))&(X47=pull|(n2=X48|(n2=X48|n0=X48))|~happens(X47,X48)))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])])). 0.20/0.52 fof(c_0_27, plain, ![X43, X44]:((((~less(X44,X43)|~less(X43,X44))&(X44!=X43|~less(X43,X44)))&(less(X44,X43)|X44=X43|less(X43,X44)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])). 0.20/0.52 fof(c_0_28, plain, ![X45, X46]:(((~less_or_equal(X45,X46)|(less(X45,X46)|X46=X45))&((~less(X45,X46)|less_or_equal(X45,X46))&(X46!=X45|less_or_equal(X45,X46))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])])). 0.20/0.52 cnf(c_0_29, plain, (~happens(X1,n0)|~terminates(X1,X2,n0)|~holdsAt(X2,n1)), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.20/0.52 cnf(c_0_30, plain, (terminates(X1,X3,X2)|~epred3_3(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.52 cnf(c_0_31, plain, (happens(pull,X1)|epred3_3(X3,X1,X2)|backwards!=X2|X3!=push), inference(split_conjunct,[status(thm)],[c_0_25])). 0.20/0.52 cnf(c_0_32, plain, (happens(X1,X2)|push!=X1|n0!=X2), inference(split_conjunct,[status(thm)],[c_0_26])). 0.20/0.52 fof(c_0_33, negated_conjecture, holdsAt(backwards,n1), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[not_backwards_1])])). 0.20/0.52 fof(c_0_34, plain, push!=pull, inference(fof_simplification,[status(thm)],[push_not_pull])). 0.20/0.52 cnf(c_0_35, plain, (X1!=X2|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_27])). 0.20/0.52 fof(c_0_36, plain, ![X41]:(((~less_or_equal(X41,n1)|less(X41,n2))&(~less(X41,n2)|less_or_equal(X41,n1)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])])). 0.20/0.52 fof(c_0_37, plain, ![X26]:(((~less(X26,n1)|less_or_equal(X26,n0))&(~less_or_equal(X26,n0)|less(X26,n1)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])])). 0.20/0.52 cnf(c_0_38, plain, (less_or_equal(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_28])). 0.20/0.52 cnf(c_0_39, plain, (X1=n1|X2=push|n2=X1|push=X2|~happens(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_26])). 0.20/0.52 cnf(c_0_40, plain, (~epred3_3(X1,n0,X2)|~happens(X1,n0)|~holdsAt(X2,n1)), inference(spm,[status(thm)],[c_0_29, c_0_30])). 0.20/0.52 cnf(c_0_41, plain, (epred3_3(push,X1,backwards)|happens(pull,X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])])). 0.20/0.52 cnf(c_0_42, plain, (happens(push,n0)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_32])])). 0.20/0.52 cnf(c_0_43, negated_conjecture, (holdsAt(backwards,n1)), inference(split_conjunct,[status(thm)],[c_0_33])). 0.20/0.52 fof(c_0_44, plain, push!=pull, inference(fof_nnf,[status(thm)],[c_0_34])). 0.20/0.52 cnf(c_0_45, plain, (~less(X1,X1)), inference(er,[status(thm)],[c_0_35])). 0.20/0.52 cnf(c_0_46, plain, (less(X1,n2)|~less_or_equal(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_36])). 0.20/0.52 cnf(c_0_47, plain, (less(X1,n1)|~less_or_equal(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_37])). 0.20/0.52 cnf(c_0_48, plain, (less_or_equal(X1,X1)), inference(er,[status(thm)],[c_0_38])). 0.20/0.52 cnf(c_0_49, plain, (X2=push|X1=n1|n2=X1|~happens(X2,X1)), inference(cn,[status(thm)],[c_0_39])). 0.20/0.52 cnf(c_0_50, plain, (happens(pull,n0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42]), c_0_43])])). 0.20/0.52 cnf(c_0_51, plain, (push!=pull), inference(split_conjunct,[status(thm)],[c_0_44])). 0.20/0.52 cnf(c_0_52, plain, (~less_or_equal(n2,n1)), inference(spm,[status(thm)],[c_0_45, c_0_46])). 0.20/0.52 cnf(c_0_53, plain, (less_or_equal(X1,X2)|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_28])). 0.20/0.52 cnf(c_0_54, plain, (less(n0,n1)), inference(spm,[status(thm)],[c_0_47, c_0_48])). 0.20/0.52 cnf(c_0_55, plain, (n0=n2|n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_51])). 0.20/0.52 cnf(c_0_56, plain, (~less(n2,n1)), inference(spm,[status(thm)],[c_0_52, c_0_53])). 0.20/0.52 cnf(c_0_57, plain, (n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_55]), c_0_56])). 0.20/0.52 cnf(c_0_58, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_54, c_0_57]), c_0_45]), ['proof']). 0.20/0.52 # SZS output end CNFRefutation 0.20/0.52 # Parsed axioms : 48 0.20/0.52 # Removed by relevancy pruning/SinE : 17 0.20/0.52 # Initial clauses : 154 0.20/0.52 # Removed in clause preprocessing : 9 0.20/0.52 # Initial clauses in saturation : 145 0.20/0.52 # Processed clauses : 274 0.20/0.52 # ...of these trivial : 0 0.20/0.52 # ...subsumed : 82 0.20/0.52 # ...remaining for further processing : 192 0.20/0.52 # Other redundant clauses eliminated : 42 0.20/0.52 # Clauses deleted for lack of memory : 0 0.20/0.52 # Backward-subsumed : 1 0.20/0.52 # Backward-rewritten : 25 0.20/0.52 # Generated clauses : 138 0.20/0.52 # ...of the previous two non-redundant : 108 0.20/0.52 # ...aggressively subsumed : 0 0.20/0.52 # Contextual simplify-reflections : 3 0.20/0.52 # Paramodulations : 74 0.20/0.52 # Factorizations : 35 0.20/0.52 # NegExts : 0 0.20/0.52 # Equation resolutions : 42 0.20/0.52 # Disequality decompositions : 0 0.20/0.52 # Total rewrite steps : 31 0.20/0.52 # ...of those cached : 16 0.20/0.52 # Propositional unsat checks : 0 0.20/0.52 # Propositional check models : 0 0.20/0.52 # Propositional check unsatisfiable : 0 0.20/0.52 # Propositional clauses : 0 0.20/0.52 # Propositional clauses after purity: 0 0.20/0.52 # Propositional unsat core size : 0 0.20/0.52 # Propositional preprocessing time : 0.000 0.20/0.52 # Propositional encoding time : 0.000 0.20/0.52 # Propositional solver time : 0.000 0.20/0.52 # Success case prop preproc time : 0.000 0.20/0.52 # Success case prop encoding time : 0.000 0.20/0.52 # Success case prop solver time : 0.000 0.20/0.52 # Current number of processed clauses : 70 0.20/0.52 # Positive orientable unit clauses : 10 0.20/0.52 # Positive unorientable unit clauses: 1 0.20/0.52 # Negative unit clauses : 13 0.20/0.52 # Non-unit-clauses : 46 0.20/0.52 # Current number of unprocessed clauses: 53 0.20/0.52 # ...number of literals in the above : 174 0.20/0.52 # Current number of archived formulas : 0 0.20/0.52 # Current number of archived clauses : 107 0.20/0.52 # Clause-clause subsumption calls (NU) : 838 0.20/0.52 # Rec. Clause-clause subsumption calls : 567 0.20/0.52 # Non-unit clause-clause subsumptions : 71 0.20/0.52 # Unit Clause-clause subsumption calls : 106 0.20/0.52 # Rewrite failures with RHS unbound : 0 0.20/0.52 # BW rewrite match attempts : 27 0.20/0.52 # BW rewrite match successes : 26 0.20/0.52 # Condensation attempts : 0 0.20/0.52 # Condensation successes : 0 0.20/0.52 # Termbank termtop insertions : 7805 0.20/0.52 # Search garbage collected termcells : 1396 0.20/0.52 0.20/0.52 # ------------------------------------------------- 0.20/0.52 # User time : 0.015 s 0.20/0.52 # System time : 0.006 s 0.20/0.52 # Total time : 0.021 s 0.20/0.52 # Maximum resident set size: 2104 pages 0.20/0.52 0.20/0.52 # ------------------------------------------------- 0.20/0.52 # User time : 0.017 s 0.20/0.52 # System time : 0.008 s 0.20/0.52 # Total time : 0.025 s 0.20/0.52 # Maximum resident set size: 1772 pages 0.20/0.52 % E exiting 0.20/0.52 % E exiting 0.20/0.52 EOF