TSTP Solution File: RNG035-7 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : RNG035-7 : TPTP v8.1.0. Released v1.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 : 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 : Mon Jul 18 20:27:09 EDT 2022

% Result   : Unsatisfiable 43.79s 5.87s
% Output   : CNFRefutation 43.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : RNG035-7 : TPTP v8.1.0. Released v1.0.0.
% 0.06/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 : n024.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 : Mon May 30 20:19:06 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  # No SInE strategy applied
% 0.12/0.37  # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.12/0.37  # and selection function SelectNewComplexAHP.
% 0.12/0.37  #
% 0.12/0.37  # Presaturation interreduction done
% 0.12/0.37  # Number of axioms: 12 Number of unprocessed: 11
% 0.12/0.37  # Tableaux proof search.
% 0.12/0.37  # APR header successfully linked.
% 0.12/0.37  # Hello from C++
% 0.12/0.37  # The folding up rule is enabled...
% 0.12/0.37  # Local unification is enabled...
% 0.12/0.37  # Any saturation attempts will use folding labels...
% 0.12/0.37  # 11 beginning clauses after preprocessing and clausification
% 0.12/0.37  # Creating start rules for all 2 conjectures.
% 0.12/0.37  # There are 2 start rule candidates:
% 0.12/0.37  # Found 11 unit axioms.
% 0.12/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37  # 2 start rule tableaux created.
% 0.12/0.37  # 0 extension rule candidate clauses
% 0.12/0.37  # 11 unit axiom clauses
% 0.12/0.37  
% 0.12/0.37  # Requested 8, 32 cores available to the main process.
% 0.12/0.37  # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.37  # Creating equality axioms
% 0.12/0.37  # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37  # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37  # We now have 18 tableaux to operate on
% 43.79/5.87  # There were 1 total branch saturation attempts.
% 43.79/5.87  # There were 0 of these attempts blocked.
% 43.79/5.87  # There were 0 deferred branch saturation attempts.
% 43.79/5.87  # There were 0 free duplicated saturations.
% 43.79/5.87  # There were 1 total successful branch saturations.
% 43.79/5.87  # There were 0 successful branch saturations in interreduction.
% 43.79/5.87  # There were 0 successful branch saturations on the branch.
% 43.79/5.87  # There were 1 successful branch saturations after the branch.
% 43.79/5.87  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 43.79/5.87  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 43.79/5.87  # Begin clausification derivation
% 43.79/5.87  
% 43.79/5.87  # End clausification derivation
% 43.79/5.87  # Begin listing active clauses obtained from FOF to CNF conversion
% 43.79/5.87  cnf(i_0_23, negated_conjecture, (multiply(a,b)=c)).
% 43.79/5.87  cnf(i_0_14, plain, (add(X1,additive_identity)=X1)).
% 43.79/5.87  cnf(i_0_13, plain, (add(additive_identity,X1)=X1)).
% 43.79/5.87  cnf(i_0_16, plain, (add(X1,additive_inverse(X1))=additive_identity)).
% 43.79/5.87  cnf(i_0_17, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
% 43.79/5.87  cnf(i_0_19, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 43.79/5.87  cnf(i_0_22, hypothesis, (multiply(X1,multiply(X1,multiply(X1,X1)))=X1)).
% 43.79/5.87  cnf(i_0_20, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
% 43.79/5.87  cnf(i_0_21, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
% 43.79/5.87  cnf(i_0_18, plain, (add(X1,X2)=add(X2,X1))).
% 43.79/5.87  cnf(i_0_24, negated_conjecture, (multiply(b,a)!=c)).
% 43.79/5.87  cnf(i_0_27, plain, (X4=X4)).
% 43.79/5.87  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 43.79/5.87  # Begin printing tableau
% 43.79/5.87  # Found 6 steps
% 43.79/5.87  cnf(i_0_23, negated_conjecture, (multiply(a,b)=c), inference(start_rule)).
% 43.79/5.87  cnf(i_0_34, plain, (multiply(a,b)=c), inference(extension_rule, [i_0_30])).
% 43.79/5.87  cnf(i_0_50, plain, (multiply(b,a)=c), inference(closure_rule, [i_0_24])).
% 43.79/5.87  cnf(i_0_51, plain, (multiply(b,a)!=multiply(a,b)), inference(extension_rule, [i_0_30])).
% 43.79/5.87  cnf(i_0_66, plain, (multiply(b,a)!=add(multiply(b,a),additive_identity)), inference(closure_rule, [i_0_14])).
% 43.79/5.87  cnf(i_0_67, plain, (add(multiply(b,a),additive_identity)!=multiply(a,b)), inference(etableau_closure_rule, [i_0_67, ...])).
% 43.79/5.87  # End printing tableau
% 43.79/5.87  # SZS output end
% 43.79/5.87  # Branches closed with saturation will be marked with an "s"
% 44.01/5.89  # Child (19738) has found a proof.
% 44.01/5.89  
% 44.01/5.89  # Proof search is over...
% 44.01/5.89  # Freeing feature tree
%------------------------------------------------------------------------------