%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MSC008-2.002 : 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 : n020.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:15 EDT 2022 % Result : Unsatisfiable 0.19s 0.41s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : MSC008-2.002 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.13 % 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 : n020.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 1 16:11:00 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 16 Number of unprocessed: 16 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # 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 # 16 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 2 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 14 extension rule candidate clauses % 0.13/0.37 # 2 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 8 tableaux to operate on % 0.19/0.41 # There were 6 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 6 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 6 successful branch saturations after the branch. % 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_18, plain, (eq(X1,X1))). % 0.19/0.41 cnf(i_0_17, plain, (~eq(p1,p2))). % 0.19/0.41 cnf(i_0_19, plain, (eq(X1,X2)|~eq(X2,X1))). % 0.19/0.41 cnf(i_0_26, plain, (latin(X1,X2,p2)|latin(X1,X2,p1))). % 0.19/0.41 cnf(i_0_29, plain, (greek(X1,X2,p2)|greek(X1,X2,p1))). % 0.19/0.41 cnf(i_0_27, plain, (latin(X1,p2,X2)|latin(X1,p1,X2))). % 0.19/0.41 cnf(i_0_30, plain, (greek(X1,p2,X2)|greek(X1,p1,X2))). % 0.19/0.41 cnf(i_0_20, plain, (eq(X1,X2)|~latin(X3,X4,X1)|~latin(X3,X4,X2))). % 0.19/0.41 cnf(i_0_23, plain, (eq(X1,X2)|~greek(X3,X4,X1)|~greek(X3,X4,X2))). % 0.19/0.41 cnf(i_0_21, plain, (eq(X1,X2)|~latin(X3,X1,X4)|~latin(X3,X2,X4))). % 0.19/0.41 cnf(i_0_24, plain, (eq(X1,X2)|~greek(X3,X1,X4)|~greek(X3,X2,X4))). % 0.19/0.41 cnf(i_0_28, plain, (latin(p2,X1,X2)|latin(p1,X1,X2))). % 0.19/0.41 cnf(i_0_31, plain, (greek(p2,X1,X2)|greek(p1,X1,X2))). % 0.19/0.41 cnf(i_0_22, plain, (eq(X1,X2)|~latin(X1,X3,X4)|~latin(X2,X3,X4))). % 0.19/0.41 cnf(i_0_25, plain, (eq(X1,X2)|~greek(X1,X3,X4)|~greek(X2,X3,X4))). % 0.19/0.41 cnf(i_0_32, negated_conjecture, (eq(X1,X2)|eq(X3,X4)|~greek(X1,X3,X5)|~greek(X2,X4,X5)|~latin(X1,X3,X6)|~latin(X2,X4,X6))). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 24 steps % 0.19/0.41 cnf(i_0_32, negated_conjecture, (eq(p1,p2)|eq(p1,p2)|~greek(p1,p1,p2)|~greek(p2,p2,p2)|~latin(p1,p1,p1)|~latin(p2,p2,p1)), inference(start_rule)). % 0.19/0.41 cnf(i_0_33, plain, (eq(p1,p2)), inference(closure_rule, [i_0_17])). % 0.19/0.41 cnf(i_0_34, plain, (eq(p1,p2)), inference(closure_rule, [i_0_17])). % 0.19/0.41 cnf(i_0_36, plain, (~greek(p2,p2,p2)), inference(extension_rule, [i_0_29])). % 0.19/0.41 cnf(i_0_82, plain, (greek(p2,p2,p1)), inference(extension_rule, [i_0_32])). % 0.19/0.41 cnf(i_0_427, plain, (eq(p2,p1)), inference(extension_rule, [i_0_19])). % 0.19/0.41 cnf(i_0_471, plain, (eq(p1,p2)), inference(closure_rule, [i_0_17])). % 0.19/0.41 cnf(i_0_428, plain, (eq(p2,p1)), inference(closure_rule, [i_0_427])). % 0.19/0.41 cnf(i_0_431, plain, (~latin(p2,p2,p2)), inference(extension_rule, [i_0_26])). % 0.19/0.41 cnf(i_0_432, plain, (~latin(p1,p1,p2)), inference(extension_rule, [i_0_27])). % 0.19/0.41 cnf(i_0_430, plain, (~greek(p1,p1,p1)), inference(extension_rule, [i_0_29])). % 0.19/0.41 cnf(i_0_35, plain, (~greek(p1,p1,p2)), inference(extension_rule, [i_0_30])). % 0.19/0.41 cnf(i_0_481, plain, (greek(p1,p2,p2)), inference(extension_rule, [i_0_25])). % 0.19/0.41 cnf(i_0_680, plain, (eq(p1,p2)), inference(closure_rule, [i_0_17])). % 0.19/0.41 cnf(i_0_682, plain, (~greek(p2,p2,p2)), inference(extension_rule, [i_0_29])). % 0.19/0.41 cnf(i_0_37, plain, (~latin(p1,p1,p1)), inference(extension_rule, [i_0_28])). % 0.19/0.41 cnf(i_0_716, plain, (latin(p2,p1,p1)), inference(extension_rule, [i_0_20])). % 0.19/0.41 cnf(i_0_718, plain, (eq(p1,p2)), inference(closure_rule, [i_0_17])). % 0.19/0.41 cnf(i_0_38, plain, (~latin(p2,p2,p1)), inference(etableau_closure_rule, [i_0_38, ...])). % 0.19/0.41 cnf(i_0_474, plain, (latin(p2,p2,p1)), inference(etableau_closure_rule, [i_0_474, ...])). % 0.19/0.41 cnf(i_0_477, plain, (latin(p1,p2,p2)), inference(etableau_closure_rule, [i_0_477, ...])). % 0.19/0.41 cnf(i_0_479, plain, (greek(p1,p1,p2)), inference(etableau_closure_rule, [i_0_479, ...])). % 0.19/0.41 cnf(i_0_709, plain, (greek(p2,p2,p1)), inference(etableau_closure_rule, [i_0_709, ...])). % 0.19/0.41 cnf(i_0_720, plain, (~latin(p2,p1,p2)), inference(etableau_closure_rule, [i_0_720, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # Child (11777) has found a proof. % 0.19/0.41 % 0.19/0.41 # Proof search is over... % 0.19/0.41 # Freeing feature tree %------------------------------------------------------------------------------