%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN730+1 : TPTP v8.1.0. Released v2.5.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 : n004.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 06:13:39 EDT 2022 % Result : Theorem 0.13s 0.34s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SYN730+1 : TPTP v8.1.0. Released v2.5.0. % 0.11/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.32 % Computer : n004.cluster.edu % 0.13/0.32 % Model : x86_64 x86_64 % 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.32 % Memory : 8042.1875MB % 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jul 11 17:23:07 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.34 # No SInE strategy applied % 0.13/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN % 0.13/0.34 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.34 # % 0.13/0.34 # Presaturation interreduction done % 0.13/0.34 # Number of axioms: 2 Number of unprocessed: 2 % 0.13/0.34 # Tableaux proof search. % 0.13/0.34 # APR header successfully linked. % 0.13/0.34 # Hello from C++ % 0.13/0.34 # The folding up rule is enabled... % 0.13/0.34 # Local unification is enabled... % 0.13/0.34 # Any saturation attempts will use folding labels... % 0.13/0.34 # 2 beginning clauses after preprocessing and clausification % 0.13/0.34 # Creating start rules for all 2 conjectures. % 0.13/0.34 # There are 2 start rule candidates: % 0.13/0.34 # Found 2 unit axioms. % 0.13/0.34 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.13/0.34 # Found closed tableau while making start rule % 0.13/0.34 # There were 0 total branch saturation attempts. % 0.13/0.34 # There were 0 of these attempts blocked. % 0.13/0.34 # There were 0 deferred branch saturation attempts. % 0.13/0.34 # There were 0 free duplicated saturations. % 0.13/0.34 # There were 0 total successful branch saturations. % 0.13/0.34 # There were 0 successful branch saturations in interreduction. % 0.13/0.34 # There were 0 successful branch saturations on the branch. % 0.13/0.34 # There were 0 successful branch saturations after the branch. % 0.13/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.34 # Begin clausification derivation % 0.13/0.34 % 0.13/0.34 # End clausification derivation % 0.13/0.34 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.34 cnf(i_0_2, negated_conjecture, (p(a,esk1_1(X1),h(esk1_1(X1))))). % 0.13/0.34 cnf(i_0_1, negated_conjecture, (~p(X1,esk1_1(X1),X2))). % 0.13/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.34 # Begin printing tableau % 0.13/0.34 # Found 2 steps % 0.13/0.34 cnf(i_0_1, negated_conjecture, (~p(a,esk1_1(a),h(esk1_1(a)))), inference(start_rule)). % 0.13/0.34 cnf(i_0_3, plain, (~p(a,esk1_1(a),h(esk1_1(a)))), inference(closure_rule, [i_0_2])). % 0.13/0.34 # End printing tableau % 0.13/0.34 # SZS output end % 0.13/0.34 # Branches closed with saturation will be marked with an "s" % 0.13/0.34 # NOT attempting initial tableau saturation % 0.13/0.34 # 1 start rule tableaux created. % 0.13/0.34 # 0 extension rule candidate clauses % 0.13/0.34 # 2 unit axiom clauses % 0.13/0.34 % 0.13/0.34 # Proof search is over... % 0.13/0.34 # Freeing feature tree %------------------------------------------------------------------------------