%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MSC008-1.002 : TPTP v8.1.2. 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 : n003.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 : 300s % DateTime : Mon May 22 16:35:03 EDT 2023 % Result : Unsatisfiable 0.19s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : MSC008-1.002 : TPTP v8.1.2. Released v1.0.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n003.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Mon May 22 16:45:33 EDT 2023 % 0.12/0.34 % 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: 17 Number of unprocessed: 17 % 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.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 17 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 2 conjectures. % 0.12/0.37 # There are 2 start rule candidates: % 0.12/0.37 # Found 2 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 2 start rule tableaux created. % 0.12/0.37 # 15 extension rule candidate clauses % 0.12/0.37 # 2 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 11 tableaux to operate on % 0.19/0.38 # There were 4 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 4 total successful branch saturations. % 0.19/0.38 # There were 0 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 4 successful branch saturations after the branch. % 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_19, plain, (eq(X1,X1))). % 0.19/0.38 cnf(i_0_18, plain, (~eq(p_1,p_2))). % 0.19/0.38 cnf(i_0_20, plain, (eq(X1,X2)|~eq(X2,X1))). % 0.19/0.38 cnf(i_0_27, plain, (latin(X1,X2,p_2)|latin(X1,X2,p_1))). % 0.19/0.38 cnf(i_0_30, plain, (greek(X1,X2,p_2)|greek(X1,X2,p_1))). % 0.19/0.38 cnf(i_0_28, plain, (latin(X1,p_2,X2)|latin(X1,p_1,X2))). % 0.19/0.38 cnf(i_0_31, plain, (greek(X1,p_2,X2)|greek(X1,p_1,X2))). % 0.19/0.38 cnf(i_0_21, plain, (eq(X1,X2)|~latin(X3,X4,X2)|~latin(X3,X4,X1))). % 0.19/0.38 cnf(i_0_24, plain, (eq(X1,X2)|~greek(X3,X4,X2)|~greek(X3,X4,X1))). % 0.19/0.38 cnf(i_0_22, plain, (eq(X1,X2)|~latin(X3,X2,X4)|~latin(X3,X1,X4))). % 0.19/0.38 cnf(i_0_25, plain, (eq(X1,X2)|~greek(X3,X2,X4)|~greek(X3,X1,X4))). % 0.19/0.38 cnf(i_0_29, plain, (latin(p_2,X1,X2)|latin(p_1,X1,X2))). % 0.19/0.38 cnf(i_0_32, plain, (greek(p_2,X1,X2)|greek(p_1,X1,X2))). % 0.19/0.38 cnf(i_0_23, plain, (eq(X1,X2)|~latin(X2,X3,X4)|~latin(X1,X3,X4))). % 0.19/0.38 cnf(i_0_26, plain, (eq(X1,X2)|~greek(X2,X3,X4)|~greek(X1,X3,X4))). % 0.19/0.38 cnf(i_0_33, negated_conjecture, (eq(X1,X2)|~greek(X3,X2,X4)|~greek(X5,X1,X4)|~latin(X3,X2,X6)|~latin(X5,X1,X6))). % 0.19/0.38 cnf(i_0_34, negated_conjecture, (eq(X1,X2)|~greek(X2,X3,X4)|~greek(X1,X5,X4)|~latin(X2,X3,X6)|~latin(X1,X5,X6))). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 15 steps % 0.19/0.38 cnf(i_0_34, negated_conjecture, (eq(p_1,p_2)|~greek(p_2,p_2,p_2)|~greek(p_1,p_2,p_2)|~latin(p_2,p_2,p_2)|~latin(p_1,p_2,p_2)), inference(start_rule)). % 0.19/0.38 cnf(i_0_35, plain, (eq(p_1,p_2)), inference(closure_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_37, plain, (~greek(p_1,p_2,p_2)), inference(extension_rule, [i_0_31])). % 0.19/0.38 cnf(i_0_96, plain, (greek(p_1,p_1,p_2)), inference(extension_rule, [i_0_24])). % 0.19/0.38 cnf(i_0_142, plain, (eq(p_1,p_2)), inference(closure_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_144, plain, (~greek(p_1,p_1,p_1)), inference(extension_rule, [i_0_31])). % 0.19/0.38 cnf(i_0_36, plain, (~greek(p_2,p_2,p_2)), inference(extension_rule, [i_0_30])). % 0.19/0.38 cnf(i_0_160, plain, (greek(p_2,p_2,p_1)), inference(extension_rule, [i_0_25])). % 0.19/0.38 cnf(i_0_173, plain, (eq(p_1,p_2)), inference(closure_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_175, plain, (~greek(p_2,p_1,p_1)), inference(extension_rule, [i_0_32])). % 0.19/0.38 cnf(i_0_38, plain, (~latin(p_2,p_2,p_2)), inference(extension_rule, [i_0_27])). % 0.19/0.38 cnf(i_0_39, plain, (~latin(p_1,p_2,p_2)), inference(etableau_closure_rule, [i_0_39, ...])). % 0.19/0.38 cnf(i_0_153, plain, (greek(p_1,p_2,p_1)), inference(etableau_closure_rule, [i_0_153, ...])). % 0.19/0.38 cnf(i_0_191, plain, (greek(p_1,p_1,p_1)), inference(etableau_closure_rule, [i_0_191, ...])). % 0.19/0.38 cnf(i_0_195, plain, (latin(p_2,p_2,p_1)), inference(etableau_closure_rule, [i_0_195, ...])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.39 # Child (13739) has found a proof. % 0.19/0.39 % 0.19/0.39 # Proof search is over... % 0.19/0.39 # Freeing feature tree %------------------------------------------------------------------------------