TSTP Solution File: NUM457+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM457+1 : TPTP v8.1.0. Released v4.0.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 : n009.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 : Mon Jul 18 09:41:13 EDT 2022
% Result : Theorem 0.18s 0.38s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM457+1 : TPTP v8.1.0. Released v4.0.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.33 % Computer : n009.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 : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 05:23:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.37 #
% 0.18/0.37 # Presaturation interreduction done
% 0.18/0.37 # Number of axioms: 28 Number of unprocessed: 28
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 28 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 3 conjectures.
% 0.18/0.37 # There are 3 start rule candidates:
% 0.18/0.37 # Found 8 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 3 start rule tableaux created.
% 0.18/0.37 # 20 extension rule candidate clauses
% 0.18/0.37 # 8 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.18/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.37 # We now have 10 tableaux to operate on
% 0.18/0.38 # There were 3 total branch saturation attempts.
% 0.18/0.38 # There were 0 of these attempts blocked.
% 0.18/0.38 # There were 0 deferred branch saturation attempts.
% 0.18/0.38 # There were 0 free duplicated saturations.
% 0.18/0.38 # There were 3 total successful branch saturations.
% 0.18/0.38 # There were 0 successful branch saturations in interreduction.
% 0.18/0.38 # There were 0 successful branch saturations on the branch.
% 0.18/0.38 # There were 3 successful branch saturations after the branch.
% 0.18/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # Begin clausification derivation
% 0.18/0.38
% 0.18/0.38 # End clausification derivation
% 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38 cnf(i_0_29, negated_conjecture, (sdtasdt0(xm,xn)=sz00)).
% 0.18/0.38 cnf(i_0_2, plain, (aNaturalNumber0(sz00))).
% 0.18/0.38 cnf(i_0_4, plain, (aNaturalNumber0(sz10))).
% 0.18/0.38 cnf(i_0_26, hypothesis, (aNaturalNumber0(xm))).
% 0.18/0.38 cnf(i_0_25, hypothesis, (aNaturalNumber0(xn))).
% 0.18/0.38 cnf(i_0_28, negated_conjecture, (xm!=sz00)).
% 0.18/0.38 cnf(i_0_27, negated_conjecture, (xn!=sz00)).
% 0.18/0.38 cnf(i_0_3, plain, (sz10!=sz00)).
% 0.18/0.38 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))).
% 0.18/0.38 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))).
% 0.18/0.38 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))).
% 0.18/0.38 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))).
% 0.18/0.38 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))).
% 0.18/0.38 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))).
% 0.18/0.39 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
% 0.18/0.39 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.39 # Begin printing tableau
% 0.18/0.39 # Found 11 steps
% 0.18/0.39 cnf(i_0_27, negated_conjecture, (xn!=sz00), inference(start_rule)).
% 0.18/0.39 cnf(i_0_30, plain, (xn!=sz00), inference(extension_rule, [i_0_22])).
% 0.18/0.39 cnf(i_0_79, plain, (sz10=sz00), inference(closure_rule, [i_0_3])).
% 0.18/0.39 cnf(i_0_82, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])).
% 0.18/0.39 cnf(i_0_83, plain, (~aNaturalNumber0(xn)), inference(closure_rule, [i_0_25])).
% 0.18/0.39 cnf(i_0_84, plain, (~aNaturalNumber0(sz10)), inference(closure_rule, [i_0_4])).
% 0.18/0.39 cnf(i_0_81, plain, (sdtasdt0(sz10,xn)!=sdtasdt0(sz10,sz00)), inference(extension_rule, [i_0_20])).
% 0.18/0.39 cnf(i_0_136, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])).
% 0.18/0.39 cnf(i_0_133, plain, (sdtpldt0(sz00,sdtasdt0(sz10,xn))!=sdtpldt0(sz00,sdtasdt0(sz10,sz00))), inference(etableau_closure_rule, [i_0_133, ...])).
% 0.18/0.39 cnf(i_0_134, plain, (~aNaturalNumber0(sdtasdt0(sz10,sz00))), inference(etableau_closure_rule, [i_0_134, ...])).
% 0.18/0.39 cnf(i_0_135, plain, (~aNaturalNumber0(sdtasdt0(sz10,xn))), inference(etableau_closure_rule, [i_0_135, ...])).
% 0.18/0.39 # End printing tableau
% 0.18/0.39 # SZS output end
% 0.18/0.39 # Branches closed with saturation will be marked with an "s"
% 0.18/0.39 # There were 2 total branch saturation attempts.
% 0.18/0.39 # There were 0 of these attempts blocked.
% 0.18/0.39 # There were 0 deferred branch saturation attempts.
% 0.18/0.39 # There were 0 free duplicated saturations.
% 0.18/0.39 # There were 2 total successful branch saturations.
% 0.18/0.39 # There were 0 successful branch saturations in interreduction.
% 0.18/0.39 # There were 0 successful branch saturations on the branch.
% 0.18/0.39 # There were 2 successful branch saturations after the branch.
% 0.18/0.39 # There were 2 total branch saturation attempts.
% 0.18/0.39 # There were 0 of these attempts blocked.
% 0.18/0.39 # There were 0 deferred branch saturation attempts.
% 0.18/0.39 # There were 0 free duplicated saturations.
% 0.18/0.39 # There were 2 total successful branch saturations.
% 0.18/0.39 # There were 0 successful branch saturations in interreduction.
% 0.18/0.39 # There were 0 successful branch saturations on the branch.
% 0.18/0.39 # There were 2 successful branch saturations after the branch.
% 0.18/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.39 # Begin clausification derivation
% 0.18/0.39
% 0.18/0.39 # End clausification derivation
% 0.18/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.39 cnf(i_0_29, negated_conjecture, (sdtasdt0(xm,xn)=sz00)).
% 0.18/0.39 cnf(i_0_2, plain, (aNaturalNumber0(sz00))).
% 0.18/0.39 cnf(i_0_4, plain, (aNaturalNumber0(sz10))).
% 0.18/0.39 cnf(i_0_26, hypothesis, (aNaturalNumber0(xm))).
% 0.18/0.39 cnf(i_0_25, hypothesis, (aNaturalNumber0(xn))).
% 0.18/0.39 cnf(i_0_28, negated_conjecture, (xm!=sz00)).
% 0.18/0.39 cnf(i_0_27, negated_conjecture, (xn!=sz00)).
% 0.18/0.39 cnf(i_0_3, plain, (sz10!=sz00)).
% 0.18/0.39 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))).
% 0.18/0.39 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
% 0.18/0.39 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.39 # Begin printing tableau
% 0.18/0.39 # Found 8 steps
% 0.18/0.39 cnf(i_0_27, negated_conjecture, (xn!=sz00), inference(start_rule)).
% 0.18/0.39 cnf(i_0_30, plain, (xn!=sz00), inference(extension_rule, [i_0_23])).
% 0.18/0.39 cnf(i_0_47, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])).
% 0.18/0.39 cnf(i_0_48, plain, (~aNaturalNumber0(xn)), inference(closure_rule, [i_0_25])).
% 0.18/0.39 cnf(i_0_46, plain, (sdtpldt0(sz00,xn)!=sz00), inference(extension_rule, [i_0_23])).
% 0.18/0.39 cnf(i_0_187, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])).
% 0.18/0.39 cnf(i_0_186, plain, (sdtpldt0(sz00,sdtpldt0(sz00,xn))!=sz00), inference(etableau_closure_rule, [i_0_186, ...])).
% 0.18/0.39 cnf(i_0_188, plain, (~aNaturalNumber0(sdtpldt0(sz00,xn))), inference(etableau_closure_rule, [i_0_188, ...])).
% 0.18/0.39 # End printing tableau
% 0.18/0.39 # SZS output end
% 0.18/0.39 # Branches closed with saturation will be marked with an "s"
% 0.18/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.39 # Begin clausification derivation
% 0.18/0.39
% 0.18/0.39 # End clausification derivation
% 0.18/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.39 cnf(i_0_29, negated_conjecture, (sdtasdt0(xm,xn)=sz00)).
% 0.18/0.39 cnf(i_0_2, plain, (aNaturalNumber0(sz00))).
% 0.18/0.39 cnf(i_0_4, plain, (aNaturalNumber0(sz10))).
% 0.18/0.39 cnf(i_0_26, hypothesis, (aNaturalNumber0(xm))).
% 0.18/0.39 cnf(i_0_25, hypothesis, (aNaturalNumber0(xn))).
% 0.18/0.39 cnf(i_0_28, negated_conjecture, (xm!=sz00)).
% 0.18/0.39 cnf(i_0_27, negated_conjecture, (xn!=sz00)).
% 0.18/0.39 cnf(i_0_3, plain, (sz10!=sz00)).
% 0.18/0.39 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))).
% 0.18/0.39 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
% 0.18/0.39 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))).
% 0.18/0.39 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.39 # Begin printing tableau
% 0.18/0.39 # Found 8 steps
% 0.18/0.39 cnf(i_0_28, negated_conjecture, (xm!=sz00), inference(start_rule)).
% 0.18/0.39 cnf(i_0_31, plain, (xm!=sz00), inference(extension_rule, [i_0_23])).
% 0.18/0.39 cnf(i_0_117, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])).
% 0.18/0.39 cnf(i_0_118, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_26])).
% 0.18/0.39 cnf(i_0_116, plain, (sdtpldt0(sz00,xm)!=sz00), inference(extension_rule, [i_0_24])).
% 0.18/0.39 cnf(i_0_133, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])).
% 0.18/0.39 cnf(i_0_132, plain, (sdtpldt0(sdtpldt0(sz00,xm),sz00)!=sz00), inference(etableau_closure_rule, [i_0_132, ...])).
% 0.18/0.39 cnf(i_0_134, plain, (~aNaturalNumber0(sdtpldt0(sz00,xm))), inference(etableau_closure_rule, [i_0_134, ...])).
% 0.18/0.39 # End printing tableau
% 0.18/0.39 # SZS output end
% 0.18/0.39 # Branches closed with saturation will be marked with an "s"
% 0.18/0.39 # Child (21984) has found a proof.
% 0.18/0.39
% 0.18/0.39 # Proof search is over...
% 0.18/0.39 # Freeing feature tree
%------------------------------------------------------------------------------