%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP503-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 : n023.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:06:45 EDT 2022 % Result : Unsatisfiable 2.83s 3.03s % Output : CNFRefutation 2.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GRP503-1 : TPTP v8.1.0. Released v2.6.0. % 0.08/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 : n023.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 : Tue Jun 14 14:14:50 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 2 Number of unprocessed: 2 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 2.61/2.79 # The folding up rule is enabled... % 2.61/2.79 # Local unification is enabled... % 2.61/2.79 # Any saturation attempts will use folding labels... % 2.61/2.79 # 2 beginning clauses after preprocessing and clausification % 2.61/2.79 # Creating start rules for all 1 conjectures. % 2.61/2.79 # There are 1 start rule candidates: % 2.61/2.79 # Found 2 unit axioms. % 2.61/2.79 # 1 start rule tableaux created. % 2.61/2.79 # 0 extension rule candidate clauses % 2.61/2.79 # 2 unit axiom clauses % 2.61/2.79 % 2.61/2.79 # Requested 8, 32 cores available to the main process. % 2.61/2.79 # There are not enough tableaux to fork, creating more from the initial 1 % 2.61/2.79 # Creating equality axioms % 2.61/2.79 # Ran out of tableaux, making start rules for all clauses % 2.83/3.03 # There were 1 total branch saturation attempts. % 2.83/3.03 # There were 0 of these attempts blocked. % 2.83/3.03 # There were 0 deferred branch saturation attempts. % 2.83/3.03 # There were 0 free duplicated saturations. % 2.83/3.03 # There were 1 total successful branch saturations. % 2.83/3.03 # There were 0 successful branch saturations in interreduction. % 2.83/3.03 # There were 0 successful branch saturations on the branch. % 2.83/3.03 # There were 1 successful branch saturations after the branch. % 2.83/3.03 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/3.03 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/3.03 # Begin clausification derivation % 2.83/3.03 % 2.83/3.03 # End clausification derivation % 2.83/3.03 # Begin listing active clauses obtained from FOF to CNF conversion % 2.83/3.03 cnf(i_0_4, plain, (double_divide(double_divide(X1,inverse(double_divide(X2,X3))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4)))))=X3)). % 2.83/3.03 cnf(i_0_6, negated_conjecture, (inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2)))))!=a2)). % 2.83/3.03 cnf(i_0_8, plain, (X5=X5)). % 2.83/3.03 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.83/3.03 # Begin printing tableau % 2.83/3.03 # Found 5 steps % 2.83/3.03 cnf(i_0_4, plain, (double_divide(double_divide(X13,inverse(double_divide(X14,double_divide(a2,inverse(double_divide(b2,inverse(b2))))))),double_divide(inverse(X14),inverse(double_divide(X15,double_divide(X13,X15)))))=double_divide(a2,inverse(double_divide(b2,inverse(b2))))), inference(start_rule)). % 2.83/3.03 cnf(i_0_14, plain, (double_divide(double_divide(X13,inverse(double_divide(X14,double_divide(a2,inverse(double_divide(b2,inverse(b2))))))),double_divide(inverse(X14),inverse(double_divide(X15,double_divide(X13,X15)))))=double_divide(a2,inverse(double_divide(b2,inverse(b2))))), inference(extension_rule, [i_0_13])). % 2.83/3.03 cnf(i_0_27, plain, (inverse(double_divide(double_divide(X13,inverse(double_divide(X14,double_divide(a2,inverse(double_divide(b2,inverse(b2))))))),double_divide(inverse(X14),inverse(double_divide(X15,double_divide(X13,X15))))))=inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2)))))), inference(extension_rule, [i_0_11])). % 2.83/3.03 cnf(i_0_33, plain, (a2=inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2)))))), inference(closure_rule, [i_0_6])). % 2.83/3.03 cnf(i_0_34, plain, (a2!=inverse(double_divide(double_divide(X13,inverse(double_divide(X14,double_divide(a2,inverse(double_divide(b2,inverse(b2))))))),double_divide(inverse(X14),inverse(double_divide(X15,double_divide(X13,X15))))))), inference(etableau_closure_rule, [i_0_34, ...])). % 2.83/3.03 # End printing tableau % 2.83/3.03 # SZS output end % 2.83/3.03 # Branches closed with saturation will be marked with an "s" % 2.83/3.03 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 2.83/3.03 # We now have 7 tableaux to operate on % 2.83/3.03 # Found closed tableau during pool population. % 2.83/3.03 # Proof search is over... % 2.83/3.03 # Freeing feature tree %------------------------------------------------------------------------------