TSTP Solution File: NUM286-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM286-1 : TPTP v8.1.0. Bugfixed 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 : n026.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:39:57 EDT 2022
% Result : Satisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM286-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/0.12 % 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 : n026.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 : Thu Jul 7 13:37:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 6 Number of unprocessed: 6
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 6 beginning clauses after preprocessing and clausification
% 0.12/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.12/0.36 # No conjectures.
% 0.12/0.36 # There are 6 start rule candidates:
% 0.12/0.36 # Found 4 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 6 start rule tableaux created.
% 0.12/0.36 # 2 extension rule candidate clauses
% 0.12/0.36 # 4 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 6
% 0.12/0.36 # 11360 Satisfiable branch
% 0.12/0.36 # Satisfiable branch found.
% 0.12/0.36 # There were 1 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_9, plain, (equalish(multiply(X1,n0),n0))).
% 0.12/0.36 cnf(i_0_7, plain, (equalish(add(X1,n0),X1))).
% 0.12/0.36 cnf(i_0_8, plain, (equalish(add(X1,successor(X2)),successor(add(X1,X2))))).
% 0.12/0.36 cnf(i_0_10, plain, (equalish(multiply(X1,successor(X2)),add(multiply(X1,X2),X1)))).
% 0.12/0.36 cnf(i_0_11, plain, (equalish(X1,X2)|~equalish(successor(X1),successor(X2)))).
% 0.12/0.36 cnf(i_0_12, plain, (equalish(successor(X1),successor(X2))|~equalish(X1,X2))).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 4 steps
% 0.12/0.36 cnf(i_0_12, plain, (equalish(successor(multiply(X5,n0)),successor(n0))|~equalish(multiply(X5,n0),n0)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_20, plain, (~equalish(multiply(X5,n0),n0)), inference(closure_rule, [i_0_9])).
% 0.12/0.36 cnf(i_0_19, plain, (equalish(successor(multiply(X5,n0)),successor(n0))), inference(extension_rule, [i_0_12])).
% 0.12/0.36 cnf(i_0_47, plain, (equalish(successor(successor(multiply(X5,n0))),successor(successor(n0)))), inference(extension_rule, [i_0_12])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 7 tableaux to operate on
% 0.12/0.36 # Found closed tableau during pool population.
% 0.12/0.36 # Proof search is over...
% 0.12/0.36 # Freeing feature tree
%------------------------------------------------------------------------------