↑ Up

Etableau---0.67.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LCL365+1 : TPTP v9.3.1. Released v9.1.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   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 12:01:05 PM UTC 2026

% Result   : Theorem 7.45s 7.74s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL365+1 : TPTP v9.3.1. Released v9.1.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.11/0.37  % Computer : n026.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep  5 23:54:26 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.40  # No SInE strategy applied
% 0.11/0.40  # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.11/0.40  # and selection function PSelectComplexExceptRRHorn.
% 0.11/0.40  #
% 0.11/0.40  # Presaturation interreduction done
% 0.11/0.40  # Number of axioms: 5 Number of unprocessed: 5
% 0.11/0.40  # Tableaux proof search.
% 0.11/0.40  # APR header successfully linked.
% 0.11/0.40  # Hello from C++
% 0.55/0.88  # The folding up rule is enabled...
% 0.55/0.88  # Local unification is enabled...
% 0.55/0.88  # Any saturation attempts will use folding labels...
% 0.55/0.88  # 5 beginning clauses after preprocessing and clausification
% 0.55/0.88  # Creating start rules for all 1 conjectures.
% 0.55/0.88  # There are 1 start rule candidates:
% 0.55/0.88  # Found 4 unit axioms.
% 0.55/0.88  # 1 start rule tableaux created.
% 0.55/0.88  # 1 extension rule candidate clauses
% 0.55/0.88  # 4 unit axiom clauses
% 0.55/0.88  
% 0.55/0.88  # Requested 8, 32 cores available to the main process.
% 0.55/0.88  # There are not enough tableaux to fork, creating more from the initial 1
% 1.66/1.99  # Ran out of tableaux, making start rules for all clauses
% 7.45/7.74  # There were 13 total branch saturation attempts.
% 7.45/7.74  # There were 0 of these attempts blocked.
% 7.45/7.74  # There were 0 deferred branch saturation attempts.
% 7.45/7.74  # There were 0 free duplicated saturations.
% 7.45/7.74  # There were 1 total successful branch saturations.
% 7.45/7.74  # There were 0 successful branch saturations in interreduction.
% 7.45/7.74  # There were 0 successful branch saturations on the branch.
% 7.45/7.74  # There were 1 successful branch saturations after the branch.
% 7.45/7.74  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.45/7.74  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.45/7.74  # Begin clausification derivation
% 7.45/7.74  
% 7.45/7.74  # End clausification derivation
% 7.45/7.74  # Begin listing active clauses obtained from FOF to CNF conversion
% 7.45/7.74  cnf(i_0_4, plain, (is_a_theorem(implies(X1,implies(not(X1),X2))))).
% 7.45/7.74  cnf(i_0_3, plain, (is_a_theorem(implies(implies(not(X1),X1),X1)))).
% 7.45/7.74  cnf(i_0_2, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))).
% 7.45/7.74  cnf(i_0_5, negated_conjecture, (~is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))))).
% 7.45/7.74  cnf(i_0_1, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
% 7.45/7.74  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 7.45/7.74  # Begin printing tableau
% 7.45/7.74  # Found 6 steps
% 7.45/7.74  cnf(i_0_2, plain, (is_a_theorem(implies(implies(X7,X5),implies(implies(X5,X6),implies(X7,X6))))), inference(start_rule)).
% 7.45/7.74  cnf(i_0_59921, plain, (is_a_theorem(implies(implies(X7,X5),implies(implies(X5,X6),implies(X7,X6))))), inference(extension_rule, [i_0_1])).
% 7.45/7.74  cnf(i_0_369861, plain, (is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u)))), inference(closure_rule, [i_0_5])).
% 7.45/7.74  cnf(i_0_369862, plain, (~is_a_theorem(implies(implies(implies(X7,X5),implies(implies(X5,X6),implies(X7,X6))),implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))))), inference(extension_rule, [i_0_1])).
% 7.45/7.74  cnf(i_0_369865, plain, (~is_a_theorem(implies(implies(not(implies(implies(implies(X7,X5),implies(implies(X5,X6),implies(X7,X6))),implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u)))),implies(implies(implies(X7,X5),implies(implies(X5,X6),implies(X7,X6))),implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u)))),implies(implies(implies(X7,X5),implies(implies(X5,X6),implies(X7,X6))),implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u)))))), inference(closure_rule, [i_0_3])).
% 7.45/7.74  cnf(i_0_369866, plain, (~is_a_theorem(implies(not(implies(implies(implies(X7,X5),implies(implies(X5,X6),implies(X7,X6))),implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u)))),implies(implies(implies(X7,X5),implies(implies(X5,X6),implies(X7,X6))),implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u)))))), inference(etableau_closure_rule, [i_0_369866, ...])).
% 7.45/7.74  # End printing tableau
% 7.45/7.74  # SZS output end
% 7.45/7.74  # Branches closed with saturation will be marked with an "s"
% 7.45/7.74  # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 7.45/7.74  # We now have 4 tableaux to operate on
% 7.45/7.74  # Found closed tableau during pool population.
% 7.45/7.74  # Proof search is over...
% 7.45/7.74  # Freeing feature tree
%------------------------------------------------------------------------------