0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n018.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 02:09:30 EDT 2022 0.13/0.34 % CPUTime : 0.19/0.47 Running first-order on 8 cores theorem proving 0.19/0.47 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=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.47 # Version: 3.0pre003 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN. 0.19/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 600s (5) cores 0.19/0.50 # Starting new_bool_3 with 120s (1) cores 0.19/0.50 # Starting new_bool_1 with 120s (1) cores 0.19/0.50 # Starting sh5l with 120s (1) cores 0.19/0.50 # new_bool_3 with pid 30789 completed with status 0 0.19/0.50 # Result found by new_bool_3 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN. 0.19/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 600s (5) cores 0.19/0.50 # Starting new_bool_3 with 120s (1) cores 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.19/0.50 # ...ProofStateSinE()=31/48 0.19/0.50 # Search class: FGHSF-FSLM22-SFFFFFNN 0.19/0.50 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.19/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 73s (1) cores 0.19/0.50 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 30799 completed with status 0 0.19/0.50 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN. 0.19/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 600s (5) cores 0.19/0.50 # Starting new_bool_3 with 120s (1) cores 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.19/0.50 # ...ProofStateSinE()=31/48 0.19/0.50 # Search class: FGHSF-FSLM22-SFFFFFNN 0.19/0.50 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.19/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 73s (1) cores 0.19/0.50 # Preprocessing time : 0.003 s 0.19/0.50 # Presaturation interreduction done 0.19/0.50 0.19/0.50 # Proof found! 0.19/0.50 # SZS status Theorem 0.19/0.50 # SZS output start CNFRefutation 0.19/0.50 tff(decl_22, type, startedIn: ($i * $i * $i) > $o). 0.19/0.50 tff(decl_23, type, happens: ($i * $i) > $o). 0.19/0.50 tff(decl_24, type, less: ($i * $i) > $o). 0.19/0.50 tff(decl_25, type, initiates: ($i * $i * $i) > $o). 0.19/0.50 tff(decl_26, type, releases: ($i * $i * $i) > $o). 0.19/0.50 tff(decl_27, type, releasedAt: ($i * $i) > $o). 0.19/0.50 tff(decl_28, type, n1: $i). 0.19/0.50 tff(decl_29, type, plus: ($i * $i) > $i). 0.19/0.50 tff(decl_30, type, stoppedIn: ($i * $i * $i) > $o). 0.19/0.50 tff(decl_31, type, terminates: ($i * $i * $i) > $o). 0.19/0.50 tff(decl_32, type, n0: $i). 0.19/0.50 tff(decl_33, type, trajectory: ($i * $i * $i * $i) > $o). 0.19/0.50 tff(decl_34, type, holdsAt: ($i * $i) > $o). 0.19/0.50 tff(decl_35, type, antitrajectory: ($i * $i * $i * $i) > $o). 0.19/0.50 tff(decl_36, type, forwards: $i). 0.19/0.50 tff(decl_37, type, backwards: $i). 0.19/0.50 tff(decl_38, type, pull: $i). 0.19/0.50 tff(decl_39, type, push: $i). 0.19/0.50 tff(decl_40, type, spinning: $i). 0.19/0.50 tff(decl_41, type, n2: $i). 0.19/0.50 tff(decl_42, type, n8: $i). 0.19/0.50 tff(decl_43, type, less_or_equal: ($i * $i) > $o). 0.19/0.50 tff(decl_44, type, n9: $i). 0.19/0.50 tff(decl_45, type, n3: $i). 0.19/0.50 tff(decl_46, type, n4: $i). 0.19/0.50 tff(decl_47, type, n5: $i). 0.19/0.50 tff(decl_48, type, n6: $i). 0.19/0.50 tff(decl_49, type, n7: $i). 0.19/0.50 tff(decl_50, type, epred1_3: ($i * $i * $i) > $o). 0.19/0.50 tff(decl_51, type, epred2_3: ($i * $i * $i) > $o). 0.19/0.50 tff(decl_52, type, epred3_3: ($i * $i * $i) > $o). 0.19/0.50 tff(decl_53, type, esk1_2: ($i * $i) > $i). 0.19/0.50 tff(decl_54, type, esk2_2: ($i * $i) > $i). 0.19/0.50 tff(decl_55, type, esk3_2: ($i * $i) > $i). 0.19/0.50 fof(happens_terminates_not_holds, axiom, ![X4, X5, X3]:((~(holdsAt(X3,plus(X5,n1)))<=(terminates(X4,X3,X5)&happens(X4,X5)))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax', happens_terminates_not_holds)). 0.19/0.50 fof(symmetry_of_plus, axiom, ![X9, X10]:(plus(X9,X10)=plus(X10,X9)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', symmetry_of_plus)). 0.19/0.50 fof(plus0_1, axiom, n1=plus(n0,n1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus0_1)). 0.19/0.50 fof(terminates_all_defn, axiom, ![X4, X3, X5]:(((((~(happens(push,X5))&forwards=X3)&X4=pull)|((X3=forwards&happens(push,X5))&pull=X4)|((pull=X4&happens(push,X5))&X3=backwards)|((X4=push&X3=spinning)&~(happens(pull,X5)))|((X4=pull&~(happens(push,X5)))&spinning=X3)|((X3=backwards&~(happens(pull,X5)))&push=X4))<=>terminates(X4,X3,X5))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', terminates_all_defn)). 0.19/0.50 fof(less_property, axiom, ![X9, X10]:(((~(less(X10,X9))&X9!=X10)<=>less(X9,X10))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_property)). 0.19/0.50 fof(happens_all_defn, axiom, ![X4, X5]:((((n2=X5&pull=X4)|(n2=X5&X4=push)|(pull=X4&X5=n1)|(X5=n0&push=X4))<=>happens(X4,X5))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', happens_all_defn)). 0.19/0.50 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.19/0.50 fof(not_backwards_1, conjecture, ~(holdsAt(backwards,n1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', not_backwards_1)). 0.19/0.50 fof(less2, axiom, ![X9]:((less(X9,n2)<=>less_or_equal(X9,n1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less2)). 0.19/0.50 fof(less1, axiom, ![X9]:((less(X9,n1)<=>less_or_equal(X9,n0))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less1)). 0.19/0.50 fof(push_not_pull, axiom, pull!=push, file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', push_not_pull)). 0.19/0.50 fof(c_0_11, plain, ![X4, X5, X3]:(((terminates(X4,X3,X5)&happens(X4,X5))=>~holdsAt(X3,plus(X5,n1)))), inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])). 0.19/0.50 fof(c_0_12, plain, ![X19, X20, X21]:((~terminates(X19,X21,X20)|~happens(X19,X20)|~holdsAt(X21,plus(X20,n1)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])). 0.19/0.50 fof(c_0_13, plain, ![X39, X40]:(plus(X39,X40)=plus(X40,X39)), inference(variable_rename,[status(thm)],[symmetry_of_plus])). 0.19/0.50 fof(c_0_14, plain, ![X3, X5, X4]:((epred3_3(X4,X5,X3)<=>(((~happens(push,X5)&forwards=X3)&X4=pull)|((X3=forwards&happens(push,X5))&pull=X4)|((pull=X4&happens(push,X5))&X3=backwards)|((X4=push&X3=spinning)&~happens(pull,X5))|((X4=pull&~happens(push,X5))&spinning=X3)|((X3=backwards&~happens(pull,X5))&push=X4)))), introduced(definition)). 0.19/0.50 fof(c_0_15, plain, ![X5, X4, X3]:((epred2_3(X3,X4,X5)<=>(((~happens(push,X5)&forwards=X3)&X4=pull)|((X3=forwards&happens(push,X5))&pull=X4)|((pull=X4&happens(push,X5))&X3=backwards)))), introduced(definition)). 0.19/0.50 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.19/0.50 cnf(c_0_17, plain, (plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.19/0.50 cnf(c_0_18, plain, (n1=plus(n0,n1)), inference(split_conjunct,[status(thm)],[plus0_1])). 0.19/0.50 fof(c_0_19, plain, ![X4, X3, X5]:((epred3_3(X4,X5,X3)<=>terminates(X4,X3,X5))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[terminates_all_defn]), c_0_14])). 0.19/0.50 fof(c_0_20, plain, ![X3, X5, X4]:((epred3_3(X4,X5,X3)<=>(epred2_3(X3,X4,X5)|((X4=push&X3=spinning)&~happens(pull,X5))|((X4=pull&~happens(push,X5))&spinning=X3)|((X3=backwards&~happens(pull,X5))&push=X4)))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])). 0.19/0.50 fof(c_0_21, plain, ![X9, X10]:(((~less(X10,X9)&X9!=X10)<=>less(X9,X10))), inference(fof_simplification,[status(thm)],[less_property])). 0.19/0.50 cnf(c_0_22, plain, (~holdsAt(X1,plus(n1,X2))|~terminates(X3,X1,X2)|~happens(X3,X2)), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.19/0.50 cnf(c_0_23, plain, (plus(n1,n0)=n1), inference(rw,[status(thm)],[c_0_18, c_0_17])). 0.19/0.50 fof(c_0_24, plain, ![X30, X31, X32]:(((~epred3_3(X30,X32,X31)|terminates(X30,X31,X32))&(~terminates(X30,X31,X32)|epred3_3(X30,X32,X31)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])). 0.19/0.50 fof(c_0_25, plain, ![X55, X56, X57]:(((((((((X55=backwards|(X57=pull|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(X57=pull|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(X57=pull|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(((X55=backwards|(~happens(push,X56)|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(~happens(push,X56)|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(~happens(push,X56)|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))))&(((X55=backwards|(spinning=X55|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(spinning=X55|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(spinning=X55|(X57=push|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))))&(((((X55=backwards|(X57=pull|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(X57=pull|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(X57=pull|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(((X55=backwards|(~happens(push,X56)|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(~happens(push,X56)|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(~happens(push,X56)|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))))&(((X55=backwards|(spinning=X55|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(spinning=X55|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(spinning=X55|(X55=spinning|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))))&(((((X55=backwards|(X57=pull|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(X57=pull|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(X57=pull|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(((X55=backwards|(~happens(push,X56)|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(~happens(push,X56)|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(~happens(push,X56)|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))))&(((X55=backwards|(spinning=X55|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55))&(~happens(pull,X56)|(spinning=X55|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))&(push=X57|(spinning=X55|(~happens(pull,X56)|epred2_3(X55,X57,X56)))|~epred3_3(X57,X56,X55)))))&((((~epred2_3(X55,X57,X56)|epred3_3(X57,X56,X55))&(X57!=push|X55!=spinning|happens(pull,X56)|epred3_3(X57,X56,X55)))&(X57!=pull|happens(push,X56)|spinning!=X55|epred3_3(X57,X56,X55)))&(X55!=backwards|happens(pull,X56)|push!=X57|epred3_3(X57,X56,X55))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])). 0.19/0.50 fof(c_0_26, plain, ![X47, X48]:((((((n2!=X48|pull!=X47|happens(X47,X48))&(n2!=X48|X47!=push|happens(X47,X48)))&(pull!=X47|X48!=n1|happens(X47,X48)))&(X48!=n0|push!=X47|happens(X47,X48)))&(((((X48=n0|(pull=X47|(n2=X48|n2=X48))|~happens(X47,X48))&(push=X47|(pull=X47|(n2=X48|n2=X48))|~happens(X47,X48)))&((X48=n0|(X48=n1|(n2=X48|n2=X48))|~happens(X47,X48))&(push=X47|(X48=n1|(n2=X48|n2=X48))|~happens(X47,X48))))&(((X48=n0|(pull=X47|(X47=push|n2=X48))|~happens(X47,X48))&(push=X47|(pull=X47|(X47=push|n2=X48))|~happens(X47,X48)))&((X48=n0|(X48=n1|(X47=push|n2=X48))|~happens(X47,X48))&(push=X47|(X48=n1|(X47=push|n2=X48))|~happens(X47,X48)))))&((((X48=n0|(pull=X47|(n2=X48|pull=X47))|~happens(X47,X48))&(push=X47|(pull=X47|(n2=X48|pull=X47))|~happens(X47,X48)))&((X48=n0|(X48=n1|(n2=X48|pull=X47))|~happens(X47,X48))&(push=X47|(X48=n1|(n2=X48|pull=X47))|~happens(X47,X48))))&(((X48=n0|(pull=X47|(X47=push|pull=X47))|~happens(X47,X48))&(push=X47|(pull=X47|(X47=push|pull=X47))|~happens(X47,X48)))&((X48=n0|(X48=n1|(X47=push|pull=X47))|~happens(X47,X48))&(push=X47|(X48=n1|(X47=push|pull=X47))|~happens(X47,X48)))))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])). 0.19/0.50 fof(c_0_27, plain, ![X45, X46]:(((less(X46,X45)|X45=X46|less(X45,X46))&((~less(X46,X45)|~less(X45,X46))&(X45!=X46|~less(X45,X46))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])). 0.19/0.50 fof(c_0_28, plain, ![X41, X42]:(((~less_or_equal(X41,X42)|(less(X41,X42)|X42=X41))&((~less(X41,X42)|less_or_equal(X41,X42))&(X42!=X41|less_or_equal(X41,X42))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])). 0.19/0.50 cnf(c_0_29, plain, (~holdsAt(X1,n1)|~terminates(X2,X1,n0)|~happens(X2,n0)), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.19/0.50 cnf(c_0_30, plain, (terminates(X1,X3,X2)|~epred3_3(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.19/0.50 cnf(c_0_31, plain, (happens(pull,X2)|epred3_3(X3,X2,X1)|X1!=backwards|push!=X3), inference(split_conjunct,[status(thm)],[c_0_25])). 0.19/0.50 fof(c_0_32, negated_conjecture, holdsAt(backwards,n1), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[not_backwards_1])])). 0.19/0.50 cnf(c_0_33, plain, (happens(X2,X1)|X1!=n0|push!=X2), inference(split_conjunct,[status(thm)],[c_0_26])). 0.19/0.50 cnf(c_0_34, plain, (X1!=X2|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_27])). 0.19/0.50 fof(c_0_35, plain, ![X44]:(((~less(X44,n2)|less_or_equal(X44,n1))&(~less_or_equal(X44,n1)|less(X44,n2)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])). 0.19/0.50 fof(c_0_36, plain, ![X25]:(((~less(X25,n1)|less_or_equal(X25,n0))&(~less_or_equal(X25,n0)|less(X25,n1)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])). 0.19/0.50 cnf(c_0_37, plain, (less_or_equal(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_28])). 0.19/0.50 cnf(c_0_38, plain, (push=X1|X2=n1|X1=push|n2=X2|~happens(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_26])). 0.19/0.50 cnf(c_0_39, plain, (~epred3_3(X1,n0,X2)|~holdsAt(X2,n1)|~happens(X1,n0)), inference(spm,[status(thm)],[c_0_29, c_0_30])). 0.19/0.50 cnf(c_0_40, plain, (epred3_3(push,X1,backwards)|happens(pull,X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])])). 0.19/0.50 cnf(c_0_41, negated_conjecture, (holdsAt(backwards,n1)), inference(split_conjunct,[status(thm)],[c_0_32])). 0.19/0.50 cnf(c_0_42, plain, (happens(push,n0)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])])). 0.19/0.50 cnf(c_0_43, plain, (~less(X1,X1)), inference(er,[status(thm)],[c_0_34])). 0.19/0.50 cnf(c_0_44, plain, (less(X1,n2)|~less_or_equal(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_35])). 0.19/0.50 cnf(c_0_45, plain, (less(X1,n1)|~less_or_equal(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_36])). 0.19/0.50 cnf(c_0_46, plain, (less_or_equal(X1,X1)), inference(er,[status(thm)],[c_0_37])). 0.19/0.50 cnf(c_0_47, plain, (X2=n1|push=X1|n2=X2|~happens(X1,X2)), inference(cn,[status(thm)],[c_0_38])). 0.19/0.50 cnf(c_0_48, plain, (happens(pull,n0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_41]), c_0_42])])). 0.19/0.50 cnf(c_0_49, plain, (pull!=push), inference(split_conjunct,[status(thm)],[push_not_pull])). 0.19/0.50 cnf(c_0_50, plain, (~less_or_equal(n2,n1)), inference(spm,[status(thm)],[c_0_43, c_0_44])). 0.19/0.50 cnf(c_0_51, plain, (less_or_equal(X1,X2)|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_28])). 0.19/0.50 cnf(c_0_52, plain, (less(n0,n1)), inference(spm,[status(thm)],[c_0_45, c_0_46])). 0.19/0.50 cnf(c_0_53, plain, (n0=n2|n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_49])). 0.19/0.50 cnf(c_0_54, plain, (~less(n2,n1)), inference(spm,[status(thm)],[c_0_50, c_0_51])). 0.19/0.50 cnf(c_0_55, plain, (n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_54])). 0.19/0.50 cnf(c_0_56, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_52, c_0_55]), c_0_43]), ['proof']). 0.19/0.50 # SZS output end CNFRefutation 0.19/0.50 # Parsed axioms : 48 0.19/0.50 # Removed by relevancy pruning/SinE : 17 0.19/0.50 # Initial clauses : 154 0.19/0.50 # Removed in clause preprocessing : 8 0.19/0.50 # Initial clauses in saturation : 146 0.19/0.50 # Processed clauses : 264 0.19/0.50 # ...of these trivial : 0 0.19/0.50 # ...subsumed : 83 0.19/0.50 # ...remaining for further processing : 181 0.19/0.50 # Other redundant clauses eliminated : 39 0.19/0.50 # Clauses deleted for lack of memory : 0 0.19/0.50 # Backward-subsumed : 1 0.19/0.50 # Backward-rewritten : 24 0.19/0.50 # Generated clauses : 128 0.19/0.50 # ...of the previous two non-redundant : 102 0.19/0.50 # ...aggressively subsumed : 0 0.19/0.50 # Contextual simplify-reflections : 3 0.19/0.50 # Paramodulations : 73 0.19/0.50 # Factorizations : 29 0.19/0.50 # NegExts : 0 0.19/0.50 # Equation resolutions : 39 0.19/0.50 # Propositional unsat checks : 0 0.19/0.50 # Propositional check models : 0 0.19/0.50 # Propositional check unsatisfiable : 0 0.19/0.50 # Propositional clauses : 0 0.19/0.50 # Propositional clauses after purity: 0 0.19/0.50 # Propositional unsat core size : 0 0.19/0.50 # Propositional preprocessing time : 0.000 0.19/0.50 # Propositional encoding time : 0.000 0.19/0.50 # Propositional solver time : 0.000 0.19/0.50 # Success case prop preproc time : 0.000 0.19/0.50 # Success case prop encoding time : 0.000 0.19/0.50 # Success case prop solver time : 0.000 0.19/0.50 # Current number of processed clauses : 63 0.19/0.50 # Positive orientable unit clauses : 10 0.19/0.50 # Positive unorientable unit clauses: 1 0.19/0.50 # Negative unit clauses : 12 0.19/0.50 # Non-unit-clauses : 40 0.19/0.50 # Current number of unprocessed clauses: 56 0.19/0.50 # ...number of literals in the above : 180 0.19/0.50 # Current number of archived formulas : 0 0.19/0.50 # Current number of archived clauses : 103 0.19/0.50 # Clause-clause subsumption calls (NU) : 892 0.19/0.50 # Rec. Clause-clause subsumption calls : 568 0.19/0.50 # Non-unit clause-clause subsumptions : 71 0.19/0.50 # Unit Clause-clause subsumption calls : 54 0.19/0.50 # Rewrite failures with RHS unbound : 0 0.19/0.50 # BW rewrite match attempts : 27 0.19/0.50 # BW rewrite match successes : 26 0.19/0.50 # Condensation attempts : 0 0.19/0.50 # Condensation successes : 0 0.19/0.50 # Termbank termtop insertions : 7130 0.19/0.50 0.19/0.50 # ------------------------------------------------- 0.19/0.50 # User time : 0.017 s 0.19/0.50 # System time : 0.004 s 0.19/0.50 # Total time : 0.021 s 0.19/0.50 # Maximum resident set size: 2100 pages 0.19/0.50 0.19/0.50 # ------------------------------------------------- 0.19/0.50 # User time : 0.018 s 0.19/0.50 # System time : 0.008 s 0.19/0.50 # Total time : 0.026 s 0.19/0.50 # Maximum resident set size: 1756 pages 0.19/0.50 EOF