TSTP Solution File: GRP667+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP667+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 : n023.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:53 EDT 2022
% Result : Theorem 124.20s 16.01s
% Output : CNFRefutation 124.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP667+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 14:22:51 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.18/0.36 # and selection function SelectNewComplexAHP.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 13 Number of unprocessed: 12
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 12 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 1 conjectures.
% 0.18/0.36 # There are 1 start rule candidates:
% 0.18/0.36 # Found 10 unit axioms.
% 0.18/0.36 # 1 start rule tableaux created.
% 0.18/0.36 # 2 extension rule candidate clauses
% 0.18/0.36 # 10 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.36 # Creating equality axioms
% 0.18/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.36 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 20 tableaux to operate on
% 124.20/16.01 # There were 1 total branch saturation attempts.
% 124.20/16.01 # There were 0 of these attempts blocked.
% 124.20/16.01 # There were 0 deferred branch saturation attempts.
% 124.20/16.01 # There were 0 free duplicated saturations.
% 124.20/16.01 # There were 1 total successful branch saturations.
% 124.20/16.01 # There were 0 successful branch saturations in interreduction.
% 124.20/16.01 # There were 0 successful branch saturations on the branch.
% 124.20/16.01 # There were 1 successful branch saturations after the branch.
% 124.20/16.01 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 124.20/16.01 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 124.20/16.01 # Begin clausification derivation
% 124.20/16.01
% 124.20/16.01 # End clausification derivation
% 124.20/16.01 # Begin listing active clauses obtained from FOF to CNF conversion
% 124.20/16.01 cnf(i_0_5, plain, (mult(X1,unit)=X1)).
% 124.20/16.01 cnf(i_0_6, plain, (mult(unit,X1)=X1)).
% 124.20/16.01 cnf(i_0_9, plain, (mult(f(X1),f(X1))=X1)).
% 124.20/16.01 cnf(i_0_2, plain, (ld(X1,mult(X1,X2))=X2)).
% 124.20/16.01 cnf(i_0_1, plain, (mult(X1,ld(X1,X2))=X2)).
% 124.20/16.01 cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)).
% 124.20/16.01 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=X1)).
% 124.20/16.01 cnf(i_0_8, plain, (mult(mult(X1,X2),X1)=mult(X1,mult(X2,X1)))).
% 124.20/16.01 cnf(i_0_7, plain, (mult(mult(X1,mult(X2,mult(X3,X2))),X3)=mult(mult(X1,X2),mult(X3,mult(X2,X3))))).
% 124.20/16.01 cnf(i_0_13, negated_conjecture, (mult(mult(a,mult(b,a)),c)!=mult(a,mult(b,mult(a,c))))).
% 124.20/16.01 cnf(i_0_12, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3)))|mult(mult(X1,X2),mult(X3,X1))!=mult(X1,mult(mult(X2,X3),X1)))).
% 124.20/16.01 cnf(i_0_10, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3)))|mult(mult(mult(X2,X1),X3),X1)!=mult(X2,mult(X1,mult(X3,X1))))).
% 124.20/16.01 cnf(i_0_27, plain, (X38=X38)).
% 124.20/16.01 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 124.20/16.01 # Begin printing tableau
% 124.20/16.01 # Found 6 steps
% 124.20/16.01 cnf(i_0_5, plain, (mult(mult(a,mult(b,mult(a,c))),unit)=mult(a,mult(b,mult(a,c)))), inference(start_rule)).
% 124.20/16.01 cnf(i_0_35, plain, (mult(mult(a,mult(b,mult(a,c))),unit)=mult(a,mult(b,mult(a,c)))), inference(extension_rule, [i_0_30])).
% 124.20/16.01 cnf(i_0_58, plain, (mult(mult(a,mult(b,a)),c)=mult(a,mult(b,mult(a,c)))), inference(closure_rule, [i_0_13])).
% 124.20/16.01 cnf(i_0_59, plain, (mult(mult(a,mult(b,a)),c)!=mult(mult(a,mult(b,mult(a,c))),unit)), inference(extension_rule, [i_0_30])).
% 124.20/16.01 cnf(i_0_81, plain, (mult(mult(a,mult(b,a)),c)!=mult(mult(mult(a,mult(b,a)),c),unit)), inference(closure_rule, [i_0_5])).
% 124.20/16.01 cnf(i_0_82, plain, (mult(mult(mult(a,mult(b,a)),c),unit)!=mult(mult(a,mult(b,mult(a,c))),unit)), inference(etableau_closure_rule, [i_0_82, ...])).
% 124.20/16.01 # End printing tableau
% 124.20/16.01 # SZS output end
% 124.20/16.01 # Branches closed with saturation will be marked with an "s"
% 124.49/16.06 # Child (27202) has found a proof.
% 124.49/16.06
% 124.49/16.06 # Proof search is over...
% 124.49/16.06 # Freeing feature tree
%------------------------------------------------------------------------------