TSTP Solution File: NUM458+2 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : NUM458+2 : 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 : n029.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:14 EDT 2022

% Result   : Theorem 0.12s 0.39s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM458+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/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 : n029.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 : Tue Jul  5 13:30:42 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  # No SInE strategy applied
% 0.12/0.37  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37  #
% 0.12/0.37  # Presaturation interreduction done
% 0.12/0.37  # Number of axioms: 33 Number of unprocessed: 33
% 0.12/0.37  # Tableaux proof search.
% 0.12/0.37  # APR header successfully linked.
% 0.12/0.37  # Hello from C++
% 0.12/0.38  # The folding up rule is enabled...
% 0.12/0.38  # Local unification is enabled...
% 0.12/0.38  # Any saturation attempts will use folding labels...
% 0.12/0.38  # 33 beginning clauses after preprocessing and clausification
% 0.12/0.38  # Creating start rules for all 2 conjectures.
% 0.12/0.38  # There are 2 start rule candidates:
% 0.12/0.38  # Found 5 unit axioms.
% 0.12/0.38  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38  # 2 start rule tableaux created.
% 0.12/0.38  # 28 extension rule candidate clauses
% 0.12/0.38  # 5 unit axiom clauses
% 0.12/0.38  
% 0.12/0.38  # Requested 8, 32 cores available to the main process.
% 0.12/0.38  # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.38  # Creating equality axioms
% 0.12/0.38  # Ran out of tableaux, making start rules for all clauses
% 0.12/0.38  # Returning from population with 91 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.38  # We now have 91 tableaux to operate on
% 0.12/0.39  # There were 1 total branch saturation attempts.
% 0.12/0.39  # There were 0 of these attempts blocked.
% 0.12/0.39  # There were 0 deferred branch saturation attempts.
% 0.12/0.39  # There were 0 free duplicated saturations.
% 0.12/0.39  # There were 1 total successful branch saturations.
% 0.12/0.39  # There were 0 successful branch saturations in interreduction.
% 0.12/0.39  # There were 0 successful branch saturations on the branch.
% 0.12/0.39  # There were 1 successful branch saturations after the branch.
% 0.12/0.39  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39  # Begin clausification derivation
% 0.12/0.39  
% 0.12/0.39  # End clausification derivation
% 0.12/0.39  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39  cnf(i_0_32, hypothesis, (aNaturalNumber0(xm))).
% 0.12/0.39  cnf(i_0_2, plain, (aNaturalNumber0(sz00))).
% 0.12/0.39  cnf(i_0_4, plain, (aNaturalNumber0(sz10))).
% 0.12/0.39  cnf(i_0_33, negated_conjecture, (~sdtlseqdt0(xm,xm))).
% 0.12/0.39  cnf(i_0_3, plain, (sz10!=sz00)).
% 0.12/0.39  cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_34, negated_conjecture, (sdtpldt0(xm,X1)!=xm|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))).
% 0.12/0.39  cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
% 0.12/0.39  cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
% 0.12/0.39  cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
% 0.12/0.39  cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
% 0.12/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.12/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.12/0.39  cnf(i_0_240, plain, (X42=X42)).
% 0.12/0.39  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.12/0.39  # Begin printing tableau
% 0.12/0.39  # Found 5 steps
% 0.12/0.39  cnf(i_0_32, hypothesis, (aNaturalNumber0(xm)), inference(start_rule)).
% 0.12/0.39  cnf(i_0_249, plain, (aNaturalNumber0(xm)), inference(extension_rule, [i_0_244])).
% 0.12/0.39  cnf(i_0_460, plain, (aNaturalNumber0(xm)), inference(extension_rule, [i_0_15])).
% 0.12/0.39  cnf(i_0_461, plain, ($false), inference(closure_rule, [i_0_240])).
% 0.12/0.39  cnf(i_0_476, plain, (sdtasdt0(sz00,xm)=sz00), inference(etableau_closure_rule, [i_0_476, ...])).
% 0.12/0.39  # End printing tableau
% 0.12/0.39  # SZS output end
% 0.12/0.39  # Branches closed with saturation will be marked with an "s"
% 0.12/0.39  # Child (29398) has found a proof.
% 0.12/0.39  
% 0.12/0.39  # Proof search is over...
% 0.12/0.39  # Freeing feature tree
%------------------------------------------------------------------------------