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