%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MSC014+1 : TPTP v8.1.0. Released v3.2.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 : Sun Jul 17 22:43:17 EDT 2022 % Result : Satisfiable 0.19s 0.37s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : MSC014+1 : TPTP v8.1.0. Released v3.2.0. % 0.12/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.33 % Computer : n017.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % 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 : Fri Jul 1 15:50:39 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 9 Number of unprocessed: 9 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 9 beginning clauses after preprocessing and clausification % 0.19/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.19/0.36 # No conjectures. % 0.19/0.36 # There are 9 start rule candidates: % 0.19/0.36 # Found 4 unit axioms. % 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.36 # 9 start rule tableaux created. % 0.19/0.36 # 5 extension rule candidate clauses % 0.19/0.36 # 4 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # 8847 Satisfiable branch % 0.19/0.37 # 8848 Satisfiable branch % 0.19/0.37 # Satisfiable branch found. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 0 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 0 successful branch saturations after the branch. % 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_2, plain, (equalish(n0,n0))). % 0.19/0.37 cnf(i_0_1, plain, (equalish(n1,n1))). % 0.19/0.37 cnf(i_0_4, plain, (~equalish(n0,n1))). % 0.19/0.37 cnf(i_0_3, plain, (~equalish(n1,n0))). % 0.19/0.37 cnf(i_0_6, plain, (equalish(X1,X2)|~f(X3,X4,X5,X2,X6)|~f(X7,X8,X9,X1,X6))). % 0.19/0.37 cnf(i_0_5, plain, (f(X1,X2,X3,X4,esk1_4(X1,X2,X3,X4))|~equalish(X4,X4)|~equalish(X3,X3)|~equalish(X2,X2)|~equalish(X1,X1))). % 0.19/0.37 cnf(i_0_7, plain, (equalish(X1,X2)|~f(X3,X4,X2,X5,X6)|~f(X7,X8,X1,X9,X6))). % 0.19/0.37 cnf(i_0_8, plain, (equalish(X1,X2)|~f(X3,X2,X4,X5,X6)|~f(X7,X1,X8,X9,X6))). % 0.19/0.37 cnf(i_0_9, plain, (equalish(X1,X2)|~f(X2,X3,X4,X5,X6)|~f(X1,X7,X8,X9,X6))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 7 steps % 0.19/0.37 cnf(i_0_2, plain, (equalish(n0,n0)), inference(start_rule)). % 0.19/0.37 cnf(i_0_10, plain, (equalish(n0,n0)), inference(extension_rule, [i_0_5])). % 0.19/0.37 cnf(i_0_36, plain, (~equalish(n0,n0)), inference(closure_rule, [i_0_2])). % 0.19/0.37 cnf(i_0_37, plain, (~equalish(n0,n0)), inference(closure_rule, [i_0_2])). % 0.19/0.37 cnf(i_0_38, plain, (~equalish(n0,n0)), inference(closure_rule, [i_0_2])). % 0.19/0.37 cnf(i_0_34, plain, (f(n0,n0,n0,n0,esk1_4(n0,n0,n0,n0))), inference(extension_rule, [i_0_6])). % 0.19/0.37 cnf(i_0_39, plain, (equalish(n1,n0)), inference(closure_rule, [i_0_3])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Satisfiable branch found. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 0 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 0 successful branch saturations after the branch. % 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_2, plain, (equalish(n0,n0))). % 0.19/0.37 cnf(i_0_1, plain, (equalish(n1,n1))). % 0.19/0.37 cnf(i_0_4, plain, (~equalish(n0,n1))). % 0.19/0.37 cnf(i_0_3, plain, (~equalish(n1,n0))). % 0.19/0.37 cnf(i_0_6, plain, (equalish(X1,X2)|~f(X3,X4,X5,X2,X6)|~f(X7,X8,X9,X1,X6))). % 0.19/0.37 cnf(i_0_5, plain, (f(X1,X2,X3,X4,esk1_4(X1,X2,X3,X4))|~equalish(X4,X4)|~equalish(X3,X3)|~equalish(X2,X2)|~equalish(X1,X1))). % 0.19/0.37 cnf(i_0_7, plain, (equalish(X1,X2)|~f(X3,X4,X2,X5,X6)|~f(X7,X8,X1,X9,X6))). % 0.19/0.37 cnf(i_0_8, plain, (equalish(X1,X2)|~f(X3,X2,X4,X5,X6)|~f(X7,X1,X8,X9,X6))). % 0.19/0.37 cnf(i_0_9, plain, (equalish(X1,X2)|~f(X2,X3,X4,X5,X6)|~f(X1,X7,X8,X9,X6))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 7 steps % 0.19/0.37 cnf(i_0_1, plain, (equalish(n1,n1)), inference(start_rule)). % 0.19/0.37 cnf(i_0_11, plain, (equalish(n1,n1)), inference(extension_rule, [i_0_5])). % 0.19/0.37 cnf(i_0_36, plain, (~equalish(n0,n0)), inference(closure_rule, [i_0_2])). % 0.19/0.37 cnf(i_0_37, plain, (~equalish(n0,n0)), inference(closure_rule, [i_0_2])). % 0.19/0.37 cnf(i_0_38, plain, (~equalish(n0,n0)), inference(closure_rule, [i_0_2])). % 0.19/0.37 cnf(i_0_34, plain, (f(n0,n0,n0,n1,esk1_4(n0,n0,n0,n1))), inference(extension_rule, [i_0_6])). % 0.19/0.37 cnf(i_0_39, plain, (equalish(n0,n1)), inference(closure_rule, [i_0_4])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Child (8847) has found a proof. % 0.19/0.37 % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------