%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP710-10 : TPTP v8.1.0. Released v8.1.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 : n019.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:09 EDT 2022 % Result : Unsatisfiable 0.15s 0.40s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : GRP710-10 : TPTP v8.1.0. Released v8.1.0. % 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.37 % Computer : n019.cluster.edu % 0.15/0.37 % Model : x86_64 x86_64 % 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.37 % Memory : 8042.1875MB % 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.37 % CPULimit : 300 % 0.15/0.37 % WCLimit : 600 % 0.15/0.37 % DateTime : Tue Jun 14 12:59:39 EDT 2022 % 0.15/0.37 % CPUTime : % 0.15/0.40 # No SInE strategy applied % 0.15/0.40 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.15/0.40 # and selection function SelectNewComplexAHP. % 0.15/0.40 # % 0.15/0.40 # Presaturation interreduction done % 0.15/0.40 # Number of axioms: 6 Number of unprocessed: 6 % 0.15/0.40 # Tableaux proof search. % 0.15/0.40 # APR header successfully linked. % 0.15/0.40 # Hello from C++ % 0.15/0.40 # The folding up rule is enabled... % 0.15/0.40 # Local unification is enabled... % 0.15/0.40 # Any saturation attempts will use folding labels... % 0.15/0.40 # 6 beginning clauses after preprocessing and clausification % 0.15/0.40 # Creating start rules for all 1 conjectures. % 0.15/0.40 # There are 1 start rule candidates: % 0.15/0.40 # Found 6 unit axioms. % 0.15/0.40 # 1 start rule tableaux created. % 0.15/0.40 # 0 extension rule candidate clauses % 0.15/0.40 # 6 unit axiom clauses % 0.15/0.40 % 0.15/0.40 # Requested 8, 32 cores available to the main process. % 0.15/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.15/0.40 # Creating equality axioms % 0.15/0.40 # Ran out of tableaux, making start rules for all clauses % 0.15/0.40 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.15/0.40 # We now have 10 tableaux to operate on % 0.15/0.40 # There were 1 total branch saturation attempts. % 0.15/0.40 # There were 0 of these attempts blocked. % 0.15/0.40 # There were 0 deferred branch saturation attempts. % 0.15/0.40 # There were 0 free duplicated saturations. % 0.15/0.40 # There were 1 total successful branch saturations. % 0.15/0.40 # There were 0 successful branch saturations in interreduction. % 0.15/0.40 # There were 0 successful branch saturations on the branch. % 0.15/0.40 # There were 1 successful branch saturations after the branch. % 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.40 # Begin clausification derivation % 0.15/0.40 % 0.15/0.40 # End clausification derivation % 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.40 cnf(i_0_7, plain, (mult(X1,unit)=X1)). % 0.15/0.40 cnf(i_0_8, plain, (mult(unit,X1)=X1)). % 0.15/0.40 cnf(i_0_10, plain, (mult(X1,i(X1))=unit)). % 0.15/0.40 cnf(i_0_11, plain, (mult(i(X1),X1)=unit)). % 0.15/0.40 cnf(i_0_9, plain, (mult(mult(mult(X1,X2),X2),X3)=mult(X1,mult(X2,mult(X2,X3))))). % 0.15/0.40 cnf(i_0_12, negated_conjecture, (mult(x0,X1)!=x1)). % 0.15/0.40 cnf(i_0_14, plain, (X4=X4)). % 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.40 # Begin printing tableau % 0.15/0.40 # Found 6 steps % 0.15/0.40 cnf(i_0_7, plain, (mult(X7,unit)=X7), inference(start_rule)). % 0.15/0.40 cnf(i_0_20, plain, (mult(X7,unit)=X7), inference(extension_rule, [i_0_18])). % 0.15/0.40 cnf(i_0_36, plain, (mult(unit,unit)!=unit), inference(closure_rule, [i_0_7])). % 0.15/0.40 cnf(i_0_34, plain, (mult(mult(X7,unit),mult(unit,unit))=mult(X7,unit)), inference(extension_rule, [i_0_17])). % 0.15/0.40 cnf(i_0_45, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_7])). % 0.15/0.40 cnf(i_0_43, plain, (mult(mult(X7,unit),mult(unit,unit))=X7), inference(etableau_closure_rule, [i_0_43, ...])). % 0.15/0.40 # End printing tableau % 0.15/0.40 # SZS output end % 0.15/0.40 # Branches closed with saturation will be marked with an "s" % 0.15/0.40 # There were 1 total branch saturation attempts. % 0.15/0.40 # There were 0 of these attempts blocked. % 0.15/0.40 # There were 0 deferred branch saturation attempts. % 0.15/0.40 # There were 0 free duplicated saturations. % 0.15/0.40 # There were 1 total successful branch saturations. % 0.15/0.40 # There were 0 successful branch saturations in interreduction. % 0.15/0.40 # There were 0 successful branch saturations on the branch. % 0.15/0.40 # There were 1 successful branch saturations after the branch. % 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.40 # Begin clausification derivation % 0.15/0.40 % 0.15/0.40 # End clausification derivation % 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.40 cnf(i_0_7, plain, (mult(X1,unit)=X1)). % 0.15/0.40 cnf(i_0_8, plain, (mult(unit,X1)=X1)). % 0.15/0.40 cnf(i_0_10, plain, (mult(X1,i(X1))=unit)). % 0.15/0.40 cnf(i_0_11, plain, (mult(i(X1),X1)=unit)). % 0.15/0.40 cnf(i_0_9, plain, (mult(mult(mult(X1,X2),X2),X3)=mult(X1,mult(X2,mult(X2,X3))))). % 0.15/0.40 cnf(i_0_12, negated_conjecture, (mult(x0,X1)!=x1)). % 0.15/0.40 cnf(i_0_14, plain, (X4=X4)). % 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.40 # Begin printing tableau % 0.15/0.40 # Found 5 steps % 0.15/0.40 cnf(i_0_7, plain, (mult(X3,unit)=X3), inference(start_rule)). % 0.15/0.40 cnf(i_0_20, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_19])). % 0.15/0.40 cnf(i_0_37, plain, (i(mult(X3,unit))=i(X3)), inference(extension_rule, [i_0_17])). % 0.15/0.40 cnf(i_0_45, plain, (i(X3)!=mult(i(X3),unit)), inference(closure_rule, [i_0_7])). % 0.15/0.40 cnf(i_0_43, plain, (i(mult(X3,unit))=mult(i(X3),unit)), inference(etableau_closure_rule, [i_0_43, ...])). % 0.15/0.40 # End printing tableau % 0.15/0.40 # SZS output end % 0.15/0.40 # Branches closed with saturation will be marked with an "s" % 0.15/0.40 # Child (13593) has found a proof. % 0.15/0.40 % 0.15/0.40 # Proof search is over... % 0.15/0.40 # Freeing feature tree %------------------------------------------------------------------------------