TSTP Solution File: BOO037-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : BOO037-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 : n024.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 14 23:38:29 EDT 2022

% Result   : Satisfiable 21.90s 3.19s
% Output   : CNFRefutation 21.90s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem  : BOO037-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun  1 15:35:21 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  # No SInE strategy applied
% 0.13/0.37  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.13/0.37  # and selection function SelectCQIPrecWNTNp.
% 0.13/0.37  #
% 0.13/0.37  # Presaturation interreduction done
% 0.13/0.37  # Number of axioms: 22 Number of unprocessed: 22
% 0.13/0.37  # Tableaux proof search.
% 0.13/0.37  # APR header successfully linked.
% 0.13/0.37  # Hello from C++
% 0.13/0.38  # The folding up rule is enabled...
% 0.13/0.38  # Local unification is enabled...
% 0.13/0.38  # Any saturation attempts will use folding labels...
% 0.13/0.38  # 22 beginning clauses after preprocessing and clausification
% 0.13/0.38  # No conjectures after preprocessing.  Attempting to resurrect them from ax_archive.
% 0.13/0.38  # No conjectures.
% 0.13/0.38  # There are 22 start rule candidates:
% 0.13/0.38  # Found 10 unit axioms.
% 0.13/0.38  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38  # 22 start rule tableaux created.
% 0.13/0.38  # 12 extension rule candidate clauses
% 0.13/0.38  # 10 unit axiom clauses
% 0.13/0.38  
% 0.13/0.38  # Requested 8, 32 cores available to the main process.
% 21.90/3.19  # 24918 Satisfiable branch
% 21.90/3.19  # Satisfiable branch found.
% 21.90/3.19  # There were 7 total branch saturation attempts.
% 21.90/3.19  # There were 0 of these attempts blocked.
% 21.90/3.19  # There were 0 deferred branch saturation attempts.
% 21.90/3.19  # There were 0 free duplicated saturations.
% 21.90/3.19  # There were 0 total successful branch saturations.
% 21.90/3.19  # There were 0 successful branch saturations in interreduction.
% 21.90/3.19  # There were 0 successful branch saturations on the branch.
% 21.90/3.19  # There were 0 successful branch saturations after the branch.
% 21.90/3.19  # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.90/3.19  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.90/3.19  # Begin clausification derivation
% 21.90/3.19  
% 21.90/3.19  # End clausification derivation
% 21.90/3.19  # Begin listing active clauses obtained from FOF to CNF conversion
% 21.90/3.19  cnf(i_0_28, plain, (sum(X1,additive_identity,X1))).
% 21.90/3.19  cnf(i_0_30, plain, (product(X1,multiplicative_identity,X1))).
% 21.90/3.19  cnf(i_0_27, plain, (sum(additive_identity,X1,X1))).
% 21.90/3.19  cnf(i_0_29, plain, (product(multiplicative_identity,X1,X1))).
% 21.90/3.19  cnf(i_0_40, plain, (sum(X1,inverse(X1),multiplicative_identity))).
% 21.90/3.19  cnf(i_0_42, plain, (product(X1,inverse(X1),additive_identity))).
% 21.90/3.19  cnf(i_0_39, plain, (sum(inverse(X1),X1,multiplicative_identity))).
% 21.90/3.19  cnf(i_0_41, plain, (product(inverse(X1),X1,additive_identity))).
% 21.90/3.19  cnf(i_0_23, plain, (sum(X1,X2,add(X1,X2)))).
% 21.90/3.19  cnf(i_0_24, plain, (product(X1,X2,multiply(X1,X2)))).
% 21.90/3.19  cnf(i_0_25, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))).
% 21.90/3.19  cnf(i_0_26, plain, (product(X1,X2,X3)|~product(X2,X1,X3))).
% 21.90/3.19  cnf(i_0_43, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))).
% 21.90/3.19  cnf(i_0_44, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 21.90/3.19  cnf(i_0_38, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X7,X1)|~sum(X7,X2,X5)|~sum(X6,X2,X4))).
% 21.90/3.19  cnf(i_0_31, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))).
% 21.90/3.19  cnf(i_0_33, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))).
% 21.90/3.19  cnf(i_0_36, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X7,X2)|~sum(X1,X7,X5)|~sum(X1,X6,X4))).
% 21.90/3.19  cnf(i_0_34, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))).
% 21.90/3.19  cnf(i_0_37, plain, (product(X1,X2,X3)|~product(X4,X5,X6)|~sum(X6,X7,X3)|~sum(X5,X7,X2)|~sum(X4,X7,X1))).
% 21.90/3.19  cnf(i_0_35, plain, (product(X1,X2,X3)|~product(X4,X5,X6)|~sum(X7,X6,X3)|~sum(X7,X5,X2)|~sum(X7,X4,X1))).
% 21.90/3.19  cnf(i_0_32, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))).
% 21.90/3.19  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 21.90/3.19  # Begin printing tableau
% 21.90/3.19  # Found 9 steps
% 21.90/3.19  cnf(i_0_30, plain, (product(multiplicative_identity,multiplicative_identity,multiplicative_identity)), inference(start_rule)).
% 21.90/3.19  cnf(i_0_46, plain, (product(multiplicative_identity,multiplicative_identity,multiplicative_identity)), inference(extension_rule, [i_0_26])).
% 21.90/3.19  cnf(i_0_107, plain, (product(multiplicative_identity,multiplicative_identity,multiplicative_identity)), inference(extension_rule, [i_0_38])).
% 21.90/3.19  cnf(i_0_56258, plain, (~product(multiplicative_identity,multiplicative_identity,multiplicative_identity)), inference(closure_rule, [i_0_30])).
% 21.90/3.19  cnf(i_0_56259, plain, (~sum(multiplicative_identity,additive_identity,multiplicative_identity)), inference(closure_rule, [i_0_28])).
% 21.90/3.19  cnf(i_0_56260, plain, (~sum(multiplicative_identity,additive_identity,multiplicative_identity)), inference(closure_rule, [i_0_28])).
% 21.90/3.19  cnf(i_0_56256, plain, (sum(multiplicative_identity,additive_identity,multiplicative_identity)), inference(extension_rule, [i_0_32])).
% 21.90/3.19  cnf(i_0_319236, plain, (~product(additive_identity,multiplicative_identity,additive_identity)), inference(closure_rule, [i_0_30])).
% 21.90/3.19  cnf(i_0_319239, plain, (~sum(additive_identity,multiplicative_identity,multiplicative_identity)), inference(closure_rule, [i_0_27])).
% 21.90/3.19  # End printing tableau
% 21.90/3.19  # SZS output end
% 21.90/3.19  # Branches closed with saturation will be marked with an "s"
% 21.90/3.20  # Child (24918) has found a proof.
% 21.90/3.20  
% 21.90/3.20  # Proof search is over...
% 21.90/3.20  # Freeing feature tree
%------------------------------------------------------------------------------