TSTP Solution File: GRP667+6 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP667+6 : 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 : n010.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 : Sat Jul 16 09:07:54 EDT 2022
% Result : Theorem 85.41s 11.12s
% Output : CNFRefutation 85.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP667+6 : 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.12/0.34 % Computer : n010.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 : Tue Jun 14 10:50:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.20/0.37 # and selection function SelectNewComplexAHP.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 13 Number of unprocessed: 13
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 13 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 4 conjectures.
% 0.20/0.37 # There are 4 start rule candidates:
% 0.20/0.37 # Found 13 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 4 start rule tableaux created.
% 0.20/0.37 # 0 extension rule candidate clauses
% 0.20/0.37 # 13 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.20/0.37 # Creating equality axioms
% 0.20/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.37 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 21 tableaux to operate on
% 85.41/11.12 # There were 1 total branch saturation attempts.
% 85.41/11.12 # There were 0 of these attempts blocked.
% 85.41/11.12 # There were 0 deferred branch saturation attempts.
% 85.41/11.12 # There were 0 free duplicated saturations.
% 85.41/11.12 # There were 1 total successful branch saturations.
% 85.41/11.12 # There were 0 successful branch saturations in interreduction.
% 85.41/11.12 # There were 0 successful branch saturations on the branch.
% 85.41/11.12 # There were 1 successful branch saturations after the branch.
% 85.41/11.12 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 85.41/11.12 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 85.41/11.12 # Begin clausification derivation
% 85.41/11.12
% 85.41/11.12 # End clausification derivation
% 85.41/11.12 # Begin listing active clauses obtained from FOF to CNF conversion
% 85.41/11.12 cnf(i_0_5, plain, (mult(X1,unit)=X1)).
% 85.41/11.12 cnf(i_0_6, plain, (mult(unit,X1)=X1)).
% 85.41/11.12 cnf(i_0_9, plain, (mult(f(X1),f(X1))=X1)).
% 85.41/11.12 cnf(i_0_2, plain, (ld(X1,mult(X1,X2))=X2)).
% 85.41/11.12 cnf(i_0_1, plain, (mult(X1,ld(X1,X2))=X2)).
% 85.41/11.12 cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)).
% 85.41/11.12 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=X1)).
% 85.41/11.12 cnf(i_0_8, plain, (mult(mult(X1,X2),X1)=mult(X1,mult(X2,X1)))).
% 85.41/11.12 cnf(i_0_7, plain, (mult(mult(X1,mult(X2,mult(X3,X2))),X3)=mult(mult(X1,X2),mult(X3,mult(X2,X3))))).
% 85.41/11.12 cnf(i_0_10, negated_conjecture, (mult(mult(esk12_0,esk10_0),mult(esk11_0,esk12_0))!=mult(esk12_0,mult(mult(esk10_0,esk11_0),esk12_0)))).
% 85.41/11.12 cnf(i_0_12, negated_conjecture, (mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0)!=mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))))).
% 85.41/11.12 cnf(i_0_13, negated_conjecture, (mult(mult(esk3_0,mult(esk1_0,esk3_0)),esk2_0)!=mult(esk3_0,mult(esk1_0,mult(esk3_0,esk2_0))))).
% 85.41/11.12 cnf(i_0_11, negated_conjecture, (mult(mult(esk9_0,esk7_0),mult(esk8_0,esk9_0))!=mult(esk9_0,mult(mult(esk7_0,esk8_0),esk9_0)))).
% 85.41/11.12 cnf(i_0_18, plain, (X44=X44)).
% 85.41/11.12 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 85.41/11.12 # Begin printing tableau
% 85.41/11.12 # Found 5 steps
% 85.41/11.12 cnf(i_0_5, plain, (mult(X2,unit)=X2), inference(start_rule)).
% 85.41/11.12 cnf(i_0_26, plain, (mult(X2,unit)=X2), inference(extension_rule, [i_0_25])).
% 85.41/11.12 cnf(i_0_56, plain, (f(mult(X2,unit))=f(X2)), inference(extension_rule, [i_0_21])).
% 85.41/11.12 cnf(i_0_64, plain, (f(X2)!=mult(f(X2),unit)), inference(closure_rule, [i_0_5])).
% 85.41/11.12 cnf(i_0_62, plain, (f(mult(X2,unit))=mult(f(X2),unit)), inference(etableau_closure_rule, [i_0_62, ...])).
% 85.41/11.12 # End printing tableau
% 85.41/11.12 # SZS output end
% 85.41/11.12 # Branches closed with saturation will be marked with an "s"
% 85.88/11.15 # Child (25419) has found a proof.
% 85.88/11.15
% 85.88/11.15 # Proof search is over...
% 85.88/11.15 # Freeing feature tree
%------------------------------------------------------------------------------