%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP607-1 : TPTP v8.1.0. Released v2.6.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 : n009.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:07:12 EDT 2022 % Result : Unsatisfiable 0.40s 0.62s % Output : CNFRefutation 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : GRP607-1 : TPTP v8.1.0. Released v2.6.0. % 0.03/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.32 % Computer : n009.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 14 10:03:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.35 # No SInE strategy applied % 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.35 # % 0.12/0.35 # Presaturation interreduction done % 0.12/0.35 # Number of axioms: 2 Number of unprocessed: 2 % 0.12/0.35 # Tableaux proof search. % 0.12/0.35 # APR header successfully linked. % 0.12/0.35 # Hello from C++ % 0.40/0.60 # The folding up rule is enabled... % 0.40/0.60 # Local unification is enabled... % 0.40/0.60 # Any saturation attempts will use folding labels... % 0.40/0.60 # 2 beginning clauses after preprocessing and clausification % 0.40/0.60 # Creating start rules for all 1 conjectures. % 0.40/0.60 # There are 1 start rule candidates: % 0.40/0.60 # Found 2 unit axioms. % 0.40/0.60 # 1 start rule tableaux created. % 0.40/0.60 # 0 extension rule candidate clauses % 0.40/0.60 # 2 unit axiom clauses % 0.40/0.60 % 0.40/0.60 # Requested 8, 32 cores available to the main process. % 0.40/0.60 # There are not enough tableaux to fork, creating more from the initial 1 % 0.40/0.60 # Creating equality axioms % 0.40/0.60 # Ran out of tableaux, making start rules for all clauses % 0.40/0.62 # There were 1 total branch saturation attempts. % 0.40/0.62 # There were 0 of these attempts blocked. % 0.40/0.62 # There were 0 deferred branch saturation attempts. % 0.40/0.62 # There were 0 free duplicated saturations. % 0.40/0.62 # There were 1 total successful branch saturations. % 0.40/0.62 # There were 0 successful branch saturations in interreduction. % 0.40/0.62 # There were 0 successful branch saturations on the branch. % 0.40/0.62 # There were 1 successful branch saturations after the branch. % 0.40/0.62 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.40/0.62 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.40/0.62 # Begin clausification derivation % 0.40/0.62 % 0.40/0.62 # End clausification derivation % 0.40/0.62 # Begin listing active clauses obtained from FOF to CNF conversion % 0.40/0.62 cnf(i_0_4, plain, (double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3))))),X3)=X2)). % 0.40/0.62 cnf(i_0_6, negated_conjecture, (inverse(double_divide(inverse(double_divide(c3,b3)),a3))!=inverse(double_divide(c3,inverse(double_divide(b3,a3)))))). % 0.40/0.62 cnf(i_0_8, plain, (X4=X4)). % 0.40/0.62 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.40/0.62 # Begin printing tableau % 0.40/0.62 # Found 6 steps % 0.40/0.62 cnf(i_0_4, plain, (double_divide(inverse(double_divide(X10,inverse(double_divide(inverse(X12),double_divide(X10,X11))))),X11)=X12), inference(start_rule)). % 0.40/0.62 cnf(i_0_14, plain, (double_divide(inverse(double_divide(X10,inverse(double_divide(inverse(X12),double_divide(X10,X11))))),X11)=X12), inference(extension_rule, [i_0_13])). % 0.40/0.62 cnf(i_0_27, plain, (double_divide(inverse(double_divide(X16,inverse(double_divide(inverse(inverse(double_divide(X1,inverse(double_divide(inverse(X9),double_divide(X1,X12)))))),double_divide(X16,X14))))),X14)!=inverse(double_divide(X1,inverse(double_divide(inverse(X9),double_divide(X1,X12)))))), inference(closure_rule, [i_0_4])). % 0.40/0.62 cnf(i_0_26, plain, (double_divide(double_divide(inverse(double_divide(X16,inverse(double_divide(inverse(inverse(double_divide(X1,inverse(double_divide(inverse(X9),double_divide(X1,X12)))))),double_divide(X16,X14))))),X14),double_divide(inverse(double_divide(X10,inverse(double_divide(inverse(X12),double_divide(X10,X11))))),X11))=double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(X9),double_divide(X1,X12))))),X12)), inference(extension_rule, [i_0_11])). % 0.40/0.62 cnf(i_0_35, plain, (double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(X9),double_divide(X1,X12))))),X12)!=X9), inference(closure_rule, [i_0_4])). % 0.40/0.62 cnf(i_0_33, plain, (double_divide(double_divide(inverse(double_divide(X16,inverse(double_divide(inverse(inverse(double_divide(X1,inverse(double_divide(inverse(X9),double_divide(X1,X12)))))),double_divide(X16,X14))))),X14),double_divide(inverse(double_divide(X10,inverse(double_divide(inverse(X12),double_divide(X10,X11))))),X11))=X9), inference(etableau_closure_rule, [i_0_33, ...])). % 0.40/0.62 # End printing tableau % 0.40/0.62 # SZS output end % 0.40/0.62 # Branches closed with saturation will be marked with an "s" % 0.40/0.62 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.40/0.62 # We now have 7 tableaux to operate on % 0.40/0.62 # Found closed tableau during pool population. % 0.40/0.62 # Proof search is over... % 0.40/0.62 # Freeing feature tree %------------------------------------------------------------------------------