%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYO613-1 : TPTP v8.1.0. Released v7.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 : n021.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 : Thu Jul 21 16:05:44 EDT 2022 % Result : Unsatisfiable 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYO613-1 : TPTP v8.1.0. Released v7.1.0. % 0.06/0.12 % 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 : n021.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 : Fri Jul 8 19:19:20 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 5 Number of unprocessed: 5 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 5 beginning clauses after preprocessing and clausification % 0.13/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.13/0.37 # No conjectures. % 0.13/0.37 # There are 5 start rule candidates: % 0.13/0.37 # Found 2 unit axioms. % 0.13/0.37 # Closed tableau found in foldup close cycle with 0 folds and 11 closures done. % 0.13/0.37 # Found closed tableau while making start rule % 0.13/0.37 # There were 0 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 0 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_6, plain, (le(X1,X1))). % 0.13/0.37 cnf(i_0_9, plain, (eq(f(X1),a0))). % 0.13/0.37 cnf(i_0_8, plain, (le(X1,X2)|~le(max(X3,X1),X2))). % 0.13/0.37 cnf(i_0_7, plain, (le(X1,X2)|~le(max(X1,X3),X2))). % 0.13/0.37 cnf(i_0_10, plain, (~le(s(X1),X2)|~le(s(X3),X1)|~le(s(X4),X3)|~le(s(X5),X4)|~le(s(X6),X5)|~le(s(X7),X6)|~le(s(X8),X7)|~le(s(X9),X8)|~le(s(X10),X9)|~le(s(X11),X10)|~le(s(X12),X11))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 12 steps % 0.13/0.37 cnf(i_0_10, plain, (~le(s(s(s(s(s(s(s(s(s(s(s(X16))))))))))),s(s(s(s(s(s(s(s(s(s(s(X16))))))))))))|~le(s(s(s(s(s(s(s(s(s(s(X16)))))))))),s(s(s(s(s(s(s(s(s(s(X16)))))))))))|~le(s(s(s(s(s(s(s(s(s(X16))))))))),s(s(s(s(s(s(s(s(s(X16))))))))))|~le(s(s(s(s(s(s(s(s(X16)))))))),s(s(s(s(s(s(s(s(X16)))))))))|~le(s(s(s(s(s(s(s(X16))))))),s(s(s(s(s(s(s(X16))))))))|~le(s(s(s(s(s(s(X16)))))),s(s(s(s(s(s(X16)))))))|~le(s(s(s(s(s(X16))))),s(s(s(s(s(X16))))))|~le(s(s(s(s(X16)))),s(s(s(s(X16)))))|~le(s(s(s(X16))),s(s(s(X16))))|~le(s(s(X16)),s(s(X16)))|~le(s(X16),s(X16))), inference(start_rule)). % 0.13/0.37 cnf(i_0_17, plain, (~le(s(s(s(s(s(s(s(s(s(s(s(X16))))))))))),s(s(s(s(s(s(s(s(s(s(s(X16))))))))))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_18, plain, (~le(s(s(s(s(s(s(s(s(s(s(X16)))))))))),s(s(s(s(s(s(s(s(s(s(X16)))))))))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_19, plain, (~le(s(s(s(s(s(s(s(s(s(X16))))))))),s(s(s(s(s(s(s(s(s(X16))))))))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_20, plain, (~le(s(s(s(s(s(s(s(s(X16)))))))),s(s(s(s(s(s(s(s(X16)))))))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_21, plain, (~le(s(s(s(s(s(s(s(X16))))))),s(s(s(s(s(s(s(X16))))))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_22, plain, (~le(s(s(s(s(s(s(X16)))))),s(s(s(s(s(s(X16)))))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_23, plain, (~le(s(s(s(s(s(X16))))),s(s(s(s(s(X16))))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_24, plain, (~le(s(s(s(s(X16)))),s(s(s(s(X16)))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_25, plain, (~le(s(s(s(X16))),s(s(s(X16))))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_26, plain, (~le(s(s(X16)),s(s(X16)))), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_27, plain, (~le(s(X16),s(X16))), inference(closure_rule, [i_0_6])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # NOT attempting initial tableau saturation % 0.13/0.37 # 5 start rule tableaux created. % 0.13/0.37 # 3 extension rule candidate clauses % 0.13/0.37 # 2 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------