%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT048-1 : TPTP v9.3.0. Released v2.4.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 : n027.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:09:50 AM UTC 2026 % Result : Unsatisfiable 0.11s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT048-1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.36 % Computer : n027.cluster.edu % 0.11/0.36 % Model : x86_64 x86_64 % 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.36 % Memory : 8046.5625MB % 0.11/0.36 % OS : Linux 6.8.0-71-generic % 0.11/0.36 % CPULimit : 300 % 0.11/0.36 % WCLimit : 300 % 0.11/0.36 % DateTime : Mon Sep 7 13:17:45 UTC 2026 % 0.11/0.36 % CPUTime : % 0.11/0.39 # No SInE strategy applied % 0.11/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.11/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.11/0.39 # % 0.11/0.39 # Presaturation interreduction done % 0.11/0.39 # Number of axioms: 19 Number of unprocessed: 19 % 0.11/0.39 # Tableaux proof search. % 0.11/0.39 # APR header successfully linked. % 0.11/0.39 # Hello from C++ % 0.11/0.40 # The folding up rule is enabled... % 0.11/0.40 # Local unification is enabled... % 0.11/0.40 # Any saturation attempts will use folding labels... % 0.11/0.40 # 19 beginning clauses after preprocessing and clausification % 0.11/0.40 # Creating start rules for all 3 conjectures. % 0.11/0.40 # There are 3 start rule candidates: % 0.11/0.40 # Found 5 unit axioms. % 0.11/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.11/0.40 # 3 start rule tableaux created. % 0.11/0.40 # 14 extension rule candidate clauses % 0.11/0.40 # 5 unit axiom clauses % 0.11/0.40 % 0.11/0.40 # Requested 8, 32 cores available to the main process. % 0.11/0.40 # There are not enough tableaux to fork, creating more from the initial 3 % 0.11/0.40 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.11/0.40 # We now have 12 tableaux to operate on % 0.11/0.40 # Creating equality axioms % 0.11/0.40 # Ran out of tableaux, making start rules for all clauses % 0.11/0.40 # There were 1 total branch saturation attempts. % 0.11/0.40 # There were 0 of these attempts blocked. % 0.11/0.40 # There were 0 deferred branch saturation attempts. % 0.11/0.40 # There were 0 free duplicated saturations. % 0.11/0.40 # There were 1 total successful branch saturations. % 0.11/0.40 # There were 0 successful branch saturations in interreduction. % 0.11/0.40 # There were 0 successful branch saturations on the branch. % 0.11/0.40 # There were 1 successful branch saturations after the branch. % 0.11/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # Begin clausification derivation % 0.11/0.40 % 0.11/0.40 # End clausification derivation % 0.11/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.40 cnf(i_0_36, negated_conjecture, (organization(sk1))). % 0.11/0.40 cnf(i_0_37, negated_conjecture, (greater(age(sk1,sk3),age(sk1,sk2)))). % 0.11/0.40 cnf(i_0_22, plain, (smaller_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_38, negated_conjecture, (~smaller(capability(sk1,sk3),capability(sk1,sk2)))). % 0.11/0.40 cnf(i_0_26, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.11/0.40 cnf(i_0_28, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_21, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.11/0.40 cnf(i_0_27, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.11/0.40 cnf(i_0_20, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_30, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.11/0.40 cnf(i_0_29, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.11/0.40 cnf(i_0_34, plain, (stock_of_knowledge(X1,X2)=stock_of_knowledge(X1,X3)|~organization(X1))). % 0.11/0.40 cnf(i_0_35, plain, (greater(internal_friction(X1,X2),internal_friction(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 0.11/0.40 cnf(i_0_32, plain, (smaller(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 0.11/0.40 cnf(i_0_31, plain, (greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 0.11/0.40 cnf(i_0_33, plain, (capability(X1,X2)=capability(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~organization(X1))). % 0.11/0.40 cnf(i_0_158, plain, (X4=X4)). % 0.11/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.40 # Begin printing tableau % 0.11/0.40 # Found 7 steps % 0.11/0.40 cnf(i_0_158, plain, (internal_friction(sk1,X9)=internal_friction(sk1,X9)), inference(start_rule)). % 0.11/0.40 cnf(i_0_214, plain, (internal_friction(sk1,X9)=internal_friction(sk1,X9)), inference(extension_rule, [i_0_33])). % 0.11/0.40 cnf(i_0_252, plain, (~organization(sk1)), inference(closure_rule, [i_0_36])). % 0.11/0.40 cnf(i_0_250, plain, (capability(sk1,X9)=capability(sk1,X9)), inference(extension_rule, [i_0_162])). % 0.11/0.40 cnf(i_0_695, plain, ($false), inference(closure_rule, [i_0_158])). % 0.11/0.40 cnf(i_0_696, plain, (~smaller_or_equal(capability(sk1,X9),capability(sk1,X9))), inference(closure_rule, [i_0_22])). % 0.11/0.40 cnf(i_0_693, plain, (smaller_or_equal(capability(sk1,X9),capability(sk1,X9))), inference(etableau_closure_rule, [i_0_693, ...])). % 0.11/0.40 # End printing tableau % 0.11/0.40 # SZS output end % 0.11/0.40 # Branches closed with saturation will be marked with an "s" % 0.11/0.40 # There were 1 total branch saturation attempts. % 0.11/0.40 # There were 0 of these attempts blocked. % 0.11/0.40 # There were 0 deferred branch saturation attempts. % 0.11/0.40 # There were 0 free duplicated saturations. % 0.11/0.40 # There were 1 total successful branch saturations. % 0.11/0.40 # There were 0 successful branch saturations in interreduction. % 0.11/0.40 # There were 0 successful branch saturations on the branch. % 0.11/0.40 # There were 1 successful branch saturations after the branch. % 0.11/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # Begin clausification derivation % 0.11/0.40 % 0.11/0.40 # End clausification derivation % 0.11/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.40 cnf(i_0_36, negated_conjecture, (organization(sk1))). % 0.11/0.40 cnf(i_0_37, negated_conjecture, (greater(age(sk1,sk3),age(sk1,sk2)))). % 0.11/0.40 cnf(i_0_22, plain, (smaller_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_38, negated_conjecture, (~smaller(capability(sk1,sk3),capability(sk1,sk2)))). % 0.11/0.40 cnf(i_0_26, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.11/0.40 cnf(i_0_28, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_21, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.11/0.40 cnf(i_0_27, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.11/0.40 cnf(i_0_20, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_30, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.11/0.40 cnf(i_0_29, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.11/0.40 cnf(i_0_34, plain, (stock_of_knowledge(X1,X2)=stock_of_knowledge(X1,X3)|~organization(X1))). % 0.11/0.40 cnf(i_0_35, plain, (greater(internal_friction(X1,X2),internal_friction(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 0.11/0.40 cnf(i_0_32, plain, (smaller(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 0.11/0.40 cnf(i_0_31, plain, (greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 0.11/0.40 cnf(i_0_33, plain, (capability(X1,X2)=capability(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~organization(X1))). % 0.11/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.40 # Begin printing tableau % 0.11/0.40 # Found 5 steps % 0.11/0.40 cnf(i_0_36, negated_conjecture, (organization(sk1)), inference(start_rule)). % 0.11/0.40 cnf(i_0_43, plain, (organization(sk1)), inference(extension_rule, [i_0_35])). % 0.11/0.40 cnf(i_0_206, plain, (~greater(age(sk1,sk3),age(sk1,sk2))), inference(closure_rule, [i_0_37])). % 0.11/0.40 cnf(i_0_204, plain, (greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))), inference(extension_rule, [i_0_28])). % 0.11/0.40 cnf(i_0_210, plain, (~greater(internal_friction(sk1,sk2),internal_friction(sk1,sk3))), inference(etableau_closure_rule, [i_0_210, ...])). % 0.11/0.40 # End printing tableau % 0.11/0.40 # SZS output end % 0.11/0.40 # Branches closed with saturation will be marked with an "s" % 0.11/0.40 # There were 1 total branch saturation attempts. % 0.11/0.40 # There were 0 of these attempts blocked. % 0.11/0.40 # There were 0 deferred branch saturation attempts. % 0.11/0.40 # There were 0 free duplicated saturations. % 0.11/0.40 # There were 1 total successful branch saturations. % 0.11/0.40 # There were 0 successful branch saturations in interreduction. % 0.11/0.40 # There were 0 successful branch saturations on the branch. % 0.11/0.40 # There were 1 successful branch saturations after the branch. % 0.11/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # Begin clausification derivation % 0.11/0.40 % 0.11/0.40 # End clausification derivation % 0.11/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.40 cnf(i_0_36, negated_conjecture, (organization(sk1))). % 0.11/0.40 cnf(i_0_37, negated_conjecture, (greater(age(sk1,sk3),age(sk1,sk2)))). % 0.11/0.40 cnf(i_0_22, plain, (smaller_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_38, negated_conjecture, (~smaller(capability(sk1,sk3),capability(sk1,sk2)))). % 0.11/0.40 cnf(i_0_26, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.11/0.40 cnf(i_0_28, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_21, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.11/0.40 cnf(i_0_27, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.11/0.40 cnf(i_0_20, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_30, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.11/0.40 cnf(i_0_29, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.11/0.40 cnf(i_0_34, plain, (stock_of_knowledge(X1,X2)=stock_of_knowledge(X1,X3)|~organization(X1))). % 0.11/0.40 cnf(i_0_35, plain, (greater(internal_friction(X1,X2),internal_friction(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 0.11/0.40 cnf(i_0_32, plain, (smaller(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 0.11/0.40 cnf(i_0_31, plain, (greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 0.11/0.40 cnf(i_0_33, plain, (capability(X1,X2)=capability(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~organization(X1))). % 0.11/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.40 # Begin printing tableau % 0.11/0.40 # Found 5 steps % 0.11/0.40 cnf(i_0_37, negated_conjecture, (greater(age(sk1,sk3),age(sk1,sk2))), inference(start_rule)). % 0.11/0.40 cnf(i_0_42, plain, (greater(age(sk1,sk3),age(sk1,sk2))), inference(extension_rule, [i_0_35])). % 0.11/0.40 cnf(i_0_107, plain, (~organization(sk1)), inference(closure_rule, [i_0_36])). % 0.11/0.40 cnf(i_0_106, plain, (greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))), inference(extension_rule, [i_0_28])). % 0.11/0.40 cnf(i_0_123, plain, (~greater(internal_friction(sk1,sk2),internal_friction(sk1,sk3))), inference(etableau_closure_rule, [i_0_123, ...])). % 0.11/0.40 # End printing tableau % 0.11/0.40 # SZS output end % 0.11/0.40 # Branches closed with saturation will be marked with an "s" % 0.11/0.40 # There were 1 total branch saturation attempts. % 0.11/0.40 # There were 0 of these attempts blocked. % 0.11/0.40 # There were 0 deferred branch saturation attempts. % 0.11/0.40 # There were 0 free duplicated saturations. % 0.11/0.40 # There were 1 total successful branch saturations. % 0.11/0.40 # There were 0 successful branch saturations in interreduction. % 0.11/0.40 # There were 0 successful branch saturations on the branch. % 0.11/0.40 # There were 1 successful branch saturations after the branch. % 0.11/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # Begin clausification derivation % 0.11/0.40 % 0.11/0.40 # End clausification derivation % 0.11/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.40 cnf(i_0_36, negated_conjecture, (organization(sk1))). % 0.11/0.40 cnf(i_0_37, negated_conjecture, (greater(age(sk1,sk3),age(sk1,sk2)))). % 0.11/0.40 cnf(i_0_22, plain, (smaller_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_38, negated_conjecture, (~smaller(capability(sk1,sk3),capability(sk1,sk2)))). % 0.11/0.40 cnf(i_0_26, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.11/0.40 cnf(i_0_28, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_21, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.11/0.40 cnf(i_0_27, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.11/0.40 cnf(i_0_20, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_30, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.11/0.40 cnf(i_0_29, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.11/0.40 cnf(i_0_34, plain, (stock_of_knowledge(X1,X2)=stock_of_knowledge(X1,X3)|~organization(X1))). % 0.11/0.40 cnf(i_0_35, plain, (greater(internal_friction(X1,X2),internal_friction(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 0.11/0.40 cnf(i_0_32, plain, (smaller(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 0.11/0.40 cnf(i_0_31, plain, (greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 0.11/0.40 cnf(i_0_33, plain, (capability(X1,X2)=capability(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~organization(X1))). % 0.11/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.40 # Begin printing tableau % 0.11/0.40 # Found 4 steps % 0.11/0.40 cnf(i_0_37, negated_conjecture, (greater(age(sk1,sk3),age(sk1,sk2))), inference(start_rule)). % 0.11/0.40 cnf(i_0_42, plain, (greater(age(sk1,sk3),age(sk1,sk2))), inference(extension_rule, [i_0_27])). % 0.11/0.40 cnf(i_0_88, plain, (smaller(age(sk1,sk2),age(sk1,sk3))), inference(extension_rule, [i_0_21])). % 0.11/0.40 cnf(i_0_124, plain, (smaller_or_equal(age(sk1,sk2),age(sk1,sk3))), inference(etableau_closure_rule, [i_0_124, ...])). % 0.11/0.40 # End printing tableau % 0.11/0.40 # SZS output end % 0.11/0.40 # Branches closed with saturation will be marked with an "s" % 0.11/0.40 # There were 1 total branch saturation attempts. % 0.11/0.40 # There were 0 of these attempts blocked. % 0.11/0.40 # There were 0 deferred branch saturation attempts. % 0.11/0.40 # There were 0 free duplicated saturations. % 0.11/0.40 # There were 1 total successful branch saturations. % 0.11/0.40 # There were 0 successful branch saturations in interreduction. % 0.11/0.40 # There were 0 successful branch saturations on the branch. % 0.11/0.40 # There were 1 successful branch saturations after the branch. % 0.11/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.40 # Begin clausification derivation % 0.11/0.40 % 0.11/0.40 # End clausification derivation % 0.11/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.40 cnf(i_0_36, negated_conjecture, (organization(sk1))). % 0.11/0.40 cnf(i_0_37, negated_conjecture, (greater(age(sk1,sk3),age(sk1,sk2)))). % 0.11/0.40 cnf(i_0_22, plain, (smaller_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.11/0.40 cnf(i_0_38, negated_conjecture, (~smaller(capability(sk1,sk3),capability(sk1,sk2)))). % 0.11/0.40 cnf(i_0_26, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.11/0.40 cnf(i_0_28, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_21, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.11/0.40 cnf(i_0_27, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.11/0.40 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.11/0.40 cnf(i_0_20, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.11/0.40 cnf(i_0_30, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.11/0.40 cnf(i_0_29, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.11/0.40 cnf(i_0_34, plain, (stock_of_knowledge(X1,X2)=stock_of_knowledge(X1,X3)|~organization(X1))). % 0.11/0.40 cnf(i_0_35, plain, (greater(internal_friction(X1,X2),internal_friction(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 0.11/0.40 cnf(i_0_32, plain, (smaller(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 0.11/0.40 cnf(i_0_31, plain, (greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 0.11/0.40 cnf(i_0_33, plain, (capability(X1,X2)=capability(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~organization(X1))). % 0.11/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.40 # Begin printing tableau % 0.11/0.40 # Found 6 steps % 0.11/0.40 cnf(i_0_37, negated_conjecture, (greater(age(sk1,sk3),age(sk1,sk2))), inference(start_rule)). % 0.11/0.40 cnf(i_0_42, plain, (greater(age(sk1,sk3),age(sk1,sk2))), inference(extension_rule, [i_0_29])). % 0.11/0.40 cnf(i_0_101, plain, (greater(age(sk1,sk3),age(sk1,sk3))), inference(extension_rule, [i_0_28])). % 0.11/0.40 cnf(i_0_123, plain, (~greater(age(sk1,sk3),age(sk1,sk3))), inference(closure_rule, [i_0_101])). % 0.11/0.40 cnf(i_0_102, plain, (~greater(age(sk1,sk2),age(sk1,sk3))), inference(extension_rule, [i_0_26])). % 0.11/0.40 cnf(i_0_125, plain, (~smaller(age(sk1,sk3),age(sk1,sk2))), inference(etableau_closure_rule, [i_0_125, ...])). % 0.11/0.40 # End printing tableau % 0.11/0.40 # SZS output end % 0.11/0.40 # Branches closed with saturation will be marked with an "s" % 0.11/0.40 # Child (3010227) has found a proof. % 0.11/0.40 % 0.11/0.41 # Proof search is over... % 0.11/0.41 # Freeing feature tree %------------------------------------------------------------------------------