TSTP Solution File: GRP683+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP683+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 : n028.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:08:00 EDT 2022
% Result : Theorem 0.18s 0.44s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP683+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/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 : n028.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 : Mon Jun 13 07:41:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 8 Number of unprocessed: 8
% 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 # 8 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 7 unit axioms.
% 0.18/0.36 # 1 start rule tableaux created.
% 0.18/0.36 # 1 extension rule candidate clauses
% 0.18/0.36 # 7 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 16 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 16 tableaux to operate on
% 0.18/0.44 # There were 1 total branch saturation attempts.
% 0.18/0.44 # There were 0 of these attempts blocked.
% 0.18/0.44 # There were 0 deferred branch saturation attempts.
% 0.18/0.44 # There were 0 free duplicated saturations.
% 0.18/0.44 # There were 1 total successful branch saturations.
% 0.18/0.44 # There were 0 successful branch saturations in interreduction.
% 0.18/0.44 # There were 0 successful branch saturations on the branch.
% 0.18/0.44 # There were 1 successful branch saturations after the branch.
% 0.18/0.44 # There were 1 total branch saturation attempts.
% 0.18/0.44 # There were 0 of these attempts blocked.
% 0.18/0.44 # There were 0 deferred branch saturation attempts.
% 0.18/0.44 # There were 0 free duplicated saturations.
% 0.18/0.44 # There were 1 total successful branch saturations.
% 0.18/0.44 # There were 0 successful branch saturations in interreduction.
% 0.18/0.44 # There were 0 successful branch saturations on the branch.
% 0.18/0.44 # There were 1 successful branch saturations after the branch.
% 0.18/0.44 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Begin clausification derivation
% 0.18/0.44
% 0.18/0.44 # End clausification derivation
% 0.18/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.44 cnf(i_0_3, plain, (ld(X1,mult(X1,X2))=mult(X1,ld(X1,X2)))).
% 0.18/0.44 cnf(i_0_1, plain, (mult(X1,ld(X1,X1))=X1)).
% 0.18/0.44 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=mult(rd(X1,X2),X2))).
% 0.18/0.44 cnf(i_0_7, plain, (mult(rd(rd(X1,X1),X2),X2)=mult(X1,ld(X1,ld(X2,X2))))).
% 0.18/0.44 cnf(i_0_5, plain, (mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(mult(X1,ld(X1,X3)),X4))).
% 0.18/0.44 cnf(i_0_6, plain, (mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,mult(rd(X2,X4),X4)))).
% 0.18/0.44 cnf(i_0_2, plain, (mult(rd(X1,X1),X1)=X1)).
% 0.18/0.44 cnf(i_0_8, negated_conjecture, (mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0)))!=mult(esk1_0,esk3_0)|mult(mult(rd(esk1_0,esk2_0),esk2_0),esk3_0)!=mult(esk1_0,esk3_0))).
% 0.18/0.44 cnf(i_0_15, plain, (X27=X27)).
% 0.18/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.44 # Begin printing tableau
% 0.18/0.44 # Found 6 steps
% 0.18/0.44 cnf(i_0_3, plain, (ld(X8,mult(X8,X7))=mult(X8,ld(X8,X7))), inference(start_rule)).
% 0.18/0.44 cnf(i_0_22, plain, (ld(X8,mult(X8,X7))=mult(X8,ld(X8,X7))), inference(extension_rule, [i_0_19])).
% 0.18/0.44 cnf(i_0_43, plain, (ld(X8,mult(X8,X2))!=mult(X8,ld(X8,X2))), inference(closure_rule, [i_0_3])).
% 0.18/0.44 cnf(i_0_41, plain, (mult(ld(X8,mult(X8,X7)),ld(X8,mult(X8,X2)))=mult(mult(X8,ld(X8,X7)),mult(X8,ld(X8,X2)))), inference(extension_rule, [i_0_18])).
% 0.18/0.44 cnf(i_0_58, plain, (mult(mult(X8,ld(X8,X7)),mult(X8,ld(X8,X2)))!=mult(ld(X8,X2),ld(ld(X8,X2),mult(X7,mult(X8,ld(X8,X2)))))), inference(closure_rule, [i_0_5])).
% 0.18/0.44 cnf(i_0_56, plain, (mult(ld(X8,mult(X8,X7)),ld(X8,mult(X8,X2)))=mult(ld(X8,X2),ld(ld(X8,X2),mult(X7,mult(X8,ld(X8,X2)))))), inference(etableau_closure_rule, [i_0_56, ...])).
% 0.18/0.44 # End printing tableau
% 0.18/0.44 # SZS output end
% 0.18/0.44 # Branches closed with saturation will be marked with an "s"
% 0.18/0.44 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Begin clausification derivation
% 0.18/0.44
% 0.18/0.44 # End clausification derivation
% 0.18/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.44 cnf(i_0_3, plain, (ld(X1,mult(X1,X2))=mult(X1,ld(X1,X2)))).
% 0.18/0.44 cnf(i_0_1, plain, (mult(X1,ld(X1,X1))=X1)).
% 0.18/0.44 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=mult(rd(X1,X2),X2))).
% 0.18/0.44 cnf(i_0_7, plain, (mult(rd(rd(X1,X1),X2),X2)=mult(X1,ld(X1,ld(X2,X2))))).
% 0.18/0.44 cnf(i_0_5, plain, (mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(mult(X1,ld(X1,X3)),X4))).
% 0.18/0.44 cnf(i_0_6, plain, (mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,mult(rd(X2,X4),X4)))).
% 0.18/0.44 cnf(i_0_2, plain, (mult(rd(X1,X1),X1)=X1)).
% 0.18/0.44 cnf(i_0_8, negated_conjecture, (mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0)))!=mult(esk1_0,esk3_0)|mult(mult(rd(esk1_0,esk2_0),esk2_0),esk3_0)!=mult(esk1_0,esk3_0))).
% 0.18/0.44 cnf(i_0_15, plain, (X27=X27)).
% 0.18/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.44 # Begin printing tableau
% 0.18/0.44 # Found 6 steps
% 0.18/0.44 cnf(i_0_3, plain, (ld(X10,mult(X10,X9))=mult(X10,ld(X10,X9))), inference(start_rule)).
% 0.18/0.44 cnf(i_0_22, plain, (ld(X10,mult(X10,X9))=mult(X10,ld(X10,X9))), inference(extension_rule, [i_0_19])).
% 0.18/0.44 cnf(i_0_42, plain, (ld(X1,mult(X1,X2))!=mult(X1,ld(X1,X2))), inference(closure_rule, [i_0_3])).
% 0.18/0.44 cnf(i_0_41, plain, (mult(ld(X1,mult(X1,X2)),ld(X10,mult(X10,X9)))=mult(mult(X1,ld(X1,X2)),mult(X10,ld(X10,X9)))), inference(extension_rule, [i_0_18])).
% 0.18/0.44 cnf(i_0_58, plain, (mult(mult(X1,ld(X1,X2)),mult(X10,ld(X10,X9)))!=mult(ld(X1,X2),ld(ld(X1,X2),mult(X2,mult(X10,ld(X10,X9)))))), inference(closure_rule, [i_0_5])).
% 0.18/0.44 cnf(i_0_56, plain, (mult(ld(X1,mult(X1,X2)),ld(X10,mult(X10,X9)))=mult(ld(X1,X2),ld(ld(X1,X2),mult(X2,mult(X10,ld(X10,X9)))))), inference(etableau_closure_rule, [i_0_56, ...])).
% 0.18/0.44 # End printing tableau
% 0.18/0.44 # SZS output end
% 0.18/0.44 # Branches closed with saturation will be marked with an "s"
% 0.18/0.44 # There were 1 total branch saturation attempts.
% 0.18/0.44 # There were 0 of these attempts blocked.
% 0.18/0.44 # There were 0 deferred branch saturation attempts.
% 0.18/0.44 # There were 0 free duplicated saturations.
% 0.18/0.44 # There were 1 total successful branch saturations.
% 0.18/0.44 # There were 0 successful branch saturations in interreduction.
% 0.18/0.44 # There were 0 successful branch saturations on the branch.
% 0.18/0.44 # There were 1 successful branch saturations after the branch.
% 0.18/0.44 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Begin clausification derivation
% 0.18/0.44
% 0.18/0.44 # End clausification derivation
% 0.18/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.44 cnf(i_0_3, plain, (ld(X1,mult(X1,X2))=mult(X1,ld(X1,X2)))).
% 0.18/0.44 cnf(i_0_1, plain, (mult(X1,ld(X1,X1))=X1)).
% 0.18/0.44 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=mult(rd(X1,X2),X2))).
% 0.18/0.44 cnf(i_0_7, plain, (mult(rd(rd(X1,X1),X2),X2)=mult(X1,ld(X1,ld(X2,X2))))).
% 0.18/0.44 cnf(i_0_5, plain, (mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(mult(X1,ld(X1,X3)),X4))).
% 0.18/0.44 cnf(i_0_6, plain, (mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,mult(rd(X2,X4),X4)))).
% 0.18/0.44 cnf(i_0_2, plain, (mult(rd(X1,X1),X1)=X1)).
% 0.18/0.44 cnf(i_0_8, negated_conjecture, (mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0)))!=mult(esk1_0,esk3_0)|mult(mult(rd(esk1_0,esk2_0),esk2_0),esk3_0)!=mult(esk1_0,esk3_0))).
% 0.18/0.44 cnf(i_0_15, plain, (X27=X27)).
% 0.18/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.44 # Begin printing tableau
% 0.18/0.44 # Found 6 steps
% 0.18/0.44 cnf(i_0_3, plain, (ld(X7,mult(X7,X8))=mult(X7,ld(X7,X8))), inference(start_rule)).
% 0.18/0.44 cnf(i_0_22, plain, (ld(X7,mult(X7,X8))=mult(X7,ld(X7,X8))), inference(extension_rule, [i_0_21])).
% 0.18/0.44 cnf(i_0_48, plain, (ld(X12,mult(X12,X11))!=mult(X12,ld(X12,X11))), inference(closure_rule, [i_0_3])).
% 0.18/0.44 cnf(i_0_47, plain, (rd(ld(X12,mult(X12,X11)),ld(X7,mult(X7,X8)))=rd(mult(X12,ld(X12,X11)),mult(X7,ld(X7,X8)))), inference(extension_rule, [i_0_19])).
% 0.18/0.44 cnf(i_0_131, plain, (ld(X1,mult(X1,X2))!=mult(X1,ld(X1,X2))), inference(closure_rule, [i_0_3])).
% 0.18/0.44 cnf(i_0_129, plain, (mult(rd(ld(X12,mult(X12,X11)),ld(X7,mult(X7,X8))),ld(X1,mult(X1,X2)))=mult(rd(mult(X12,ld(X12,X11)),mult(X7,ld(X7,X8))),mult(X1,ld(X1,X2)))), inference(etableau_closure_rule, [i_0_129, ...])).
% 0.18/0.44 # End printing tableau
% 0.18/0.44 # SZS output end
% 0.18/0.44 # Branches closed with saturation will be marked with an "s"
% 0.18/0.44 # There were 1 total branch saturation attempts.
% 0.18/0.44 # There were 0 of these attempts blocked.
% 0.18/0.44 # There were 0 deferred branch saturation attempts.
% 0.18/0.44 # There were 0 free duplicated saturations.
% 0.18/0.44 # There were 1 total successful branch saturations.
% 0.18/0.44 # There were 0 successful branch saturations in interreduction.
% 0.18/0.44 # There were 0 successful branch saturations on the branch.
% 0.18/0.44 # There were 1 successful branch saturations after the branch.
% 0.18/0.44 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Begin clausification derivation
% 0.18/0.44
% 0.18/0.44 # End clausification derivation
% 0.18/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.44 cnf(i_0_3, plain, (ld(X1,mult(X1,X2))=mult(X1,ld(X1,X2)))).
% 0.18/0.44 cnf(i_0_1, plain, (mult(X1,ld(X1,X1))=X1)).
% 0.18/0.44 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=mult(rd(X1,X2),X2))).
% 0.18/0.44 cnf(i_0_7, plain, (mult(rd(rd(X1,X1),X2),X2)=mult(X1,ld(X1,ld(X2,X2))))).
% 0.18/0.44 cnf(i_0_5, plain, (mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(mult(X1,ld(X1,X3)),X4))).
% 0.18/0.44 cnf(i_0_6, plain, (mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,mult(rd(X2,X4),X4)))).
% 0.18/0.44 cnf(i_0_2, plain, (mult(rd(X1,X1),X1)=X1)).
% 0.18/0.44 cnf(i_0_8, negated_conjecture, (mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0)))!=mult(esk1_0,esk3_0)|mult(mult(rd(esk1_0,esk2_0),esk2_0),esk3_0)!=mult(esk1_0,esk3_0))).
% 0.18/0.44 cnf(i_0_15, plain, (X27=X27)).
% 0.18/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.44 # Begin printing tableau
% 0.18/0.44 # Found 6 steps
% 0.18/0.44 cnf(i_0_3, plain, (ld(X12,mult(X12,X11))=mult(X12,ld(X12,X11))), inference(start_rule)).
% 0.18/0.44 cnf(i_0_22, plain, (ld(X12,mult(X12,X11))=mult(X12,ld(X12,X11))), inference(extension_rule, [i_0_21])).
% 0.18/0.44 cnf(i_0_49, plain, (ld(X9,mult(X9,X10))!=mult(X9,ld(X9,X10))), inference(closure_rule, [i_0_3])).
% 0.18/0.44 cnf(i_0_47, plain, (rd(ld(X12,mult(X12,X11)),ld(X9,mult(X9,X10)))=rd(mult(X12,ld(X12,X11)),mult(X9,ld(X9,X10)))), inference(extension_rule, [i_0_19])).
% 0.18/0.44 cnf(i_0_131, plain, (ld(X1,mult(X1,X2))!=mult(X1,ld(X1,X2))), inference(closure_rule, [i_0_3])).
% 0.18/0.44 cnf(i_0_129, plain, (mult(rd(ld(X12,mult(X12,X11)),ld(X9,mult(X9,X10))),ld(X1,mult(X1,X2)))=mult(rd(mult(X12,ld(X12,X11)),mult(X9,ld(X9,X10))),mult(X1,ld(X1,X2)))), inference(etableau_closure_rule, [i_0_129, ...])).
% 0.18/0.44 # End printing tableau
% 0.18/0.44 # SZS output end
% 0.18/0.44 # Branches closed with saturation will be marked with an "s"
% 0.18/0.44 # Child (16736) has found a proof.
% 0.18/0.44
% 0.18/0.44 # Proof search is over...
% 0.18/0.44 # Freeing feature tree
%------------------------------------------------------------------------------