0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.11/0.37 % Computer : n003.cluster.edu 0.11/0.37 % Model : x86_64 x86_64 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.37 % Memory : 8046.5625MB 0.11/0.37 % OS : Linux 6.8.0-71-generic 0.11/0.37 % CPULimit : 1440 0.11/0.37 % WCLimit : 180 0.11/0.37 % DateTime : Mon Jul 27 09:33:08 UTC 2026 0.11/0.37 % CPUTime : 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.14/0.43 Running first-order theorem proving 0.14/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/benchmark/theBenchmark.p 17.02/2.68 % Version: 3.5.1 17.02/2.68 % Preprocessing class: FSMSSLSSSSSNFFN. 17.02/2.68 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 17.02/2.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 900s (5) cores 17.02/2.68 % Starting new_bool_3 with 180s (1) cores 17.02/2.68 % Starting new_bool_1 with 180s (1) cores 17.02/2.68 % Starting sh5l with 180s (1) cores 17.02/2.68 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 3774883 completed with status 0 17.02/2.68 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 17.02/2.68 % Preprocessing class: FSMSSLSSSSSNFFN. 17.02/2.68 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 17.02/2.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 900s (5) cores 17.02/2.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 17.02/2.68 % No SInE strategy applied 17.02/2.68 % Search class: FGHSS-FFMM21-MFFFFFNN 17.02/2.68 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 17.02/2.68 % Starting SubtermCWHack with 82s (1) cores 17.02/2.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 91s (1) cores 17.02/2.68 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 82s (1) cores 17.02/2.68 % Starting new_bool_3 with 82s (1) cores 17.02/2.68 % Starting new_bool_1 with 82s (1) cores 17.02/2.68 % new_bool_3 with pid 3774890 completed with status 0 17.02/2.68 % Result found by new_bool_3 17.02/2.68 % Preprocessing class: FSMSSLSSSSSNFFN. 17.02/2.68 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 17.02/2.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 900s (5) cores 17.02/2.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 17.02/2.68 % No SInE strategy applied 17.02/2.68 % Search class: FGHSS-FFMM21-MFFFFFNN 17.02/2.68 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 17.02/2.68 % Starting SubtermCWHack with 82s (1) cores 17.02/2.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 91s (1) cores 17.02/2.68 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 82s (1) cores 17.02/2.68 % Starting new_bool_3 with 82s (1) cores 17.02/2.68 % Preprocessing time : 0.001 s 17.02/2.68 % Presaturation interreduction done 17.02/2.68 17.02/2.68 % Proof found! 17.02/2.68 % SZS status Theorem 17.02/2.68 % SZS output start CNFRefutation 17.02/2.68 fof(queens_q, axiom, (![X1, X2]:((((q(X2)!=q(X1)&plus(q(X2),X2)!=plus(q(X1),X1))&minus(q(X1),X1)!=minus(q(X2),X2))<=((((le(s(n0),X1)&le(X2,n))&(le(s(perm(X2)),perm(X1))<=>le(s(X1),X2)))&le(s(X1),X2))&le(X1,n))))=>queens_q), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', queens_q)). 17.02/2.68 fof(queens_sym, conjecture, ((queens_p&![X1]:(p(perm(X1))=q(X1)))=>queens_q), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', queens_sym)). 17.02/2.68 fof(le_trans, axiom, ![X3, X4, X5]:(((le(X3,X4)&le(X4,X5))=>le(X3,X5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', le_trans)). 17.02/2.68 fof(succ_le, axiom, ![X3]:(le(X3,s(X3))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', succ_le)). 17.02/2.68 fof(permutation, axiom, ![X1]:(perm(X1)=minus(s(n),X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', permutation)). 17.02/2.68 fof(plus1, axiom, ![X1, X2, X6, X7]:((minus(X7,X2)=minus(X1,X6)<=>plus(X6,X7)=plus(X1,X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', plus1)). 17.02/2.68 fof(queens_p, axiom, (![X1, X2]:((((plus(p(X1),X1)!=plus(p(X2),X2)&minus(p(X2),X2)!=minus(p(X1),X1))&p(X2)!=p(X1))<=(((le(s(n0),X1)&le(X1,n))&le(s(X1),X2))&le(X2,n))))<=queens_p), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', queens_p)). 17.02/2.68 fof(permutation_range, axiom, ![X1]:(((le(X1,n)&le(s(n0),X1))=>(le(perm(X1),n)&le(s(n0),perm(X1))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', permutation_range)). 17.02/2.68 fof(permutation_another_one, axiom, ![X2, X1]:(minus(perm(X2),perm(X1))=minus(X1,X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', permutation_another_one)). 17.02/2.68 fof(minus1, axiom, ![X1, X2, X6, X7]:((minus(X2,X7)=minus(X1,X6)<=>minus(X1,X2)=minus(X6,X7))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', minus1)). 17.02/2.68 fof(c_0_10, plain, (![X1, X2]:((((((le(s(n0),X1)&le(X2,n))&(le(s(perm(X2)),perm(X1))<=>le(s(X1),X2)))&le(s(X1),X2))&le(X1,n))=>((q(X2)!=q(X1)&plus(q(X2),X2)!=plus(q(X1),X1))&minus(q(X1),X1)!=minus(q(X2),X2))))=>queens_q), inference(fof_simplification,[status(thm)],[queens_q])). 17.02/2.68 fof(c_0_11, negated_conjecture, ~(((queens_p&![X1]:(p(perm(X1))=q(X1)))=>queens_q)), inference(assume_negation,[status(cth)],[queens_sym])). 17.02/2.68 fof(c_0_12, plain, ((((((le(s(n0),esk1_0)|queens_q)&(le(esk2_0,n)|queens_q))&((~le(s(perm(esk2_0)),perm(esk1_0))|le(s(esk1_0),esk2_0)|queens_q)&(~le(s(esk1_0),esk2_0)|le(s(perm(esk2_0)),perm(esk1_0))|queens_q)))&(le(s(esk1_0),esk2_0)|queens_q))&(le(esk1_0,n)|queens_q))&(q(esk2_0)=q(esk1_0)|plus(q(esk2_0),esk2_0)=plus(q(esk1_0),esk1_0)|minus(q(esk1_0),esk1_0)=minus(q(esk2_0),esk2_0)|queens_q)), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])). 17.02/2.68 fof(c_0_13, negated_conjecture, ![X28]:(((queens_p&p(perm(X28))=q(X28))&~queens_q)), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])). 17.02/2.68 fof(c_0_14, plain, ![X10, X11, X12]:((~le(X10,X11)|~le(X11,X12)|le(X10,X12))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[le_trans])])])). 17.02/2.68 cnf(c_0_15, plain, (le(s(esk1_0),esk2_0)|queens_q), inference(split_conjunct,[status(thm)],[c_0_12])). 17.02/2.68 cnf(c_0_16, negated_conjecture, (~queens_q), inference(split_conjunct,[status(thm)],[c_0_13])). 17.02/2.68 cnf(c_0_17, plain, (le(X1,X3)|~le(X1,X2)|~le(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_14])). 17.02/2.68 cnf(c_0_18, plain, (le(s(esk1_0),esk2_0)), inference(sr,[status(thm)],[c_0_15, c_0_16])). 17.02/2.68 fof(c_0_19, plain, ![X25]:(le(X25,s(X25))), inference(variable_rename,[status(thm)],[succ_le])). 17.02/2.68 fof(c_0_20, plain, ![X26]:(perm(X26)=minus(s(n),X26)), inference(variable_rename,[status(thm)],[permutation])). 17.02/2.68 cnf(c_0_21, plain, (le(X1,esk2_0)|~le(X1,s(esk1_0))), inference(spm,[status(thm)],[c_0_17, c_0_18])). 17.02/2.68 cnf(c_0_22, plain, (le(X1,s(X1))), inference(split_conjunct,[status(thm)],[c_0_19])). 17.02/2.68 cnf(c_0_23, plain, (q(esk2_0)=q(esk1_0)|plus(q(esk2_0),esk2_0)=plus(q(esk1_0),esk1_0)|minus(q(esk1_0),esk1_0)=minus(q(esk2_0),esk2_0)|queens_q), inference(split_conjunct,[status(thm)],[c_0_12])). 17.02/2.68 cnf(c_0_24, negated_conjecture, (p(perm(X1))=q(X1)), inference(split_conjunct,[status(thm)],[c_0_13])). 17.02/2.68 cnf(c_0_25, plain, (perm(X1)=minus(s(n),X1)), inference(split_conjunct,[status(thm)],[c_0_20])). 17.02/2.68 fof(c_0_26, plain, ![X13, X14, X15, X16]:(((minus(X16,X14)!=minus(X13,X15)|plus(X15,X16)=plus(X13,X14))&(plus(X15,X16)!=plus(X13,X14)|minus(X16,X14)=minus(X13,X15)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus1])])])). 17.02/2.68 fof(c_0_27, plain, (queens_p=>![X1, X2]:(((((le(s(n0),X1)&le(X1,n))&le(s(X1),X2))&le(X2,n))=>((plus(p(X1),X1)!=plus(p(X2),X2)&minus(p(X2),X2)!=minus(p(X1),X1))&p(X2)!=p(X1))))), inference(fof_simplification,[status(thm)],[queens_p])). 17.02/2.68 fof(c_0_28, plain, ![X27]:(((le(perm(X27),n)|(~le(X27,n)|~le(s(n0),X27)))&(le(s(n0),perm(X27))|(~le(X27,n)|~le(s(n0),X27))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[permutation_range])])])])). 17.02/2.68 cnf(c_0_29, plain, (le(esk1_0,esk2_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])). 17.02/2.68 cnf(c_0_30, plain, (le(s(n0),esk1_0)|queens_q), inference(split_conjunct,[status(thm)],[c_0_12])). 17.02/2.68 cnf(c_0_31, negated_conjecture, (p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|plus(p(minus(s(n),esk2_0)),esk2_0)=plus(p(minus(s(n),esk1_0)),esk1_0)|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|queens_q), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24]), c_0_24]), c_0_24]), c_0_24]), c_0_24]), c_0_24]), c_0_25]), c_0_25]), c_0_25]), c_0_25]), c_0_25]), c_0_25])). 17.02/2.68 cnf(c_0_32, plain, (plus(X4,X1)=plus(X3,X2)|minus(X1,X2)!=minus(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_26])). 17.02/2.68 fof(c_0_33, plain, ![X8, X9]:((((plus(p(X8),X8)!=plus(p(X9),X9)|(~le(s(n0),X8)|~le(X8,n)|~le(s(X8),X9)|~le(X9,n))|~queens_p)&(minus(p(X9),X9)!=minus(p(X8),X8)|(~le(s(n0),X8)|~le(X8,n)|~le(s(X8),X9)|~le(X9,n))|~queens_p))&(p(X9)!=p(X8)|(~le(s(n0),X8)|~le(X8,n)|~le(s(X8),X9)|~le(X9,n))|~queens_p))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])])])). 17.02/2.68 cnf(c_0_34, plain, (le(perm(X1),n)|~le(X1,n)|~le(s(n0),X1)), inference(split_conjunct,[status(thm)],[c_0_28])). 17.02/2.68 cnf(c_0_35, plain, (le(esk2_0,n)|queens_q), inference(split_conjunct,[status(thm)],[c_0_12])). 17.02/2.68 cnf(c_0_36, plain, (le(X1,esk2_0)|~le(X1,esk1_0)), inference(spm,[status(thm)],[c_0_17, c_0_29])). 17.02/2.68 cnf(c_0_37, plain, (le(s(n0),esk1_0)), inference(sr,[status(thm)],[c_0_30, c_0_16])). 17.02/2.68 cnf(c_0_38, plain, (le(s(n0),perm(X1))|~le(X1,n)|~le(s(n0),X1)), inference(split_conjunct,[status(thm)],[c_0_28])). 17.02/2.68 fof(c_0_39, plain, ![X17, X18]:(minus(perm(X17),perm(X18))=minus(X18,X17)), inference(variable_rename,[status(thm)],[permutation_another_one])). 17.02/2.68 cnf(c_0_40, negated_conjecture, (minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|plus(p(minus(s(n),esk2_0)),esk2_0)=plus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))), inference(sr,[status(thm)],[c_0_31, c_0_16])). 17.02/2.68 cnf(c_0_41, plain, (plus(X1,X2)=plus(X2,X1)), inference(er,[status(thm)],[c_0_32])). 17.02/2.68 cnf(c_0_42, plain, (minus(p(X1),X1)!=minus(p(X2),X2)|~le(s(n0),X2)|~le(X2,n)|~le(s(X2),X1)|~le(X1,n)|~queens_p), inference(split_conjunct,[status(thm)],[c_0_33])). 17.02/2.68 cnf(c_0_43, negated_conjecture, (queens_p), inference(split_conjunct,[status(thm)],[c_0_13])). 17.02/2.68 cnf(c_0_44, plain, (le(minus(s(n),X1),n)|~le(X1,n)|~le(s(n0),X1)), inference(rw,[status(thm)],[c_0_34, c_0_25])). 17.02/2.68 cnf(c_0_45, plain, (le(esk2_0,n)), inference(sr,[status(thm)],[c_0_35, c_0_16])). 17.02/2.68 cnf(c_0_46, plain, (le(s(n0),esk2_0)), inference(spm,[status(thm)],[c_0_36, c_0_37])). 17.02/2.68 cnf(c_0_47, plain, (le(s(n0),minus(s(n),X1))|~le(X1,n)|~le(s(n0),X1)), inference(rw,[status(thm)],[c_0_38, c_0_25])). 17.02/2.68 cnf(c_0_48, plain, (le(esk1_0,n)|queens_q), inference(split_conjunct,[status(thm)],[c_0_12])). 17.02/2.68 cnf(c_0_49, plain, (le(s(perm(esk2_0)),perm(esk1_0))|queens_q|~le(s(esk1_0),esk2_0)), inference(split_conjunct,[status(thm)],[c_0_12])). 17.02/2.68 fof(c_0_50, plain, ![X19, X20, X21, X22]:(((minus(X20,X22)!=minus(X19,X21)|minus(X19,X20)=minus(X21,X22))&(minus(X19,X20)!=minus(X21,X22)|minus(X20,X22)=minus(X19,X21)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[minus1])])])). 17.02/2.68 cnf(c_0_51, plain, (minus(perm(X1),perm(X2))=minus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_39])). 17.02/2.68 cnf(c_0_52, plain, (minus(X2,X4)=minus(X3,X1)|plus(X1,X2)!=plus(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_26])). 17.02/2.68 cnf(c_0_53, negated_conjecture, (minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|plus(esk2_0,p(minus(s(n),esk2_0)))=plus(esk1_0,p(minus(s(n),esk1_0)))|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41]), c_0_41])). 17.02/2.68 cnf(c_0_54, plain, (minus(p(X1),X1)!=minus(p(X2),X2)|~le(s(n0),X2)|~le(s(X2),X1)|~le(X2,n)|~le(X1,n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42, c_0_43])])). 17.02/2.68 cnf(c_0_55, plain, (le(minus(s(n),esk2_0),n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_46])])). 17.02/2.68 cnf(c_0_56, plain, (le(s(n0),minus(s(n),esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_45]), c_0_46])])). 17.02/2.68 cnf(c_0_57, plain, (le(esk1_0,n)), inference(sr,[status(thm)],[c_0_48, c_0_16])). 17.02/2.68 cnf(c_0_58, plain, (queens_q|le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))|~le(s(esk1_0),esk2_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49, c_0_25]), c_0_25])). 17.02/2.68 cnf(c_0_59, plain, (minus(X3,X1)=minus(X4,X2)|minus(X1,X2)!=minus(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_50])). 17.02/2.68 cnf(c_0_60, plain, (minus(minus(s(n),X1),minus(s(n),X2))=minus(X2,X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51, c_0_25]), c_0_25])). 17.02/2.68 cnf(c_0_61, negated_conjecture, (minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(p(minus(s(n),esk2_0)),X1)=minus(X2,esk2_0)|plus(esk1_0,p(minus(s(n),esk1_0)))!=plus(X2,X1)), inference(spm,[status(thm)],[c_0_52, c_0_53])). 17.02/2.68 cnf(c_0_62, plain, (minus(p(X1),X1)!=minus(p(minus(s(n),esk2_0)),minus(s(n),esk2_0))|~le(s(minus(s(n),esk2_0)),X1)|~le(X1,n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_55]), c_0_56])])). 17.02/2.68 cnf(c_0_63, plain, (le(minus(s(n),esk1_0),n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_57]), c_0_37])])). 17.02/2.68 cnf(c_0_64, plain, (le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58, c_0_18])]), c_0_16])). 17.02/2.68 cnf(c_0_65, plain, (minus(X1,minus(s(n),X2))=minus(X3,minus(s(n),X4))|minus(X4,X2)!=minus(X1,X3)), inference(spm,[status(thm)],[c_0_59, c_0_60])). 17.02/2.68 cnf(c_0_66, negated_conjecture, (minus(p(minus(s(n),esk2_0)),p(minus(s(n),esk1_0)))=minus(esk1_0,esk2_0)|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))), inference(er,[status(thm)],[c_0_61])). 17.02/2.68 cnf(c_0_67, plain, (minus(p(minus(s(n),esk2_0)),minus(s(n),esk2_0))!=minus(p(minus(s(n),esk1_0)),minus(s(n),esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62, c_0_63]), c_0_64])])). 17.02/2.68 cnf(c_0_68, plain, (minus(X1,minus(s(n),X2))=minus(X2,minus(s(n),X1))), inference(er,[status(thm)],[c_0_65])). 17.02/2.68 cnf(c_0_69, negated_conjecture, (minus(p(minus(s(n),esk2_0)),minus(s(n),X1))=minus(p(minus(s(n),esk1_0)),minus(s(n),X2))|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(X2,X1)!=minus(esk1_0,esk2_0)), inference(spm,[status(thm)],[c_0_65, c_0_66])). 17.02/2.68 cnf(c_0_70, plain, (minus(esk2_0,minus(s(n),p(minus(s(n),esk2_0))))!=minus(esk1_0,minus(s(n),p(minus(s(n),esk1_0))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67, c_0_68]), c_0_68])). 17.02/2.68 cnf(c_0_71, negated_conjecture, (minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_69]), c_0_68]), c_0_68]), c_0_70])). 17.02/2.68 cnf(c_0_72, negated_conjecture, (p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(p(minus(s(n),esk2_0)),X1)=minus(esk2_0,X2)|minus(X1,X2)!=minus(p(minus(s(n),esk1_0)),esk1_0)), inference(spm,[status(thm)],[c_0_59, c_0_71])). 17.02/2.68 cnf(c_0_73, plain, (plus(p(X1),X1)!=plus(p(X2),X2)|~le(s(n0),X1)|~le(X1,n)|~le(s(X1),X2)|~le(X2,n)|~queens_p), inference(split_conjunct,[status(thm)],[c_0_33])). 17.02/2.68 cnf(c_0_74, plain, (plus(X1,minus(s(n),X2))=plus(X3,minus(s(n),X4))|minus(X2,X4)!=minus(X1,X3)), inference(spm,[status(thm)],[c_0_32, c_0_60])). 17.02/2.68 cnf(c_0_75, negated_conjecture, (minus(p(minus(s(n),esk2_0)),p(minus(s(n),esk1_0)))=minus(esk2_0,esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))), inference(er,[status(thm)],[c_0_72])). 17.02/2.68 cnf(c_0_76, plain, (plus(p(X1),X1)!=plus(p(X2),X2)|~le(s(n0),X1)|~le(s(X1),X2)|~le(X2,n)|~le(X1,n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73, c_0_43])])). 17.02/2.68 cnf(c_0_77, negated_conjecture, (plus(p(minus(s(n),esk2_0)),minus(s(n),X1))=plus(p(minus(s(n),esk1_0)),minus(s(n),X2))|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(X1,X2)!=minus(esk2_0,esk1_0)), inference(spm,[status(thm)],[c_0_74, c_0_75])). 17.02/2.68 cnf(c_0_78, plain, (plus(X1,p(X1))!=plus(X2,p(X2))|~le(s(n0),X1)|~le(s(X1),X2)|~le(X2,n)|~le(X1,n)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76, c_0_41]), c_0_41])). 17.02/2.68 cnf(c_0_79, negated_conjecture, (plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))=plus(minus(s(n),esk1_0),p(minus(s(n),esk1_0)))|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_77]), c_0_41]), c_0_41])). 17.02/2.68 cnf(c_0_80, plain, (p(X1)!=p(X2)|~le(s(n0),X2)|~le(X2,n)|~le(s(X2),X1)|~le(X1,n)|~queens_p), inference(split_conjunct,[status(thm)],[c_0_33])). 17.02/2.68 cnf(c_0_81, negated_conjecture, (p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|plus(minus(s(n),esk1_0),p(minus(s(n),esk1_0)))!=plus(X1,p(X1))|~le(s(minus(s(n),esk2_0)),X1)|~le(X1,n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78, c_0_79]), c_0_56]), c_0_55])])). 17.02/2.68 cnf(c_0_82, plain, (p(X1)!=p(X2)|~le(s(n0),X2)|~le(s(X2),X1)|~le(X2,n)|~le(X1,n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80, c_0_43])])). 17.02/2.68 cnf(c_0_83, negated_conjecture, (p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_81]), c_0_64]), c_0_63])])). 17.02/2.68 cnf(c_0_84, negated_conjecture, (p(X1)!=p(minus(s(n),esk1_0))|~le(s(minus(s(n),esk2_0)),X1)|~le(X1,n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82, c_0_83]), c_0_56]), c_0_55])])). 17.02/2.68 cnf(c_0_85, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_84]), c_0_64]), c_0_63])]), ['proof']). 17.02/2.68 % SZS output end CNFRefutation 17.02/2.68 % Parsed axioms : 10 17.02/2.68 % Removed by relevancy pruning/SinE : 0 17.02/2.68 % Initial clauses : 23 17.02/2.68 % Removed in clause preprocessing : 2 17.02/2.68 % Initial clauses in saturation : 21 17.02/2.68 % Processed clauses : 29281 17.02/2.68 % ...of these trivial : 5870 17.02/2.68 % ...subsumed : 19417 17.02/2.68 % ...remaining for further processing : 3994 17.02/2.68 % Other redundant clauses eliminated : 0 17.02/2.68 % Clauses deleted for lack of memory : 0 17.02/2.68 % Backward-subsumed : 327 17.02/2.68 % Backward-rewritten : 959 17.02/2.68 % Generated clauses : 61449 17.02/2.68 % ...of the previous two non-redundant : 53190 17.02/2.68 % ...aggressively subsumed : 0 17.02/2.68 % Contextual simplify-reflections : 0 17.02/2.68 % Paramodulations : 60936 17.02/2.68 % Factorizations : 0 17.02/2.68 % NegExts : 0 17.02/2.68 % Equation resolutions : 513 17.02/2.68 % Disequality decompositions : 0 17.02/2.68 % Total rewrite steps : 43981 17.02/2.68 % ...of those cached : 41659 17.02/2.68 % Propositional unsat checks : 0 17.02/2.68 % Propositional check models : 0 17.02/2.68 % Propositional check unsatisfiable : 0 17.02/2.68 % Propositional clauses : 0 17.02/2.68 % Propositional clauses after purity: 0 17.02/2.68 % Propositional unsat core size : 0 17.02/2.68 % Propositional preprocessing time : 0.000 17.02/2.68 % Propositional encoding time : 0.000 17.02/2.68 % Propositional solver time : 0.000 17.02/2.68 % Success case prop preproc time : 0.000 17.02/2.68 % Success case prop encoding time : 0.000 17.02/2.68 % Success case prop solver time : 0.000 17.02/2.68 % Current number of processed clauses : 2689 17.02/2.68 % Positive orientable unit clauses : 1044 17.02/2.68 % Positive unorientable unit clauses: 11 17.02/2.68 % Negative unit clauses : 22 17.02/2.68 % Non-unit-clauses : 1612 17.02/2.68 % Current number of unprocessed clauses: 20327 17.02/2.68 % ...number of literals in the above : 37820 17.02/2.68 % Current number of archived formulas : 0 17.02/2.68 % Current number of archived clauses : 1307 17.02/2.68 % Clause-clause subsumption calls (NU) : 1986882 17.02/2.68 % Rec. Clause-clause subsumption calls : 1911013 17.02/2.68 % Non-unit clause-clause subsumptions : 18291 17.02/2.68 % Unit Clause-clause subsumption calls : 4911 17.02/2.68 % Rewrite failures with RHS unbound : 578 17.02/2.68 % BW rewrite match attempts : 79201 17.02/2.68 % BW rewrite match successes : 279 17.02/2.68 % Condensation attempts : 0 17.02/2.68 % Condensation successes : 0 17.02/2.68 % Termbank termtop insertions : 1562495 17.02/2.68 % Search garbage collected termcells : 357 17.02/2.68 17.02/2.68 % ------------------------------------------------- 17.02/2.68 % User time : 1.984 s 17.02/2.68 % System time : 0.036 s 17.02/2.68 % Total time : 2.020 s 17.02/2.68 % Maximum resident set size: 3644 pages 17.02/2.68 17.02/2.68 % ------------------------------------------------- 17.02/2.68 % User time : 10.435 s 17.02/2.68 % System time : 0.292 s 17.02/2.68 % Total time : 10.727 s 17.02/2.68 % Maximum resident set size: 4864 pages 17.02/2.68 % E exiting 17.02/2.68 EOF