↑ Up

Etableau---0.67.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LCL666+1.001 : TPTP v9.3.1. 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 : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 12:01:41 PM UTC 2026

% Result   : Theorem 0.08s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.08/0.35  % Computer : n018.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep  5 21:20:34 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.38  # No SInE strategy applied
% 0.08/0.38  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.08/0.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.08/0.38  #
% 0.08/0.38  # Presaturation interreduction done
% 0.08/0.38  # Number of axioms: 4 Number of unprocessed: 4
% 0.08/0.38  # Tableaux proof search.
% 0.08/0.38  # APR header successfully linked.
% 0.08/0.38  # Hello from C++
% 0.08/0.38  # The folding up rule is enabled...
% 0.08/0.38  # Local unification is enabled...
% 0.08/0.38  # Any saturation attempts will use folding labels...
% 0.08/0.38  # 4 beginning clauses after preprocessing and clausification
% 0.08/0.38  # Creating start rules for all 3 conjectures.
% 0.08/0.38  # There are 3 start rule candidates:
% 0.08/0.38  # Found 3 unit axioms.
% 0.08/0.38  # Closed tableau found in foldup close cycle with 0 folds and 3 closures done.
% 0.08/0.38  # Found closed tableau while making start rule
% 0.08/0.38  # There were 0 total branch saturation attempts.
% 0.08/0.38  # There were 0 of these attempts blocked.
% 0.08/0.38  # There were 0 deferred branch saturation attempts.
% 0.08/0.38  # There were 0 free duplicated saturations.
% 0.08/0.38  # There were 0 total successful branch saturations.
% 0.08/0.38  # There were 0 successful branch saturations in interreduction.
% 0.08/0.38  # There were 0 successful branch saturations on the branch.
% 0.08/0.38  # There were 0 successful branch saturations after the branch.
% 0.08/0.38  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.38  # Begin clausification derivation
% 0.08/0.38  
% 0.08/0.38  # End clausification derivation
% 0.08/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.08/0.38  cnf(i_0_3, negated_conjecture, (p201(esk1_0))).
% 0.08/0.38  cnf(i_0_2, negated_conjecture, (p101(esk1_0))).
% 0.08/0.38  cnf(i_0_1, plain, (r1(X1,X1))).
% 0.08/0.38  cnf(i_0_4, negated_conjecture, (~p101(X1)|~p201(X1)|~r1(esk1_0,X1))).
% 0.08/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.08/0.38  # Begin printing tableau
% 0.08/0.38  # Found 4 steps
% 0.08/0.38  cnf(i_0_4, negated_conjecture, (~p101(esk1_0)|~p201(esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.08/0.38  cnf(i_0_5, plain, (~p101(esk1_0)), inference(closure_rule, [i_0_2])).
% 0.08/0.38  cnf(i_0_6, plain, (~p201(esk1_0)), inference(closure_rule, [i_0_3])).
% 0.08/0.38  cnf(i_0_7, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.08/0.38  # End printing tableau
% 0.08/0.38  # SZS output end
% 0.08/0.38  # Branches closed with saturation will be marked with an "s"
% 0.08/0.38  # NOT attempting initial tableau saturation
% 0.08/0.38  # 1 start rule tableaux created.
% 0.08/0.38  # 1 extension rule candidate clauses
% 0.08/0.38  # 3 unit axiom clauses
% 0.08/0.38  
% 0.08/0.38  # Proof search is over...
% 0.08/0.38  # Freeing feature tree
%------------------------------------------------------------------------------