%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN009-4 : 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 : n005.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:11 EDT 2022 % Result : Unsatisfiable 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 : SYN009-4 : TPTP v8.1.0. Released v2.5.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 : n005.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 : Tue Jul 12 08:45:21 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: 9 Number of unprocessed: 9 % 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 # 9 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 9 conjectures. % 0.12/0.36 # There are 9 start rule candidates: % 0.12/0.36 # Found 4 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 9 start rule tableaux created. % 0.12/0.36 # 5 extension rule candidate clauses % 0.12/0.36 # 4 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # Closed tableau found in foldup close cycle with 2 folds and 4 closures done. % 0.12/0.36 # There were 0 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 Unsatisfiable 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_13, negated_conjecture, (s(a))). % 0.12/0.36 cnf(i_0_14, negated_conjecture, (s(b))). % 0.12/0.36 cnf(i_0_15, negated_conjecture, (s(c))). % 0.12/0.36 cnf(i_0_16, negated_conjecture, (~n(c,c,c))). % 0.12/0.36 cnf(i_0_10, negated_conjecture, (~m(X1,X2,X3)|~p(X1,X2,X3))). % 0.12/0.36 cnf(i_0_18, negated_conjecture, (n(X1,X2,X3)|m(X1,X2,X3)|~s(X3)|~s(X2)|~s(X1))). % 0.12/0.36 cnf(i_0_17, negated_conjecture, (r(X1,X2,X3)|q(X1,X2,X3)|p(X1,X2,X3)|~s(X3)|~s(X2)|~s(X1))). % 0.12/0.36 cnf(i_0_11, negated_conjecture, (~q(X1,X2,X3)|~m(X1,X2,X3))). % 0.12/0.36 cnf(i_0_12, negated_conjecture, (~r(X1,X2,X3)|~m(X1,X2,X3))). % 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 22 steps % 0.12/0.36 cnf(i_0_17, negated_conjecture, (r(c,c,c)|q(c,c,c)|p(c,c,c)|~s(c)|~s(c)|~s(c)), inference(start_rule)). % 0.12/0.36 cnf(i_0_26, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_27, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_28, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_23, plain, (r(c,c,c)), inference(extension_rule, [i_0_12])). % 0.12/0.36 cnf(i_0_41, plain, (~m(c,c,c)), inference(extension_rule, [i_0_18])). % 0.12/0.36 cnf(i_0_50, plain, (n(c,c,c)), inference(closure_rule, [i_0_16])). % 0.12/0.36 cnf(i_0_52, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_53, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_54, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_24, plain, (q(c,c,c)), inference(extension_rule, [i_0_11])). % 0.12/0.36 cnf(i_0_56, plain, (~m(c,c,c)), inference(extension_rule, [i_0_18])). % 0.12/0.36 cnf(i_0_67, plain, (n(c,c,c)), inference(closure_rule, [i_0_16])). % 0.12/0.36 cnf(i_0_69, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_70, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_71, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_25, plain, (p(c,c,c)), inference(extension_rule, [i_0_10])). % 0.12/0.36 cnf(i_0_78, plain, (~m(c,c,c)), inference(extension_rule, [i_0_18])). % 0.12/0.36 cnf(i_0_90, plain, (n(c,c,c)), inference(closure_rule, [i_0_16])). % 0.12/0.36 cnf(i_0_92, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_93, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_94, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 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 # Closed tableau found in foldup close cycle with 1 folds and 1 closures done. % 0.12/0.36 # There were 0 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 Unsatisfiable 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_13, negated_conjecture, (s(a))). % 0.12/0.36 cnf(i_0_14, negated_conjecture, (s(b))). % 0.12/0.36 cnf(i_0_15, negated_conjecture, (s(c))). % 0.12/0.36 cnf(i_0_16, negated_conjecture, (~n(c,c,c))). % 0.12/0.36 cnf(i_0_10, negated_conjecture, (~m(X1,X2,X3)|~p(X1,X2,X3))). % 0.12/0.36 cnf(i_0_18, negated_conjecture, (n(X1,X2,X3)|m(X1,X2,X3)|~s(X3)|~s(X2)|~s(X1))). % 0.12/0.36 cnf(i_0_17, negated_conjecture, (r(X1,X2,X3)|q(X1,X2,X3)|p(X1,X2,X3)|~s(X3)|~s(X2)|~s(X1))). % 0.12/0.36 cnf(i_0_11, negated_conjecture, (~q(X1,X2,X3)|~m(X1,X2,X3))). % 0.12/0.36 cnf(i_0_12, negated_conjecture, (~r(X1,X2,X3)|~m(X1,X2,X3))). % 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 14 steps % 0.12/0.36 cnf(i_0_10, negated_conjecture, (~m(c,c,c)|~p(c,c,c)), inference(start_rule)). % 0.12/0.36 cnf(i_0_34, plain, (~m(c,c,c)), inference(extension_rule, [i_0_18])). % 0.12/0.36 cnf(i_0_50, plain, (n(c,c,c)), inference(closure_rule, [i_0_16])). % 0.12/0.36 cnf(i_0_52, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_53, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_54, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_35, plain, (~p(c,c,c)), inference(extension_rule, [i_0_17])). % 0.12/0.36 cnf(i_0_62, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_63, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_64, plain, (~s(c)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_59, plain, (r(c,c,c)), inference(extension_rule, [i_0_12])). % 0.12/0.36 cnf(i_0_66, plain, (~m(c,c,c)), inference(closure_rule, [i_0_34])). % 0.12/0.36 cnf(i_0_60, plain, (q(c,c,c)), inference(extension_rule, [i_0_11])). % 0.12/0.36 cnf(i_0_68, plain, (~m(c,c,c)), inference(closure_rule, [i_0_34])). % 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 (26410) has found a proof. % 0.12/0.36 % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------