TSTP Solution File: KLE030+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : KLE030+1 : TPTP v8.1.0. 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 : n021.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 : Sun Jul 17 01:56:42 EDT 2022

% Result   : Theorem 8.81s 1.50s
% Output   : CNFRefutation 8.81s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KLE030+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 10:05:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.37  # No SInE strategy applied
% 0.19/0.37  # Auto-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.19/0.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.19/0.37  #
% 0.19/0.37  # Presaturation interreduction done
% 0.19/0.37  # Number of axioms: 37 Number of unprocessed: 37
% 0.19/0.37  # Tableaux proof search.
% 0.19/0.37  # APR header successfully linked.
% 0.19/0.37  # Hello from C++
% 0.19/0.37  # The folding up rule is enabled...
% 0.19/0.37  # Local unification is enabled...
% 0.19/0.37  # Any saturation attempts will use folding labels...
% 0.19/0.37  # 37 beginning clauses after preprocessing and clausification
% 0.19/0.37  # Creating start rules for all 3 conjectures.
% 0.19/0.37  # There are 3 start rule candidates:
% 0.19/0.37  # Found 14 unit axioms.
% 0.19/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37  # 3 start rule tableaux created.
% 0.19/0.37  # 23 extension rule candidate clauses
% 0.19/0.37  # 14 unit axiom clauses
% 0.19/0.37  
% 0.19/0.37  # Requested 8, 32 cores available to the main process.
% 0.19/0.37  # There are not enough tableaux to fork, creating more from the initial 3
% 0.19/0.37  # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37  # We now have 9 tableaux to operate on
% 8.81/1.50  # There were 4 total branch saturation attempts.
% 8.81/1.50  # There were 0 of these attempts blocked.
% 8.81/1.50  # There were 0 deferred branch saturation attempts.
% 8.81/1.50  # There were 0 free duplicated saturations.
% 8.81/1.50  # There were 3 total successful branch saturations.
% 8.81/1.50  # There were 2 successful branch saturations in interreduction.
% 8.81/1.50  # There were 0 successful branch saturations on the branch.
% 8.81/1.50  # There were 1 successful branch saturations after the branch.
% 8.81/1.50  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.81/1.50  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.81/1.50  # Begin clausification derivation
% 8.81/1.50  
% 8.81/1.50  # End clausification derivation
% 8.81/1.50  # Begin listing active clauses obtained from FOF to CNF conversion
% 8.81/1.50  cnf(i_0_37, negated_conjecture, (test(esk7_0))).
% 8.81/1.50  cnf(i_0_36, negated_conjecture, (ismeet(esk4_0,esk5_0,esk6_0))).
% 8.81/1.50  cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 8.81/1.50  cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 8.81/1.50  cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 8.81/1.50  cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 8.81/1.50  cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 8.81/1.50  cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 8.81/1.50  cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 8.81/1.50  cnf(i_0_8, plain, (multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)))).
% 8.81/1.50  cnf(i_0_9, plain, (multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)))).
% 8.81/1.50  cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 8.81/1.50  cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 8.81/1.50  cnf(i_0_35, negated_conjecture, (~ismeet(multiplication(esk7_0,esk4_0),multiplication(esk7_0,esk5_0),esk6_0))).
% 8.81/1.50  cnf(i_0_22, plain, (c(X1)=zero|test(X1))).
% 8.81/1.50  cnf(i_0_14, plain, (test(X1)|~complement(X2,X1))).
% 8.81/1.50  cnf(i_0_15, plain, (complement(esk1_1(X1),X1)|~test(X1))).
% 8.81/1.50  cnf(i_0_19, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))).
% 8.81/1.50  cnf(i_0_27, plain, (leq(X1,X2)|~ismeet(X1,X3,X2))).
% 8.81/1.50  cnf(i_0_28, plain, (leq(X1,X2)|~ismeet(X1,X2,X3))).
% 8.81/1.50  cnf(i_0_18, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))).
% 8.81/1.50  cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 8.81/1.50  cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 8.81/1.50  cnf(i_0_20, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))).
% 8.81/1.50  cnf(i_0_17, plain, (addition(X1,X2)=one|~complement(X2,X1))).
% 8.81/1.50  cnf(i_0_32, plain, (leq(X1,X2)|~ismeetu(X3,X4,X2)|~leq(X1,X3))).
% 8.81/1.50  cnf(i_0_33, plain, (leq(X1,X2)|~ismeetu(X3,X2,X4)|~leq(X1,X3))).
% 8.81/1.50  cnf(i_0_26, plain, (leq(X1,X2)|~ismeet(X2,X3,X4)|~leq(X1,X4)|~leq(X1,X3))).
% 8.81/1.50  cnf(i_0_16, plain, (complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero)).
% 8.81/1.50  cnf(i_0_24, plain, (ismeet(X1,X2,X3)|leq(esk2_3(X2,X3,X1),X3)|~leq(X1,X3)|~leq(X1,X2))).
% 8.81/1.50  cnf(i_0_34, plain, (leq(X1,X2)|~ismeetu(X2,X3,X4)|~leq(X1,X4)|~leq(X1,X3))).
% 8.81/1.50  cnf(i_0_25, plain, (ismeet(X1,X2,X3)|leq(esk2_3(X2,X3,X1),X2)|~leq(X1,X3)|~leq(X1,X2))).
% 8.81/1.50  cnf(i_0_23, plain, (ismeet(X1,X2,X3)|~leq(esk2_3(X2,X3,X1),X1)|~leq(X1,X3)|~leq(X1,X2))).
% 8.81/1.50  cnf(i_0_29, plain, (ismeetu(X1,X2,X3)|leq(esk3_3(X2,X3,X1),X3)|leq(esk3_3(X2,X3,X1),X1))).
% 8.81/1.50  cnf(i_0_30, plain, (ismeetu(X1,X2,X3)|leq(esk3_3(X2,X3,X1),X2)|leq(esk3_3(X2,X3,X1),X1))).
% 8.81/1.50  cnf(i_0_31, plain, (ismeetu(X1,X2,X3)|~leq(esk3_3(X2,X3,X1),X1)|~leq(esk3_3(X2,X3,X1),X3)|~leq(esk3_3(X2,X3,X1),X2))).
% 8.81/1.50  cnf(i_0_21, plain, (complement(X1,c(X1))|~test(X1))).
% 8.81/1.50  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 8.81/1.50  # Begin printing tableau
% 8.81/1.50  # Found 7 steps
% 8.81/1.50  cnf(i_0_37, negated_conjecture, (test(esk7_0)), inference(start_rule)).
% 8.81/1.50  cnf(i_0_41, plain, (test(esk7_0)), inference(extension_rule, [i_0_15])).
% 8.81/1.50  cnf(i_0_176, plain, (complement(esk1_1(esk7_0),esk7_0)), inference(extension_rule, [i_0_19])).
% 8.81/1.50  cnf(i_0_243, plain, (multiplication(esk7_0,esk1_1(esk7_0))=zero), inference(extension_rule, [i_0_16])).
% 8.81/1.50  cnf(i_0_118320, plain, (complement(esk7_0,esk1_1(esk7_0))), inference(etableau_closure_rule, [i_0_118320, ...])).
% 8.81/1.50  cnf(i_0_118321, plain, (addition(esk1_1(esk7_0),esk7_0)!=one), inference(etableau_closure_rule, [i_0_118321, ...])).
% 8.81/1.50  cnf(i_0_118323, plain, (multiplication(esk1_1(esk7_0),esk7_0)!=zero), inference(etableau_closure_rule, [i_0_118323, ...])).
% 8.81/1.50  # End printing tableau
% 8.81/1.50  # SZS output end
% 8.81/1.50  # Branches closed with saturation will be marked with an "s"
% 8.81/1.51  # Child (23111) has found a proof.
% 8.81/1.51  
% 8.81/1.51  # Proof search is over...
% 8.81/1.51  # Freeing feature tree
%------------------------------------------------------------------------------