TSTP Solution File: NUM020-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM020-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 : n013.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:38:23 EDT 2022
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM020-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jul 7 21:30:59 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 12 Number of unprocessed: 12
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 12 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 2 conjectures.
% 0.14/0.39 # There are 2 start rule candidates:
% 0.14/0.39 # Found 8 unit axioms.
% 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.39 # 2 start rule tableaux created.
% 0.14/0.39 # 4 extension rule candidate clauses
% 0.14/0.39 # 8 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 2
% 0.14/0.39 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.14/0.39 # There were 0 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_19, plain, (equalish(X1,X1))).
% 0.14/0.39 cnf(i_0_22, plain, (equalish(n1,successor(n0)))).
% 0.14/0.39 cnf(i_0_15, plain, (equalish(multiply(X1,n0),n0))).
% 0.14/0.39 cnf(i_0_13, plain, (equalish(add(X1,n0),X1))).
% 0.14/0.39 cnf(i_0_14, plain, (equalish(add(X1,successor(X2)),successor(add(X1,X2))))).
% 0.14/0.39 cnf(i_0_16, plain, (equalish(multiply(X1,successor(X2)),add(multiply(X1,X2),X1)))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (~equalish(add(a,successor(n0)),successor(a)))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (~equalish(successor(X1),n0))).
% 0.14/0.39 cnf(i_0_20, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.14/0.39 cnf(i_0_17, plain, (equalish(X1,X2)|~equalish(successor(X1),successor(X2)))).
% 0.14/0.39 cnf(i_0_21, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.14/0.39 cnf(i_0_18, plain, (equalish(successor(X1),successor(X2))|~equalish(X1,X2))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 5 steps
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (~equalish(add(a,successor(n0)),successor(a))), inference(start_rule)).
% 0.14/0.39 cnf(i_0_26, plain, (~equalish(add(a,successor(n0)),successor(a))), inference(extension_rule, [i_0_21])).
% 0.14/0.39 cnf(i_0_41, plain, (~equalish(successor(add(a,n0)),successor(a))), inference(extension_rule, [i_0_18])).
% 0.14/0.39 cnf(i_0_42, plain, (~equalish(add(a,successor(n0)),successor(add(a,n0)))), inference(closure_rule, [i_0_14])).
% 0.14/0.39 cnf(i_0_53, plain, (~equalish(add(a,n0),a)), inference(closure_rule, [i_0_13])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.39 # We now have 8 tableaux to operate on
% 0.14/0.39 # Found closed tableau during pool population.
% 0.14/0.39 # Proof search is over...
% 0.14/0.39 # Freeing feature tree
%------------------------------------------------------------------------------