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 : n019.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 10:08:22 UTC 2026 0.11/0.37 % CPUTime : 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.11/0.42 Running first-order theorem proving 0.11/0.42 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 0.34/0.46 % Version: 3.5.1 0.34/0.46 % Preprocessing class: FSMSSMSSSSSNFFN. 0.34/0.46 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.34/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.34/0.46 % Starting new_bool_3 with 180s (1) cores 0.34/0.46 % Starting new_bool_1 with 180s (1) cores 0.34/0.46 % Starting sh5l with 180s (1) cores 0.34/0.46 % sh5l with pid 2295847 completed with status 0 0.34/0.46 % Result found by sh5l 0.34/0.46 % Preprocessing class: FSMSSMSSSSSNFFN. 0.34/0.46 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.34/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.34/0.46 % Starting new_bool_3 with 180s (1) cores 0.34/0.46 % Starting new_bool_1 with 180s (1) cores 0.34/0.46 % Starting sh5l with 180s (1) cores 0.34/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000) 0.34/0.46 % SinE strategy is gf500_gu_R04_F100_L20000 0.34/0.46 % Search class: FGHSM-FFMM31-MFFFFFNN 0.34/0.46 % Scheduled 13 strats onto 1 cores with 180 seconds (180 total) 0.34/0.46 % Starting SubtermCWHack with 17s (1) cores 0.34/0.46 % SubtermCWHack with pid 2295851 completed with status 0 0.34/0.46 % Result found by SubtermCWHack 0.34/0.46 % Preprocessing class: FSMSSMSSSSSNFFN. 0.34/0.46 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.34/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.34/0.46 % Starting new_bool_3 with 180s (1) cores 0.34/0.46 % Starting new_bool_1 with 180s (1) cores 0.34/0.46 % Starting sh5l with 180s (1) cores 0.34/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000) 0.34/0.46 % SinE strategy is gf500_gu_R04_F100_L20000 0.34/0.46 % Search class: FGHSM-FFMM31-MFFFFFNN 0.34/0.46 % Scheduled 13 strats onto 1 cores with 180 seconds (180 total) 0.34/0.46 % Starting SubtermCWHack with 17s (1) cores 0.34/0.46 % Preprocessing time : 0.002 s 0.34/0.46 0.34/0.46 % Proof found! 0.34/0.46 % SZS status Theorem 0.34/0.46 % SZS output start CNFRefutation 0.34/0.46 fof(prop_false, axiom, ![X7]:((~(bool(X7))<=>prop(X7)=false)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', prop_false)). 0.34/0.46 fof(def_f7, axiom, ![X1]:(f7(X1)=lazy_impl(prop(X1),X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_f7)). 0.34/0.46 fof(lazy_impl_axiom2, axiom, ![X6]:(true=lazy_impl(false,X6)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', lazy_impl_axiom2)). 0.34/0.46 fof(def_forallprefers, axiom, ![X7, X10]:((forallprefers(X7,X10)<=>((((bool(X10)&~(bool(X7)))&d(X10))&d(X7))|(false=X7&true=X10)|(~(d(X7))&d(X10))))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_forallprefers)). 0.34/0.46 fof(def_false2, axiom, ?[X1]:((~(?[X8]:(forallprefers(f7(X8),f7(X1))))&false2=phi(f7(X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_false2)). 0.34/0.46 fof(prop_true, axiom, ![X7]:((prop(X7)=true<=>bool(X7))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', prop_true)). 0.34/0.46 fof(lazy_impl_axiom3, axiom, ![X6]:(lazy_impl(true,X6)=phi(X6)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', lazy_impl_axiom3)). 0.34/0.46 fof(def_phi, axiom, ![X7]:(((phi(X7)=X7&d(X7))|(err=phi(X7)&~(d(X7))))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_phi)). 0.34/0.46 fof(not1_not2, conjecture, ![X1]:(not1(X1)=not2(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', not1_not2)). 0.34/0.46 fof(false_true_err_in_d, axiom, ((d(false)&d(err))&d(true)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', false_true_err_in_d)). 0.34/0.46 fof(def_not2, axiom, ![X1]:(not2(X1)=impl(X1,false2)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_not2)). 0.34/0.46 fof(not1_axiom1, axiom, ![X5]:((~(bool(X5))=>not1(X5)=phi(X5))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', not1_axiom1)). 0.34/0.46 fof(impl_axiom1, axiom, ![X5, X6]:((impl(X5,X6)=phi(X5)<=~(bool(X5)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', impl_axiom1)). 0.34/0.46 fof(def_bool, axiom, ![X7]:(((true=X7|X7=false)<=>bool(X7))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_bool)). 0.34/0.46 fof(impl_axiom3, axiom, ![X6]:((impl(false,X6)=true<=bool(X6))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', impl_axiom3)). 0.34/0.46 fof(impl_axiom2, axiom, ![X5, X6]:(((bool(X5)&~(bool(X6)))=>phi(X6)=impl(X5,X6))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', impl_axiom2)). 0.34/0.46 fof(not1_axiom2, axiom, not1(false)=true, file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', not1_axiom2)). 0.34/0.46 fof(not1_axiom3, axiom, false=not1(true), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', not1_axiom3)). 0.34/0.46 fof(impl_axiom4, axiom, ![X6]:((bool(X6)=>X6=impl(true,X6))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', impl_axiom4)). 0.34/0.46 fof(c_0_19, plain, ![X7]:((~bool(X7)<=>prop(X7)=false)), inference(fof_simplification,[status(thm)],[prop_false])). 0.34/0.46 fof(c_0_20, plain, ![X63]:(f7(X63)=lazy_impl(prop(X63),X63)), inference(variable_rename,[status(thm)],[def_f7])). 0.34/0.46 fof(c_0_21, plain, ![X45]:(((bool(X45)|prop(X45)=false)&(prop(X45)!=false|~bool(X45)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])). 0.34/0.46 fof(c_0_22, plain, ![X42]:(true=lazy_impl(false,X42)), inference(variable_rename,[status(thm)],[lazy_impl_axiom2])). 0.34/0.46 fof(c_0_23, plain, ![X7, X10]:((forallprefers(X7,X10)<=>((((bool(X10)&~bool(X7))&d(X10))&d(X7))|(false=X7&true=X10)|(~d(X7)&d(X10))))), inference(fof_simplification,[status(thm)],[def_forallprefers])). 0.34/0.46 fof(c_0_24, plain, ![X35]:((~forallprefers(f7(X35),f7(esk2_0))&false2=phi(f7(esk2_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)],[def_false2])])])])])). 0.34/0.46 cnf(c_0_25, plain, (f7(X1)=lazy_impl(prop(X1),X1)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.34/0.46 cnf(c_0_26, plain, (bool(X1)|prop(X1)=false), inference(split_conjunct,[status(thm)],[c_0_21])). 0.34/0.46 cnf(c_0_27, plain, (true=lazy_impl(false,X1)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.34/0.46 fof(c_0_28, plain, ![X36]:(((prop(X36)!=true|bool(X36))&(~bool(X36)|prop(X36)=true))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])])])). 0.34/0.46 fof(c_0_29, plain, ![X39]:(lazy_impl(true,X39)=phi(X39)), inference(variable_rename,[status(thm)],[lazy_impl_axiom3])). 0.34/0.46 fof(c_0_30, plain, ![X7]:(((phi(X7)=X7&d(X7))|(err=phi(X7)&~d(X7)))), inference(fof_simplification,[status(thm)],[def_phi])). 0.34/0.46 fof(c_0_31, plain, ![X40, X41]:((((((((~d(X40)|(false=X40|bool(X41))|~forallprefers(X40,X41))&(d(X41)|(false=X40|bool(X41))|~forallprefers(X40,X41)))&((~d(X40)|(true=X41|bool(X41))|~forallprefers(X40,X41))&(d(X41)|(true=X41|bool(X41))|~forallprefers(X40,X41))))&(((~d(X40)|(false=X40|~bool(X40))|~forallprefers(X40,X41))&(d(X41)|(false=X40|~bool(X40))|~forallprefers(X40,X41)))&((~d(X40)|(true=X41|~bool(X40))|~forallprefers(X40,X41))&(d(X41)|(true=X41|~bool(X40))|~forallprefers(X40,X41)))))&(((~d(X40)|(false=X40|d(X41))|~forallprefers(X40,X41))&(d(X41)|(false=X40|d(X41))|~forallprefers(X40,X41)))&((~d(X40)|(true=X41|d(X41))|~forallprefers(X40,X41))&(d(X41)|(true=X41|d(X41))|~forallprefers(X40,X41)))))&(((~d(X40)|(false=X40|d(X40))|~forallprefers(X40,X41))&(d(X41)|(false=X40|d(X40))|~forallprefers(X40,X41)))&((~d(X40)|(true=X41|d(X40))|~forallprefers(X40,X41))&(d(X41)|(true=X41|d(X40))|~forallprefers(X40,X41)))))&(((~bool(X41)|bool(X40)|~d(X41)|~d(X40)|forallprefers(X40,X41))&(false!=X40|true!=X41|forallprefers(X40,X41)))&(d(X40)|~d(X41)|forallprefers(X40,X41))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])])). 0.34/0.46 cnf(c_0_32, plain, (~forallprefers(f7(X1),f7(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.34/0.46 cnf(c_0_33, plain, (f7(X1)=true|bool(X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])). 0.34/0.46 fof(c_0_34, negated_conjecture, ~(![X1]:(not1(X1)=not2(X1))), inference(assume_negation,[status(cth)],[not1_not2])). 0.34/0.46 cnf(c_0_35, plain, (prop(X1)=true|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_28])). 0.34/0.46 cnf(c_0_36, plain, (lazy_impl(true,X1)=phi(X1)), inference(split_conjunct,[status(thm)],[c_0_29])). 0.34/0.46 fof(c_0_37, plain, ![X82]:((((err=phi(X82)|phi(X82)=X82)&(~d(X82)|phi(X82)=X82))&((err=phi(X82)|d(X82))&(~d(X82)|d(X82))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])])])). 0.34/0.46 cnf(c_0_38, plain, (d(X1)|forallprefers(X1,X2)|~d(X2)), inference(split_conjunct,[status(thm)],[c_0_31])). 0.34/0.46 cnf(c_0_39, plain, (bool(esk2_0)|~forallprefers(f7(X1),true)), inference(spm,[status(thm)],[c_0_32, c_0_33])). 0.34/0.46 cnf(c_0_40, plain, (d(true)), inference(split_conjunct,[status(thm)],[false_true_err_in_d])). 0.34/0.46 fof(c_0_41, negated_conjecture, not1(esk1_0)!=not2(esk1_0), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])). 0.34/0.46 fof(c_0_42, plain, ![X12]:(not2(X12)=impl(X12,false2)), inference(variable_rename,[status(thm)],[def_not2])). 0.34/0.46 fof(c_0_43, plain, ![X5]:((~bool(X5)=>not1(X5)=phi(X5))), inference(fof_simplification,[status(thm)],[not1_axiom1])). 0.34/0.46 fof(c_0_44, plain, ![X5, X6]:((~bool(X5)=>impl(X5,X6)=phi(X5))), inference(fof_simplification,[status(thm)],[impl_axiom1])). 0.34/0.46 cnf(c_0_45, plain, (false2=phi(f7(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.34/0.46 cnf(c_0_46, plain, (f7(X1)=phi(X1)|~bool(X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_35]), c_0_36])). 0.34/0.46 fof(c_0_47, plain, ![X38]:((((true!=X38|bool(X38))&(X38!=false|bool(X38)))&(~bool(X38)|(true=X38|X38=false)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])])])). 0.34/0.46 cnf(c_0_48, plain, (phi(X1)=X1|~d(X1)), inference(split_conjunct,[status(thm)],[c_0_37])). 0.34/0.46 cnf(c_0_49, plain, (d(f7(X1))|~d(f7(esk2_0))), inference(spm,[status(thm)],[c_0_32, c_0_38])). 0.34/0.46 cnf(c_0_50, plain, (d(f7(X1))|bool(esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_38]), c_0_40])])). 0.34/0.46 cnf(c_0_51, negated_conjecture, (not1(esk1_0)!=not2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_41])). 0.34/0.46 cnf(c_0_52, plain, (not2(X1)=impl(X1,false2)), inference(split_conjunct,[status(thm)],[c_0_42])). 0.34/0.46 fof(c_0_53, plain, ![X13]:((bool(X13)|not1(X13)=phi(X13))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])). 0.34/0.46 fof(c_0_54, plain, ![X26, X27]:((bool(X26)|impl(X26,X27)=phi(X26))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])). 0.34/0.46 cnf(c_0_55, plain, (phi(phi(esk2_0))=false2|~bool(esk2_0)), inference(spm,[status(thm)],[c_0_45, c_0_46])). 0.34/0.46 cnf(c_0_56, plain, (bool(esk2_0)|~bool(X1)|~forallprefers(phi(X1),true)), inference(spm,[status(thm)],[c_0_39, c_0_46])). 0.34/0.46 cnf(c_0_57, plain, (forallprefers(X1,X2)|false!=X1|true!=X2), inference(split_conjunct,[status(thm)],[c_0_31])). 0.34/0.46 cnf(c_0_58, plain, (bool(X1)|X1!=false), inference(split_conjunct,[status(thm)],[c_0_47])). 0.34/0.46 cnf(c_0_59, plain, (f7(esk2_0)=false2|~d(f7(esk2_0))), inference(spm,[status(thm)],[c_0_45, c_0_48])). 0.34/0.46 cnf(c_0_60, plain, (d(f7(X1))|~d(phi(esk2_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_46]), c_0_50])). 0.34/0.46 cnf(c_0_61, negated_conjecture, (not1(esk1_0)!=impl(esk1_0,false2)), inference(rw,[status(thm)],[c_0_51, c_0_52])). 0.34/0.46 cnf(c_0_62, plain, (bool(X1)|not1(X1)=phi(X1)), inference(split_conjunct,[status(thm)],[c_0_53])). 0.34/0.46 cnf(c_0_63, plain, (bool(X1)|impl(X1,X2)=phi(X1)), inference(split_conjunct,[status(thm)],[c_0_54])). 0.34/0.46 cnf(c_0_64, plain, (phi(esk2_0)=false2|~d(esk2_0)|~bool(esk2_0)), inference(spm,[status(thm)],[c_0_55, c_0_48])). 0.34/0.46 cnf(c_0_65, plain, (bool(esk2_0)|~d(X1)|~bool(X1)|~forallprefers(X1,true)), inference(spm,[status(thm)],[c_0_56, c_0_48])). 0.34/0.46 cnf(c_0_66, plain, (forallprefers(false,true)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_57])])). 0.34/0.46 cnf(c_0_67, plain, (d(false)), inference(split_conjunct,[status(thm)],[false_true_err_in_d])). 0.34/0.46 cnf(c_0_68, plain, (bool(false)), inference(er,[status(thm)],[c_0_58])). 0.34/0.46 cnf(c_0_69, plain, (f7(esk2_0)=false2|~d(phi(esk2_0))), inference(spm,[status(thm)],[c_0_59, c_0_60])). 0.34/0.46 cnf(c_0_70, plain, (true=X1|X1=false|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_47])). 0.34/0.46 cnf(c_0_71, negated_conjecture, (bool(esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61, c_0_62]), c_0_63])). 0.34/0.46 fof(c_0_72, plain, ![X6]:((bool(X6)=>impl(false,X6)=true)), inference(fof_simplification,[status(thm)],[impl_axiom3])). 0.34/0.46 cnf(c_0_73, plain, (esk2_0=false2|~d(esk2_0)|~bool(esk2_0)), inference(spm,[status(thm)],[c_0_48, c_0_64])). 0.34/0.46 cnf(c_0_74, plain, (bool(esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65, c_0_66]), c_0_67]), c_0_68])])). 0.34/0.46 fof(c_0_75, plain, ![X5, X6]:(((bool(X5)&~bool(X6))=>phi(X6)=impl(X5,X6))), inference(fof_simplification,[status(thm)],[impl_axiom2])). 0.34/0.46 cnf(c_0_76, plain, (phi(false2)=false2|~d(phi(esk2_0))), inference(spm,[status(thm)],[c_0_45, c_0_69])). 0.34/0.46 cnf(c_0_77, plain, (err=phi(X1)|d(X1)), inference(split_conjunct,[status(thm)],[c_0_37])). 0.34/0.46 cnf(c_0_78, plain, (d(err)), inference(split_conjunct,[status(thm)],[false_true_err_in_d])). 0.34/0.46 cnf(c_0_79, negated_conjecture, (esk1_0=false|esk1_0=true), inference(spm,[status(thm)],[c_0_70, c_0_71])). 0.34/0.46 cnf(c_0_80, plain, (not1(false)=true), inference(split_conjunct,[status(thm)],[not1_axiom2])). 0.34/0.46 fof(c_0_81, plain, ![X30]:((~bool(X30)|impl(false,X30)=true)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_72])])])). 0.34/0.46 cnf(c_0_82, plain, (esk2_0=false2|~d(esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73, c_0_74])])). 0.34/0.46 cnf(c_0_83, plain, (esk2_0=false|esk2_0=true), inference(spm,[status(thm)],[c_0_70, c_0_74])). 0.34/0.46 fof(c_0_84, plain, ![X28, X29]:((~bool(X28)|bool(X29)|phi(X29)=impl(X28,X29))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_75])])])). 0.34/0.46 cnf(c_0_85, plain, (phi(false2)=false2|d(esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76, c_0_77]), c_0_78])])). 0.34/0.46 cnf(c_0_86, negated_conjecture, (esk1_0=true|impl(false,false2)!=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61, c_0_79]), c_0_80])). 0.34/0.46 cnf(c_0_87, plain, (impl(false,X1)=true|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_81])). 0.34/0.46 cnf(c_0_88, plain, (~bool(esk2_0)|~forallprefers(f7(X1),phi(esk2_0))), inference(spm,[status(thm)],[c_0_32, c_0_46])). 0.34/0.46 cnf(c_0_89, plain, (esk2_0=true|false2=false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82, c_0_83]), c_0_67])])). 0.34/0.46 cnf(c_0_90, plain, (bool(X2)|phi(X2)=impl(X1,X2)|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_84])). 0.34/0.46 cnf(c_0_91, plain, (phi(false2)=false2), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76, c_0_48]), c_0_85])). 0.34/0.46 cnf(c_0_92, negated_conjecture, (esk1_0=true|~bool(false2)), inference(spm,[status(thm)],[c_0_86, c_0_87])). 0.34/0.46 cnf(c_0_93, plain, (d(esk2_0)|~bool(esk2_0)|~forallprefers(f7(X1),err)), inference(spm,[status(thm)],[c_0_88, c_0_77])). 0.34/0.46 cnf(c_0_94, plain, (false2=false|false2=true), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82, c_0_89]), c_0_40])])). 0.34/0.46 cnf(c_0_95, negated_conjecture, (esk1_0=true|false2!=true), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86, c_0_90]), c_0_91]), c_0_68])]), c_0_92])). 0.34/0.46 cnf(c_0_96, plain, (~d(esk2_0)|~bool(esk2_0)|~forallprefers(f7(X1),esk2_0)), inference(spm,[status(thm)],[c_0_88, c_0_48])). 0.34/0.46 cnf(c_0_97, plain, (d(f7(X1))|d(esk2_0)), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93, c_0_38]), c_0_78])]), c_0_50])). 0.34/0.46 cnf(c_0_98, negated_conjecture, (esk1_0=true), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92, c_0_94]), c_0_68])]), c_0_95])). 0.34/0.46 cnf(c_0_99, plain, (false=not1(true)), inference(split_conjunct,[status(thm)],[not1_axiom3])). 0.34/0.46 cnf(c_0_100, plain, (bool(X1)|true!=X1), inference(split_conjunct,[status(thm)],[c_0_47])). 0.34/0.46 cnf(c_0_101, plain, (d(f7(X1))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96, c_0_38]), c_0_50]), c_0_97])). 0.34/0.46 fof(c_0_102, plain, ![X17]:((~bool(X17)|X17=impl(true,X17))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom4])])])). 0.34/0.46 cnf(c_0_103, negated_conjecture, (impl(true,false2)!=false), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61, c_0_98]), c_0_99]), c_0_98])). 0.34/0.46 cnf(c_0_104, plain, (bool(true)), inference(er,[status(thm)],[c_0_100])). 0.34/0.46 cnf(c_0_105, plain, (~bool(X1)|~forallprefers(phi(X1),f7(esk2_0))), inference(spm,[status(thm)],[c_0_32, c_0_46])). 0.34/0.46 cnf(c_0_106, plain, (f7(esk2_0)=false2), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59, c_0_101])])). 0.34/0.46 cnf(c_0_107, plain, (X1=impl(true,X1)|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_102])). 0.34/0.46 cnf(c_0_108, negated_conjecture, (bool(false2)|false2!=false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103, c_0_90]), c_0_91]), c_0_104])])). 0.34/0.46 cnf(c_0_109, plain, (~bool(X1)|~forallprefers(phi(X1),false2)), inference(rw,[status(thm)],[c_0_105, c_0_106])). 0.34/0.46 cnf(c_0_110, negated_conjecture, (false2!=false), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103, c_0_107]), c_0_108])). 0.34/0.46 cnf(c_0_111, plain, (~d(X1)|~bool(X1)|~forallprefers(X1,false2)), inference(spm,[status(thm)],[c_0_109, c_0_48])). 0.34/0.46 cnf(c_0_112, plain, (false2=true), inference(sr,[status(thm)],[c_0_94, c_0_110])). 0.34/0.46 cnf(c_0_113, plain, (~d(X1)|~bool(X1)|~forallprefers(X1,true)), inference(rw,[status(thm)],[c_0_111, c_0_112])). 0.34/0.46 cnf(c_0_114, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113, c_0_66]), c_0_67]), c_0_68])]), ['proof']). 0.34/0.46 % SZS output end CNFRefutation 0.34/0.46 % Parsed axioms : 45 0.34/0.46 % Removed by relevancy pruning/SinE : 1 0.34/0.46 % Initial clauses : 98 0.34/0.46 % Removed in clause preprocessing : 5 0.34/0.46 % Initial clauses in saturation : 93 0.34/0.46 % Processed clauses : 360 0.34/0.46 % ...of these trivial : 10 0.34/0.46 % ...subsumed : 148 0.34/0.46 % ...remaining for further processing : 202 0.34/0.46 % Other redundant clauses eliminated : 8 0.34/0.46 % Clauses deleted for lack of memory : 0 0.34/0.46 % Backward-subsumed : 44 0.34/0.46 % Backward-rewritten : 74 0.34/0.46 % Generated clauses : 631 0.34/0.46 % ...of the previous two non-redundant : 490 0.34/0.46 % ...aggressively subsumed : 0 0.34/0.46 % Contextual simplify-reflections : 12 0.34/0.46 % Paramodulations : 617 0.34/0.46 % Factorizations : 6 0.34/0.46 % NegExts : 0 0.34/0.46 % Equation resolutions : 8 0.34/0.46 % Disequality decompositions : 0 0.34/0.46 % Total rewrite steps : 363 0.34/0.46 % ...of those cached : 340 0.34/0.46 % Propositional unsat checks : 0 0.34/0.46 % Propositional check models : 0 0.34/0.46 % Propositional check unsatisfiable : 0 0.34/0.46 % Propositional clauses : 0 0.34/0.46 % Propositional clauses after purity: 0 0.34/0.46 % Propositional unsat core size : 0 0.34/0.46 % Propositional preprocessing time : 0.000 0.34/0.46 % Propositional encoding time : 0.000 0.34/0.46 % Propositional solver time : 0.000 0.34/0.46 % Success case prop preproc time : 0.000 0.34/0.46 % Success case prop encoding time : 0.000 0.34/0.46 % Success case prop solver time : 0.000 0.34/0.46 % Current number of processed clauses : 78 0.34/0.46 % Positive orientable unit clauses : 24 0.34/0.46 % Positive unorientable unit clauses: 0 0.34/0.46 % Negative unit clauses : 8 0.34/0.46 % Non-unit-clauses : 46 0.34/0.46 % Current number of unprocessed clauses: 132 0.34/0.46 % ...number of literals in the above : 405 0.34/0.46 % Current number of archived formulas : 0 0.34/0.46 % Current number of archived clauses : 120 0.34/0.46 % Clause-clause subsumption calls (NU) : 2528 0.34/0.46 % Rec. Clause-clause subsumption calls : 2020 0.34/0.46 % Non-unit clause-clause subsumptions : 131 0.34/0.46 % Unit Clause-clause subsumption calls : 323 0.34/0.46 % Rewrite failures with RHS unbound : 0 0.34/0.46 % BW rewrite match attempts : 11 0.34/0.46 % BW rewrite match successes : 11 0.34/0.46 % Condensation attempts : 0 0.34/0.46 % Condensation successes : 0 0.34/0.46 % Termbank termtop insertions : 9532 0.34/0.46 % Search garbage collected termcells : 714 0.34/0.46 0.34/0.46 % ------------------------------------------------- 0.34/0.46 % User time : 0.020 s 0.34/0.46 % System time : 0.005 s 0.34/0.46 % Total time : 0.025 s 0.34/0.46 % Maximum resident set size: 3944 pages 0.34/0.46 0.34/0.46 % ------------------------------------------------- 0.34/0.46 % User time : 0.022 s 0.34/0.46 % System time : 0.010 s 0.34/0.46 % Total time : 0.032 s 0.34/0.46 % Maximum resident set size: 4864 pages 0.34/0.46 % E exiting 0.34/0.47 EOF