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