%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP083-1 : TPTP v8.1.0. Bugfixed v2.3.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:04:19 EDT 2022 % Result : Unsatisfiable 2.14s 2.29s % Output : CNFRefutation 2.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP083-1 : TPTP v8.1.0. Bugfixed v2.3.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n017.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 14 02:43:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 2 Number of unprocessed: 2 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 1.37/1.52 # The folding up rule is enabled... % 1.37/1.52 # Local unification is enabled... % 1.37/1.52 # Any saturation attempts will use folding labels... % 1.37/1.52 # 2 beginning clauses after preprocessing and clausification % 1.37/1.52 # Creating start rules for all 1 conjectures. % 1.37/1.52 # There are 1 start rule candidates: % 1.37/1.52 # Found 1 unit axioms. % 1.37/1.52 # 1 start rule tableaux created. % 1.37/1.52 # 1 extension rule candidate clauses % 1.37/1.52 # 1 unit axiom clauses % 1.37/1.52 % 1.37/1.52 # Requested 8, 32 cores available to the main process. % 1.37/1.52 # There are not enough tableaux to fork, creating more from the initial 1 % 1.37/1.52 # Creating equality axioms % 1.37/1.52 # Ran out of tableaux, making start rules for all clauses % 2.14/2.29 # There were 2 total branch saturation attempts. % 2.14/2.29 # There were 0 of these attempts blocked. % 2.14/2.29 # There were 0 deferred branch saturation attempts. % 2.14/2.29 # There were 0 free duplicated saturations. % 2.14/2.29 # There were 2 total successful branch saturations. % 2.14/2.29 # There were 0 successful branch saturations in interreduction. % 2.14/2.29 # There were 0 successful branch saturations on the branch. % 2.14/2.29 # There were 2 successful branch saturations after the branch. % 2.14/2.29 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.14/2.29 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.14/2.29 # Begin clausification derivation % 2.14/2.29 % 2.14/2.29 # End clausification derivation % 2.14/2.29 # Begin listing active clauses obtained from FOF to CNF conversion % 2.14/2.29 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.14/2.29 cnf(i_0_6, negated_conjecture, (inverse(double_divide(inverse(double_divide(c3,b3)),a3))!=inverse(double_divide(c3,inverse(double_divide(b3,a3))))|inverse(double_divide(a1,inverse(a1)))!=inverse(double_divide(b1,inverse(b1)))|inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2)))))!=a2)). % 2.14/2.29 cnf(i_0_19, plain, (X5=X5)). % 2.14/2.29 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.14/2.29 # Begin printing tableau % 2.14/2.29 # Found 5 steps % 2.14/2.29 cnf(i_0_4, plain, (double_divide(double_divide(X15,inverse(double_divide(X16,X18))),double_divide(inverse(X16),inverse(double_divide(X17,double_divide(X15,X17)))))=X18), inference(start_rule)). % 2.14/2.29 cnf(i_0_25, plain, (double_divide(double_divide(X15,inverse(double_divide(X16,X18))),double_divide(inverse(X16),inverse(double_divide(X17,double_divide(X15,X17)))))=X18), inference(extension_rule, [i_0_24])). % 2.14/2.29 cnf(i_0_43, plain, (inverse(double_divide(double_divide(X15,inverse(double_divide(X16,X18))),double_divide(inverse(X16),inverse(double_divide(X17,double_divide(X15,X17))))))=inverse(X18)), inference(extension_rule, [i_0_23])). % 2.14/2.29 cnf(i_0_56, plain, ($false), inference(closure_rule, [i_0_19])). % 2.14/2.29 cnf(i_0_55, plain, (double_divide(X2,inverse(double_divide(double_divide(X15,inverse(double_divide(X16,X18))),double_divide(inverse(X16),inverse(double_divide(X17,double_divide(X15,X17)))))))=double_divide(X2,inverse(X18))), inference(etableau_closure_rule, [i_0_55, ...])). % 2.14/2.29 # End printing tableau % 2.14/2.29 # SZS output end % 2.14/2.29 # Branches closed with saturation will be marked with an "s" % 2.14/2.29 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 2.14/2.29 # We now have 9 tableaux to operate on % 2.14/2.29 # Found closed tableau during pool population. % 2.14/2.29 # Proof search is over... % 2.14/2.29 # Freeing feature tree %------------------------------------------------------------------------------