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