TSTP Solution File: ALG020+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ALG020+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n028.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 : 600s
% DateTime : Thu Jul 14 16:51:11 EDT 2022
% Result : Theorem 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG020+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 8 19:00:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 109 Number of unprocessed: 109
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 109 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 41 conjectures.
% 0.19/0.37 # There are 41 start rule candidates:
% 0.19/0.37 # Found 101 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 41 start rule tableaux created.
% 0.19/0.37 # 8 extension rule candidate clauses
% 0.19/0.37 # 101 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.39 # There were 1 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 1 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 1 successful branch saturations after the branch.
% 0.19/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_101, negated_conjecture, (epred1_0)).
% 0.19/0.39 cnf(i_0_68, negated_conjecture, (h(j(e20))=e20)).
% 0.19/0.39 cnf(i_0_67, negated_conjecture, (h(j(e21))=e21)).
% 0.19/0.39 cnf(i_0_66, negated_conjecture, (h(j(e22))=e22)).
% 0.19/0.39 cnf(i_0_65, negated_conjecture, (h(j(e23))=e23)).
% 0.19/0.39 cnf(i_0_64, negated_conjecture, (j(h(e10))=e10)).
% 0.19/0.39 cnf(i_0_63, negated_conjecture, (j(h(e11))=e11)).
% 0.19/0.39 cnf(i_0_62, negated_conjecture, (j(h(e12))=e12)).
% 0.19/0.39 cnf(i_0_61, negated_conjecture, (j(h(e13))=e13)).
% 0.19/0.39 cnf(i_0_44, plain, (op1(e10,e10)=e10)).
% 0.19/0.39 cnf(i_0_43, plain, (op1(e10,e11)=e11)).
% 0.19/0.39 cnf(i_0_42, plain, (op1(e10,e12)=e12)).
% 0.19/0.39 cnf(i_0_41, plain, (op1(e10,e13)=e13)).
% 0.19/0.39 cnf(i_0_40, plain, (op1(e11,e10)=e11)).
% 0.19/0.39 cnf(i_0_39, plain, (op1(e11,e11)=e10)).
% 0.19/0.39 cnf(i_0_38, plain, (op1(e11,e12)=e13)).
% 0.19/0.39 cnf(i_0_37, plain, (op1(e11,e13)=e12)).
% 0.19/0.39 cnf(i_0_36, plain, (op1(e12,e10)=e12)).
% 0.19/0.39 cnf(i_0_35, plain, (op1(e12,e11)=e13)).
% 0.19/0.39 cnf(i_0_34, plain, (op1(e12,e12)=e10)).
% 0.19/0.39 cnf(i_0_33, plain, (op1(e12,e13)=e11)).
% 0.19/0.39 cnf(i_0_32, plain, (op1(e13,e10)=e13)).
% 0.19/0.39 cnf(i_0_31, plain, (op1(e13,e11)=e12)).
% 0.19/0.39 cnf(i_0_30, plain, (op1(e13,e12)=e11)).
% 0.19/0.39 cnf(i_0_29, plain, (op1(e13,e13)=e10)).
% 0.19/0.39 cnf(i_0_60, plain, (op2(e20,e20)=e20)).
% 0.19/0.39 cnf(i_0_59, plain, (op2(e20,e21)=e21)).
% 0.19/0.39 cnf(i_0_58, plain, (op2(e20,e22)=e22)).
% 0.19/0.39 cnf(i_0_57, plain, (op2(e20,e23)=e23)).
% 0.19/0.39 cnf(i_0_56, plain, (op2(e21,e20)=e21)).
% 0.19/0.39 cnf(i_0_55, plain, (op2(e21,e21)=e23)).
% 0.19/0.39 cnf(i_0_54, plain, (op2(e21,e22)=e20)).
% 0.19/0.39 cnf(i_0_53, plain, (op2(e21,e23)=e22)).
% 0.19/0.39 cnf(i_0_52, plain, (op2(e22,e20)=e22)).
% 0.19/0.39 cnf(i_0_51, plain, (op2(e22,e21)=e20)).
% 0.19/0.39 cnf(i_0_50, plain, (op2(e22,e22)=e23)).
% 0.19/0.39 cnf(i_0_49, plain, (op2(e22,e23)=e21)).
% 0.19/0.39 cnf(i_0_48, plain, (op2(e23,e20)=e23)).
% 0.19/0.39 cnf(i_0_47, plain, (op2(e23,e21)=e22)).
% 0.19/0.39 cnf(i_0_46, plain, (op2(e23,e22)=e21)).
% 0.19/0.39 cnf(i_0_45, plain, (op2(e23,e23)=e20)).
% 0.19/0.39 cnf(i_0_100, negated_conjecture, (op2(h(e10),h(e10))=h(e10))).
% 0.19/0.39 cnf(i_0_99, negated_conjecture, (op2(h(e10),h(e11))=h(e11))).
% 0.19/0.39 cnf(i_0_98, negated_conjecture, (op2(h(e10),h(e12))=h(e12))).
% 0.19/0.39 cnf(i_0_97, negated_conjecture, (op2(h(e10),h(e13))=h(e13))).
% 0.19/0.39 cnf(i_0_96, negated_conjecture, (op2(h(e11),h(e10))=h(e11))).
% 0.19/0.39 cnf(i_0_95, negated_conjecture, (op2(h(e11),h(e11))=h(e10))).
% 0.19/0.39 cnf(i_0_94, negated_conjecture, (op2(h(e11),h(e12))=h(e13))).
% 0.19/0.39 cnf(i_0_93, negated_conjecture, (op2(h(e11),h(e13))=h(e12))).
% 0.19/0.39 cnf(i_0_92, negated_conjecture, (op2(h(e12),h(e10))=h(e12))).
% 0.19/0.39 cnf(i_0_91, negated_conjecture, (op2(h(e12),h(e11))=h(e13))).
% 0.19/0.39 cnf(i_0_90, negated_conjecture, (op2(h(e12),h(e12))=h(e10))).
% 0.19/0.39 cnf(i_0_89, negated_conjecture, (op2(h(e12),h(e13))=h(e11))).
% 0.19/0.39 cnf(i_0_88, negated_conjecture, (op2(h(e13),h(e10))=h(e13))).
% 0.19/0.39 cnf(i_0_87, negated_conjecture, (op2(h(e13),h(e11))=h(e12))).
% 0.19/0.39 cnf(i_0_86, negated_conjecture, (op2(h(e13),h(e12))=h(e11))).
% 0.19/0.39 cnf(i_0_85, negated_conjecture, (op2(h(e13),h(e13))=h(e10))).
% 0.19/0.39 cnf(i_0_84, negated_conjecture, (op1(j(e20),j(e20))=j(e20))).
% 0.19/0.39 cnf(i_0_83, negated_conjecture, (op1(j(e20),j(e21))=j(e21))).
% 0.19/0.39 cnf(i_0_82, negated_conjecture, (op1(j(e20),j(e22))=j(e22))).
% 0.19/0.39 cnf(i_0_81, negated_conjecture, (op1(j(e20),j(e23))=j(e23))).
% 0.19/0.39 cnf(i_0_80, negated_conjecture, (op1(j(e21),j(e20))=j(e21))).
% 0.19/0.39 cnf(i_0_79, negated_conjecture, (op1(j(e21),j(e21))=j(e23))).
% 0.19/0.39 cnf(i_0_78, negated_conjecture, (op1(j(e21),j(e22))=j(e20))).
% 0.19/0.39 cnf(i_0_77, negated_conjecture, (op1(j(e21),j(e23))=j(e22))).
% 0.19/0.39 cnf(i_0_76, negated_conjecture, (op1(j(e22),j(e20))=j(e22))).
% 0.19/0.39 cnf(i_0_75, negated_conjecture, (op1(j(e22),j(e21))=j(e20))).
% 0.19/0.39 cnf(i_0_74, negated_conjecture, (op1(j(e22),j(e22))=j(e23))).
% 0.19/0.39 cnf(i_0_73, negated_conjecture, (op1(j(e22),j(e23))=j(e21))).
% 0.19/0.39 cnf(i_0_72, negated_conjecture, (op1(j(e23),j(e20))=j(e23))).
% 0.19/0.39 cnf(i_0_71, negated_conjecture, (op1(j(e23),j(e21))=j(e22))).
% 0.19/0.39 cnf(i_0_70, negated_conjecture, (op1(j(e23),j(e22))=j(e21))).
% 0.19/0.39 cnf(i_0_69, negated_conjecture, (op1(j(e23),j(e23))=j(e20))).
% 0.19/0.39 cnf(i_0_6, plain, (e11!=e10)).
% 0.19/0.39 cnf(i_0_5, plain, (e12!=e10)).
% 0.19/0.39 cnf(i_0_3, plain, (e12!=e11)).
% 0.19/0.39 cnf(i_0_4, plain, (e13!=e10)).
% 0.19/0.39 cnf(i_0_2, plain, (e13!=e11)).
% 0.19/0.39 cnf(i_0_1, plain, (e13!=e12)).
% 0.19/0.39 cnf(i_0_28, plain, (e10!=e20)).
% 0.19/0.39 cnf(i_0_24, plain, (e11!=e20)).
% 0.19/0.39 cnf(i_0_20, plain, (e12!=e20)).
% 0.19/0.39 cnf(i_0_16, plain, (e13!=e20)).
% 0.19/0.39 cnf(i_0_27, plain, (e10!=e21)).
% 0.19/0.39 cnf(i_0_23, plain, (e11!=e21)).
% 0.19/0.39 cnf(i_0_19, plain, (e12!=e21)).
% 0.19/0.39 cnf(i_0_15, plain, (e13!=e21)).
% 0.19/0.39 cnf(i_0_12, plain, (e21!=e20)).
% 0.19/0.39 cnf(i_0_26, plain, (e10!=e22)).
% 0.19/0.39 cnf(i_0_22, plain, (e11!=e22)).
% 0.19/0.39 cnf(i_0_18, plain, (e12!=e22)).
% 0.19/0.39 cnf(i_0_14, plain, (e13!=e22)).
% 0.19/0.39 cnf(i_0_11, plain, (e22!=e20)).
% 0.19/0.39 cnf(i_0_9, plain, (e22!=e21)).
% 0.19/0.39 cnf(i_0_25, plain, (e10!=e23)).
% 0.19/0.39 cnf(i_0_21, plain, (e11!=e23)).
% 0.19/0.39 cnf(i_0_17, plain, (e12!=e23)).
% 0.19/0.39 cnf(i_0_13, plain, (e13!=e23)).
% 0.19/0.39 cnf(i_0_10, plain, (e23!=e20)).
% 0.19/0.39 cnf(i_0_8, plain, (e23!=e21)).
% 0.19/0.39 cnf(i_0_7, plain, (e23!=e22)).
% 0.19/0.39 cnf(i_0_109, plain, (h(e10)=e23|h(e10)=e22|h(e10)=e21|h(e10)=e20)).
% 0.19/0.39 cnf(i_0_108, plain, (h(e11)=e23|h(e11)=e22|h(e11)=e21|h(e11)=e20)).
% 0.19/0.39 cnf(i_0_107, plain, (h(e12)=e23|h(e12)=e22|h(e12)=e21|h(e12)=e20)).
% 0.19/0.39 cnf(i_0_106, plain, (h(e13)=e23|h(e13)=e22|h(e13)=e21|h(e13)=e20)).
% 0.19/0.39 cnf(i_0_105, plain, (j(e20)=e13|j(e20)=e12|j(e20)=e11|j(e20)=e10)).
% 0.19/0.39 cnf(i_0_104, plain, (j(e21)=e13|j(e21)=e12|j(e21)=e11|j(e21)=e10)).
% 0.19/0.39 cnf(i_0_103, plain, (j(e22)=e13|j(e22)=e12|j(e22)=e11|j(e22)=e10)).
% 0.19/0.39 cnf(i_0_102, plain, (j(e23)=e13|j(e23)=e12|j(e23)=e11|j(e23)=e10)).
% 0.19/0.39 cnf(i_0_343, plain, (X1=X1)).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 6 steps
% 0.19/0.39 cnf(i_0_343, plain, (X6=X6), inference(start_rule)).
% 0.19/0.39 cnf(i_0_484, plain, (X6=X6), inference(extension_rule, [i_0_347])).
% 0.19/0.39 cnf(i_0_526, plain, (h(j(e20))!=e20), inference(closure_rule, [i_0_68])).
% 0.19/0.39 cnf(i_0_524, plain, (op1(X6,h(j(e20)))=op1(X6,e20)), inference(extension_rule, [i_0_348])).
% 0.19/0.39 cnf(i_0_852, plain, (h(j(e20))!=e20), inference(closure_rule, [i_0_68])).
% 0.19/0.39 cnf(i_0_850, plain, (op2(op1(X6,h(j(e20))),h(j(e20)))=op2(op1(X6,e20),e20)), inference(etableau_closure_rule, [i_0_850, ...])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Child (18063) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------