%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP748+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 : n017.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:17 EDT 2022 % Result : Theorem 0.19s 0.43s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : GRP748+1 : TPTP v8.1.0. Released v4.0.0. % 0.12/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 : n017.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 : Mon Jun 13 21:01:53 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 15 Number of unprocessed: 15 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 15 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 4 conjectures. % 0.12/0.37 # There are 4 start rule candidates: % 0.12/0.37 # Found 14 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 4 start rule tableaux created. % 0.12/0.37 # 1 extension rule candidate clauses % 0.12/0.37 # 14 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 23 tableaux to operate on % 0.19/0.43 # There were 1 total branch saturation attempts. % 0.19/0.43 # There were 0 of these attempts blocked. % 0.19/0.43 # There were 0 deferred branch saturation attempts. % 0.19/0.43 # There were 0 free duplicated saturations. % 0.19/0.43 # There were 1 total successful branch saturations. % 0.19/0.43 # There were 0 successful branch saturations in interreduction. % 0.19/0.43 # There were 0 successful branch saturations on the branch. % 0.19/0.43 # There were 1 successful branch saturations after the branch. % 0.19/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.43 # Begin clausification derivation % 0.19/0.43 % 0.19/0.43 # End clausification derivation % 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.43 cnf(i_0_5, plain, (mult(X1,unit)=X1)). % 0.19/0.43 cnf(i_0_6, plain, (mult(unit,X1)=X1)). % 0.19/0.43 cnf(i_0_9, plain, (mult(X1,i(X1))=unit)). % 0.19/0.43 cnf(i_0_10, plain, (mult(i(X1),X1)=unit)). % 0.19/0.43 cnf(i_0_2, plain, (ld(X1,mult(X1,X2))=X2)). % 0.19/0.43 cnf(i_0_1, plain, (mult(X1,ld(X1,X2))=X2)). % 0.19/0.43 cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)). % 0.19/0.43 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=X1)). % 0.19/0.43 cnf(i_0_8, plain, (mult(mult(X1,X2),i(X2))=X1)). % 0.19/0.43 cnf(i_0_7, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2)))). % 0.19/0.43 cnf(i_0_12, negated_conjecture, (mult(mult(esk12_0,esk10_0),mult(esk11_0,esk12_0))!=mult(esk12_0,mult(mult(esk10_0,esk11_0),esk12_0)))). % 0.19/0.43 cnf(i_0_13, negated_conjecture, (mult(mult(esk9_0,mult(esk7_0,esk8_0)),esk9_0)!=mult(mult(esk9_0,esk7_0),mult(esk8_0,esk9_0)))). % 0.19/0.43 cnf(i_0_15, negated_conjecture, (mult(mult(mult(esk3_0,esk1_0),esk3_0),esk2_0)!=mult(esk3_0,mult(esk1_0,mult(esk3_0,esk2_0))))). % 0.19/0.43 cnf(i_0_14, negated_conjecture, (mult(esk4_0,mult(mult(esk6_0,esk5_0),esk6_0))!=mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))))). % 0.19/0.43 cnf(i_0_11, plain, (mult(i(X1),mult(X1,X2))=X2|mult(X1,X2)=mult(X2,X1))). % 0.19/0.43 cnf(i_0_28, plain, (X47=X47)). % 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.43 # Begin printing tableau % 0.19/0.43 # Found 5 steps % 0.19/0.43 cnf(i_0_5, plain, (mult(X3,unit)=X3), inference(start_rule)). % 0.19/0.43 cnf(i_0_36, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_35])). % 0.19/0.43 cnf(i_0_71, plain, (i(mult(X3,unit))=i(X3)), inference(extension_rule, [i_0_31])). % 0.19/0.43 cnf(i_0_81, plain, (i(X3)!=mult(i(X3),unit)), inference(closure_rule, [i_0_5])). % 0.19/0.43 cnf(i_0_79, plain, (i(mult(X3,unit))=mult(i(X3),unit)), inference(etableau_closure_rule, [i_0_79, ...])). % 0.19/0.43 # End printing tableau % 0.19/0.43 # SZS output end % 0.19/0.43 # Branches closed with saturation will be marked with an "s" % 0.19/0.43 # Child (26212) has found a proof. % 0.19/0.43 % 0.19/0.43 # Proof search is over... % 0.19/0.43 # Freeing feature tree %------------------------------------------------------------------------------