↑ Up

Etableau---0.67.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN728-1 : TPTP v8.1.0. Released v2.5.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 : Thu Jul 21 06:13:37 EDT 2022

% Result   : Unsatisfiable 0.19s 0.36s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN728-1 : TPTP v8.1.0. Released v2.5.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 : 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 : Tue Jul 12 04:25:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.36  # No SInE strategy applied
% 0.19/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
% 0.19/0.36  # and selection function SelectUnlessUniqMax.
% 0.19/0.36  #
% 0.19/0.36  # Presaturation interreduction done
% 0.19/0.36  # Number of axioms: 5 Number of unprocessed: 5
% 0.19/0.36  # Tableaux proof search.
% 0.19/0.36  # APR header successfully linked.
% 0.19/0.36  # Hello from C++
% 0.19/0.36  # The folding up rule is enabled...
% 0.19/0.36  # Local unification is enabled...
% 0.19/0.36  # Any saturation attempts will use folding labels...
% 0.19/0.36  # 5 beginning clauses after preprocessing and clausification
% 0.19/0.36  # Creating start rules for all 5 conjectures.
% 0.19/0.36  # There are 5 start rule candidates:
% 0.19/0.36  # Found 0 unit axioms.
% 0.19/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36  # 5 start rule tableaux created.
% 0.19/0.36  # 5 extension rule candidate clauses
% 0.19/0.36  # 0 unit axiom clauses
% 0.19/0.36  
% 0.19/0.36  # Requested 8, 32 cores available to the main process.
% 0.19/0.36  # There are not enough tableaux to fork, creating more from the initial 5
% 0.19/0.36  # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36  # We now have 10 tableaux to operate on
% 0.19/0.36  # Closed tableau found in foldup close cycle with 2 folds and 2 closures done.
% 0.19/0.36  # There were 0 total branch saturation attempts.
% 0.19/0.36  # There were 0 of these attempts blocked.
% 0.19/0.36  # There were 0 deferred branch saturation attempts.
% 0.19/0.36  # There were 0 free duplicated saturations.
% 0.19/0.36  # There were 0 total successful branch saturations.
% 0.19/0.36  # There were 0 successful branch saturations in interreduction.
% 0.19/0.36  # There were 0 successful branch saturations on the branch.
% 0.19/0.36  # There were 0 successful branch saturations after the branch.
% 0.19/0.36  # Closed tableau found in foldup close cycle with 2 folds and 2 closures done.
% 0.19/0.36  # There were 0 total branch saturation attempts.
% 0.19/0.36  # There were 0 of these attempts blocked.
% 0.19/0.36  # There were 0 deferred branch saturation attempts.
% 0.19/0.36  # There were 0 free duplicated saturations.
% 0.19/0.36  # There were 0 total successful branch saturations.
% 0.19/0.36  # There were 0 successful branch saturations in interreduction.
% 0.19/0.36  # There were 0 successful branch saturations on the branch.
% 0.19/0.36  # There were 0 successful branch saturations after the branch.
% 0.19/0.36  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36  # Begin clausification derivation
% 0.19/0.36  
% 0.19/0.36  # End clausification derivation
% 0.19/0.36  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36  cnf(i_0_9, negated_conjecture, (~q(X1)|~m(g(X1)))).
% 0.19/0.36  cnf(i_0_10, negated_conjecture, (~p(g(sk2),X1)|~p(sk2,sk2))).
% 0.19/0.36  cnf(i_0_7, negated_conjecture, (m(X1)|p(X1,sk1(X1)))).
% 0.19/0.36  cnf(i_0_6, negated_conjecture, (p(X1,X1)|~p(X2,X3))).
% 0.19/0.36  cnf(i_0_8, negated_conjecture, (q(f(X1,sk1(X1)))|p(X1,sk1(X1)))).
% 0.19/0.36  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.36  # Begin printing tableau
% 0.19/0.36  # Found 8 steps
% 0.19/0.36  cnf(i_0_6, negated_conjecture, (p(g(sk2),g(sk2))|~p(g(f(g(f(X7,sk1(X7))),sk1(g(f(X7,sk1(X7)))))),sk1(g(f(g(f(X7,sk1(X7))),sk1(g(f(X7,sk1(X7))))))))), inference(start_rule)).
% 0.19/0.36  cnf(i_0_14, plain, (~p(g(f(g(f(X7,sk1(X7))),sk1(g(f(X7,sk1(X7)))))),sk1(g(f(g(f(X7,sk1(X7))),sk1(g(f(X7,sk1(X7))))))))), inference(extension_rule, [i_0_7])).
% 0.19/0.36  cnf(i_0_55, plain, (m(g(f(g(f(X7,sk1(X7))),sk1(g(f(X7,sk1(X7)))))))), inference(extension_rule, [i_0_9])).
% 0.19/0.36  cnf(i_0_79, plain, (~q(f(g(f(X7,sk1(X7))),sk1(g(f(X7,sk1(X7))))))), inference(extension_rule, [i_0_8])).
% 0.19/0.36  cnf(i_0_13, plain, (p(g(sk2),g(sk2))), inference(extension_rule, [i_0_10])).
% 0.19/0.36  cnf(i_0_88, plain, (~p(sk2,sk2)), inference(extension_rule, [i_0_6])).
% 0.19/0.36  cnf(i_0_90, plain, (~p(g(sk2),g(sk2))), inference(closure_rule, [i_0_13])).
% 0.19/0.36  cnf(i_0_82, plain, (p(g(f(X7,sk1(X7))),sk1(g(f(X7,sk1(X7)))))), inference(closure_rule, [i_0_14])).
% 0.19/0.36  # End printing tableau
% 0.19/0.36  # SZS output end
% 0.19/0.36  # Branches closed with saturation will be marked with an "s"
% 0.19/0.36  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36  # Begin clausification derivation
% 0.19/0.36  
% 0.19/0.36  # End clausification derivation
% 0.19/0.36  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36  cnf(i_0_9, negated_conjecture, (~q(X1)|~m(g(X1)))).
% 0.19/0.36  cnf(i_0_10, negated_conjecture, (~p(g(sk2),X1)|~p(sk2,sk2))).
% 0.19/0.36  cnf(i_0_7, negated_conjecture, (m(X1)|p(X1,sk1(X1)))).
% 0.19/0.36  cnf(i_0_6, negated_conjecture, (p(X1,X1)|~p(X2,X3))).
% 0.19/0.36  cnf(i_0_8, negated_conjecture, (q(f(X1,sk1(X1)))|p(X1,sk1(X1)))).
% 0.19/0.36  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.36  # Begin printing tableau
% 0.19/0.36  # Found 8 steps
% 0.19/0.36  cnf(i_0_6, negated_conjecture, (p(g(sk2),g(sk2))|~p(X8,sk1(X8))), inference(start_rule)).
% 0.19/0.36  cnf(i_0_14, plain, (~p(X8,sk1(X8))), inference(extension_rule, [i_0_8])).
% 0.19/0.36  cnf(i_0_51, plain, (q(f(X8,sk1(X8)))), inference(extension_rule, [i_0_9])).
% 0.19/0.36  cnf(i_0_80, plain, (~m(g(f(X8,sk1(X8))))), inference(extension_rule, [i_0_7])).
% 0.19/0.36  cnf(i_0_13, plain, (p(g(sk2),g(sk2))), inference(extension_rule, [i_0_10])).
% 0.19/0.36  cnf(i_0_92, plain, (~p(sk2,sk2)), inference(extension_rule, [i_0_6])).
% 0.19/0.36  cnf(i_0_96, plain, (~p(g(sk2),g(sk2))), inference(closure_rule, [i_0_13])).
% 0.19/0.36  cnf(i_0_86, plain, (p(g(f(X8,sk1(X8))),sk1(g(f(X8,sk1(X8)))))), inference(closure_rule, [i_0_14])).
% 0.19/0.36  # End printing tableau
% 0.19/0.36  # SZS output end
% 0.19/0.36  # Branches closed with saturation will be marked with an "s"
% 0.19/0.36  # Child (13071) has found a proof.
% 0.19/0.36  
% 0.19/0.36  # Proof search is over...
% 0.19/0.36  # Freeing feature tree
%------------------------------------------------------------------------------