%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN056-1 : TPTP v8.1.0. Released v1.0.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 : n007.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:07:39 EDT 2022 % Result : Satisfiable 0.12s 0.36s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SYN056-1 : TPTP v8.1.0. Released v1.0.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.12/0.33 % Computer : n007.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 19:57:18 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 13 Number of unprocessed: 13 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 13 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 8 conjectures. % 0.12/0.36 # There are 8 start rule candidates: % 0.12/0.36 # Found 0 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 8 start rule tableaux created. % 0.12/0.36 # 13 extension rule candidate clauses % 0.12/0.36 # 0 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # 28721 Satisfiable branch % 0.12/0.36 # Satisfiable branch found. % 0.12/0.36 # There were 1 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 0 total successful branch saturations. % 0.12/0.36 # There were 0 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 0 successful branch saturations after the branch. % 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_23, negated_conjecture, (big_q(d)|big_p(c))). % 0.12/0.36 cnf(i_0_26, negated_conjecture, (~big_s(d)|~big_r(c))). % 0.12/0.36 cnf(i_0_25, negated_conjecture, (big_p(c)|~big_s(d))). % 0.12/0.36 cnf(i_0_24, negated_conjecture, (big_q(d)|~big_r(c))). % 0.12/0.36 cnf(i_0_15, plain, (big_p(b)|~big_q(X1))). % 0.12/0.36 cnf(i_0_14, plain, (big_q(a)|~big_p(X1))). % 0.12/0.36 cnf(i_0_19, negated_conjecture, (big_r(X1)|big_p(c)|~big_p(X1))). % 0.12/0.36 cnf(i_0_20, negated_conjecture, (big_r(X1)|~big_r(c)|~big_p(X1))). % 0.12/0.36 cnf(i_0_22, negated_conjecture, (big_s(X1)|~big_s(d)|~big_q(X1))). % 0.12/0.36 cnf(i_0_21, negated_conjecture, (big_s(X1)|big_q(d)|~big_q(X1))). % 0.12/0.36 cnf(i_0_17, plain, (big_r(X1)|~big_s(X2)|~big_q(X2)|~big_p(X1))). % 0.12/0.36 cnf(i_0_18, plain, (big_r(X1)|~big_q(X1)|~big_p(X1))). % 0.12/0.36 cnf(i_0_16, plain, (big_s(X1)|~big_r(X2)|~big_q(X1)|~big_p(X2))). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 3 steps % 0.12/0.36 cnf(i_0_19, negated_conjecture, (big_r(c)|big_p(c)|~big_p(c)), inference(start_rule)). % 0.12/0.36 cnf(i_0_36, plain, (big_r(c)), inference(extension_rule, [i_0_20])). % 0.12/0.36 cnf(i_0_68, plain, (big_r(c)), inference(extension_rule, [i_0_24])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # Child (28721) has found a proof. % 0.12/0.36 % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------