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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LAT390-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 : n004.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 04:51:58 EDT 2022

% Result   : Unsatisfiable 17.88s 9.21s
% Output   : CNFRefutation 17.88s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LAT390-1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/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 : n004.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 29 11:52:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.37  # No SInE strategy applied
% 0.19/0.37  # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y
% 0.19/0.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.19/0.37  #
% 0.19/0.37  # Number of axioms: 2 Number of unprocessed: 2
% 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  # 2 beginning clauses after preprocessing and clausification
% 0.19/0.37  # Creating start rules for all 1 conjectures.
% 0.19/0.37  # There are 1 start rule candidates:
% 0.19/0.37  # Found 2 unit axioms.
% 0.19/0.37  # 1 start rule tableaux created.
% 0.19/0.37  # 0 extension rule candidate clauses
% 0.19/0.37  # 2 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 1
% 0.19/0.37  # Creating equality axioms
% 0.19/0.37  # Ran out of tableaux, making start rules for all clauses
% 0.19/0.37  # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37  # We now have 8 tableaux to operate on
% 17.88/9.21  # There were 1 total branch saturation attempts.
% 17.88/9.21  # There were 0 of these attempts blocked.
% 17.88/9.21  # There were 0 deferred branch saturation attempts.
% 17.88/9.21  # There were 0 free duplicated saturations.
% 17.88/9.21  # There were 1 total successful branch saturations.
% 17.88/9.21  # There were 0 successful branch saturations in interreduction.
% 17.88/9.21  # There were 0 successful branch saturations on the branch.
% 17.88/9.21  # There were 1 successful branch saturations after the branch.
% 17.88/9.21  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.88/9.21  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.88/9.21  # Begin clausification derivation
% 17.88/9.21  
% 17.88/9.21  # End clausification derivation
% 17.88/9.21  # Begin listing active clauses obtained from FOF to CNF conversion
% 17.88/9.21  cnf(i_0_4, negated_conjecture, (plus(a,mult(b,mult(a,c)))!=a)).
% 17.88/9.21  cnf(i_0_3, plain, (mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(mult(plus(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)),plus(mult(plus(X2,plus(plus(mult(X4,mult(X2,X5)),mult(X6,X2)),X2)),plus(X7,mult(X2,plus(plus(mult(X2,X8),mult(X6,X2)),X2)))),mult(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)))),mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3)))=X2)).
% 17.88/9.21  cnf(i_0_6, plain, (X9=X9)).
% 17.88/9.21  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 17.88/9.21  # Begin printing tableau
% 17.88/9.21  # Found 6 steps
% 17.88/9.21  cnf(i_0_6, plain, (a=a), inference(start_rule)).
% 17.88/9.21  cnf(i_0_14, plain, (a=a), inference(extension_rule, [i_0_10])).
% 17.88/9.21  cnf(i_0_115, plain, ($false), inference(closure_rule, [i_0_6])).
% 17.88/9.21  cnf(i_0_113, plain, (plus(a,mult(b,mult(a,c)))=plus(a,mult(b,mult(a,c)))), inference(extension_rule, [i_0_9])).
% 17.88/9.21  cnf(i_0_120, plain, (plus(a,mult(b,mult(a,c)))=a), inference(closure_rule, [i_0_4])).
% 17.88/9.21  cnf(i_0_122, plain, (plus(a,mult(b,mult(a,c)))!=a), inference(etableau_closure_rule, [i_0_122, ...])).
% 17.88/9.21  # End printing tableau
% 17.88/9.21  # SZS output end
% 17.88/9.21  # Branches closed with saturation will be marked with an "s"
% 17.88/9.23  # There were 1 total branch saturation attempts.
% 17.88/9.23  # There were 0 of these attempts blocked.
% 17.88/9.23  # There were 0 deferred branch saturation attempts.
% 17.88/9.23  # There were 0 free duplicated saturations.
% 17.88/9.23  # There were 1 total successful branch saturations.
% 17.88/9.23  # There were 0 successful branch saturations in interreduction.
% 17.88/9.23  # There were 0 successful branch saturations on the branch.
% 17.88/9.23  # There were 1 successful branch saturations after the branch.
% 17.88/9.23  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.88/9.23  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.88/9.23  # Begin clausification derivation
% 17.88/9.23  
% 17.88/9.23  # End clausification derivation
% 17.88/9.23  # Begin listing active clauses obtained from FOF to CNF conversion
% 17.88/9.23  cnf(i_0_4, negated_conjecture, (plus(a,mult(b,mult(a,c)))!=a)).
% 17.88/9.23  cnf(i_0_3, plain, (mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(mult(plus(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)),plus(mult(plus(X2,plus(plus(mult(X4,mult(X2,X5)),mult(X6,X2)),X2)),plus(X7,mult(X2,plus(plus(mult(X2,X8),mult(X6,X2)),X2)))),mult(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)))),mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3)))=X2)).
% 17.88/9.23  cnf(i_0_6, plain, (X9=X9)).
% 17.88/9.23  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 17.88/9.23  # Begin printing tableau
% 17.88/9.23  # Found 6 steps
% 17.88/9.23  cnf(i_0_3, plain, (mult(plus(mult(plus(X1,a),plus(a,mult(X1,a))),X3),plus(mult(plus(X1,mult(mult(plus(X4,a),plus(a,X5)),a)),plus(mult(plus(a,plus(plus(mult(X4,mult(a,X5)),mult(X6,a)),a)),plus(X7,mult(a,plus(plus(mult(a,X8),mult(X6,a)),a)))),mult(X1,mult(mult(plus(X4,a),plus(a,X5)),a)))),mult(mult(plus(X1,a),plus(a,mult(X1,a))),X3)))=a), inference(start_rule)).
% 17.88/9.23  cnf(i_0_13, plain, (mult(plus(mult(plus(X1,a),plus(a,mult(X1,a))),X3),plus(mult(plus(X1,mult(mult(plus(X4,a),plus(a,X5)),a)),plus(mult(plus(a,plus(plus(mult(X4,mult(a,X5)),mult(X6,a)),a)),plus(X7,mult(a,plus(plus(mult(a,X8),mult(X6,a)),a)))),mult(X1,mult(mult(plus(X4,a),plus(a,X5)),a)))),mult(mult(plus(X1,a),plus(a,mult(X1,a))),X3)))=a), inference(extension_rule, [i_0_9])).
% 17.88/9.23  cnf(i_0_110, plain, (plus(a,mult(b,mult(a,c)))=a), inference(closure_rule, [i_0_4])).
% 17.88/9.23  cnf(i_0_111, plain, (plus(a,mult(b,mult(a,c)))!=mult(plus(mult(plus(X1,a),plus(a,mult(X1,a))),X3),plus(mult(plus(X1,mult(mult(plus(X4,a),plus(a,X5)),a)),plus(mult(plus(a,plus(plus(mult(X4,mult(a,X5)),mult(X6,a)),a)),plus(X7,mult(a,plus(plus(mult(a,X8),mult(X6,a)),a)))),mult(X1,mult(mult(plus(X4,a),plus(a,X5)),a)))),mult(mult(plus(X1,a),plus(a,mult(X1,a))),X3)))), inference(extension_rule, [i_0_9])).
% 17.88/9.23  cnf(i_0_124, plain, (plus(a,mult(b,mult(a,c)))!=mult(plus(mult(plus(X1,plus(a,mult(b,mult(a,c)))),plus(plus(a,mult(b,mult(a,c))),mult(X1,plus(a,mult(b,mult(a,c)))))),X3),plus(mult(plus(X1,mult(mult(plus(X4,plus(a,mult(b,mult(a,c)))),plus(plus(a,mult(b,mult(a,c))),X5)),plus(a,mult(b,mult(a,c))))),plus(mult(plus(plus(a,mult(b,mult(a,c))),plus(plus(mult(X4,mult(plus(a,mult(b,mult(a,c))),X5)),mult(X6,plus(a,mult(b,mult(a,c))))),plus(a,mult(b,mult(a,c))))),plus(X7,mult(plus(a,mult(b,mult(a,c))),plus(plus(mult(plus(a,mult(b,mult(a,c))),X8),mult(X6,plus(a,mult(b,mult(a,c))))),plus(a,mult(b,mult(a,c))))))),mult(X1,mult(mult(plus(X4,plus(a,mult(b,mult(a,c)))),plus(plus(a,mult(b,mult(a,c))),X5)),plus(a,mult(b,mult(a,c))))))),mult(mult(plus(X1,plus(a,mult(b,mult(a,c)))),plus(plus(a,mult(b,mult(a,c))),mult(X1,plus(a,mult(b,mult(a,c)))))),X3)))), inference(closure_rule, [i_0_3])).
% 17.88/9.23  cnf(i_0_125, plain, (mult(plus(mult(plus(X1,plus(a,mult(b,mult(a,c)))),plus(plus(a,mult(b,mult(a,c))),mult(X1,plus(a,mult(b,mult(a,c)))))),X3),plus(mult(plus(X1,mult(mult(plus(X4,plus(a,mult(b,mult(a,c)))),plus(plus(a,mult(b,mult(a,c))),X5)),plus(a,mult(b,mult(a,c))))),plus(mult(plus(plus(a,mult(b,mult(a,c))),plus(plus(mult(X4,mult(plus(a,mult(b,mult(a,c))),X5)),mult(X6,plus(a,mult(b,mult(a,c))))),plus(a,mult(b,mult(a,c))))),plus(X7,mult(plus(a,mult(b,mult(a,c))),plus(plus(mult(plus(a,mult(b,mult(a,c))),X8),mult(X6,plus(a,mult(b,mult(a,c))))),plus(a,mult(b,mult(a,c))))))),mult(X1,mult(mult(plus(X4,plus(a,mult(b,mult(a,c)))),plus(plus(a,mult(b,mult(a,c))),X5)),plus(a,mult(b,mult(a,c))))))),mult(mult(plus(X1,plus(a,mult(b,mult(a,c)))),plus(plus(a,mult(b,mult(a,c))),mult(X1,plus(a,mult(b,mult(a,c)))))),X3)))!=mult(plus(mult(plus(X1,a),plus(a,mult(X1,a))),X3),plus(mult(plus(X1,mult(mult(plus(X4,a),plus(a,X5)),a)),plus(mult(plus(a,plus(plus(mult(X4,mult(a,X5)),mult(X6,a)),a)),plus(X7,mult(a,plus(plus(mult(a,X8),mult(X6,a)),a)))),mult(X1,mult(mult(plus(X4,a),plus(a,X5)),a)))),mult(mult(plus(X1,a),plus(a,mult(X1,a))),X3)))), inference(etableau_closure_rule, [i_0_125, ...])).
% 17.88/9.23  # End printing tableau
% 17.88/9.23  # SZS output end
% 17.88/9.23  # Branches closed with saturation will be marked with an "s"
% 17.88/9.24  # Child (18425) has found a proof.
% 17.88/9.24  
% 17.88/9.24  # Proof search is over...
% 17.88/9.24  # Freeing feature tree
%------------------------------------------------------------------------------