TSTP Solution File: NLP025-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP025-1 : TPTP v8.1.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 : n013.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 : Mon Jul 18 02:11:45 EDT 2022
% Result : Satisfiable 2.04s 0.66s
% Output : CNFRefutation 2.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NLP025-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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 : n013.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 : Fri Jul 1 08:53:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.38 # No SInE strategy applied
% 0.12/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.38 #
% 0.12/0.38 # Presaturation interreduction done
% 0.12/0.38 # Number of axioms: 98 Number of unprocessed: 98
% 0.12/0.38 # Tableaux proof search.
% 0.12/0.38 # APR header successfully linked.
% 0.12/0.38 # Hello from C++
% 0.12/0.38 # The folding up rule is enabled...
% 0.12/0.38 # Local unification is enabled...
% 0.12/0.38 # Any saturation attempts will use folding labels...
% 0.12/0.38 # 98 beginning clauses after preprocessing and clausification
% 0.12/0.38 # Creating start rules for all 25 conjectures.
% 0.12/0.38 # There are 25 start rule candidates:
% 0.12/0.38 # Found 15 unit axioms.
% 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38 # 25 start rule tableaux created.
% 0.12/0.38 # 83 extension rule candidate clauses
% 0.12/0.38 # 15 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 2.04/0.66 # 28934 Satisfiable branch
% 2.04/0.66 # Satisfiable branch found.
% 2.04/0.66 # There were 1 total branch saturation attempts.
% 2.04/0.66 # There were 0 of these attempts blocked.
% 2.04/0.66 # There were 0 deferred branch saturation attempts.
% 2.04/0.66 # There were 0 free duplicated saturations.
% 2.04/0.66 # There were 0 total successful branch saturations.
% 2.04/0.66 # There were 0 successful branch saturations in interreduction.
% 2.04/0.66 # There were 0 successful branch saturations on the branch.
% 2.04/0.66 # There were 0 successful branch saturations after the branch.
% 2.04/0.66 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/0.66 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/0.66 # Begin clausification derivation
% 2.04/0.66
% 2.04/0.66 # End clausification derivation
% 2.04/0.66 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.04/0.66 cnf(i_0_172, negated_conjecture, (actual_world(skc6))).
% 2.04/0.66 cnf(i_0_176, negated_conjecture, (dance(skc8,skc11))).
% 2.04/0.66 cnf(i_0_173, negated_conjecture, (event(skc8,skc11))).
% 2.04/0.66 cnf(i_0_181, negated_conjecture, (desire_want(skc6,skc7))).
% 2.04/0.66 cnf(i_0_179, negated_conjecture, (proposition(skc6,skc8))).
% 2.04/0.66 cnf(i_0_177, negated_conjecture, (forename(skc6,skc9))).
% 2.04/0.66 cnf(i_0_178, negated_conjecture, (mia_forename(skc6,skc9))).
% 2.04/0.66 cnf(i_0_174, negated_conjecture, (woman(skc6,skc10))).
% 2.04/0.66 cnf(i_0_180, negated_conjecture, (accessible_world(skc6,skc8))).
% 2.04/0.66 cnf(i_0_182, negated_conjecture, (present(skc6,skc7))).
% 2.04/0.66 cnf(i_0_175, negated_conjecture, (present(skc8,skc11))).
% 2.04/0.66 cnf(i_0_184, negated_conjecture, (agent(skc6,skc7,skc10))).
% 2.04/0.66 cnf(i_0_185, negated_conjecture, (agent(skc8,skc11,skc10))).
% 2.04/0.66 cnf(i_0_186, negated_conjecture, (theme(skc6,skc7,skc8))).
% 2.04/0.66 cnf(i_0_183, negated_conjecture, (of(skc6,skc9,skc10))).
% 2.04/0.66 cnf(i_0_132, plain, (~general(X1,X2)|~specific(X1,X2))).
% 2.04/0.66 cnf(i_0_135, plain, (~existent(X1,X2)|~nonexistent(X1,X2))).
% 2.04/0.66 cnf(i_0_131, plain, (~female(X1,X2)|~unisex(X1,X2))).
% 2.04/0.66 cnf(i_0_130, plain, (~male(X1,X2)|~unisex(X1,X2))).
% 2.04/0.66 cnf(i_0_99, plain, (event(X1,X2)|~dance(X1,X2))).
% 2.04/0.66 cnf(i_0_133, plain, (~human(X1,X2)|~nonhuman(X1,X2))).
% 2.04/0.66 cnf(i_0_134, plain, (~male(X1,X2)|~female(X1,X2))).
% 2.04/0.66 cnf(i_0_106, plain, (event(X1,X2)|~desire_want(X1,X2))).
% 2.04/0.66 cnf(i_0_114, plain, (relation(X1,X2)|~relname(X1,X2))).
% 2.04/0.66 cnf(i_0_115, plain, (forename(X1,X2)|~mia_forename(X1,X2))).
% 2.04/0.66 cnf(i_0_127, plain, (forename(X1,X2)|~vincent_forename(X1,X2))).
% 2.04/0.66 cnf(i_0_100, plain, (eventuality(X1,X2)|~event(X1,X2))).
% 2.04/0.66 cnf(i_0_101, plain, (thing(X1,X2)|~eventuality(X1,X2))).
% 2.04/0.66 cnf(i_0_107, plain, (relation(X1,X2)|~proposition(X1,X2))).
% 2.04/0.66 cnf(i_0_108, plain, (abstraction(X1,X2)|~relation(X1,X2))).
% 2.04/0.66 cnf(i_0_118, plain, (entity(X1,X2)|~organism(X1,X2))).
% 2.04/0.66 cnf(i_0_109, plain, (thing(X1,X2)|~abstraction(X1,X2))).
% 2.04/0.66 cnf(i_0_119, plain, (thing(X1,X2)|~entity(X1,X2))).
% 2.04/0.66 cnf(i_0_113, plain, (relname(X1,X2)|~forename(X1,X2))).
% 2.04/0.66 cnf(i_0_116, plain, (human_person(X1,X2)|~woman(X1,X2))).
% 2.04/0.66 cnf(i_0_128, plain, (human_person(X1,X2)|~man(X1,X2))).
% 2.04/0.66 cnf(i_0_126, plain, (female(X1,X2)|~woman(X1,X2))).
% 2.04/0.66 cnf(i_0_129, plain, (male(X1,X2)|~man(X1,X2))).
% 2.04/0.66 cnf(i_0_102, plain, (singleton(X1,X2)|~thing(X1,X2))).
% 2.04/0.66 cnf(i_0_103, plain, (specific(X1,X2)|~eventuality(X1,X2))).
% 2.04/0.66 cnf(i_0_120, plain, (specific(X1,X2)|~entity(X1,X2))).
% 2.04/0.66 cnf(i_0_104, plain, (nonexistent(X1,X2)|~eventuality(X1,X2))).
% 2.04/0.66 cnf(i_0_105, plain, (unisex(X1,X2)|~eventuality(X1,X2))).
% 2.04/0.66 cnf(i_0_112, plain, (unisex(X1,X2)|~abstraction(X1,X2))).
% 2.04/0.66 cnf(i_0_110, plain, (nonhuman(X1,X2)|~abstraction(X1,X2))).
% 2.04/0.66 cnf(i_0_111, plain, (general(X1,X2)|~abstraction(X1,X2))).
% 2.04/0.66 cnf(i_0_117, plain, (organism(X1,X2)|~human_person(X1,X2))).
% 2.04/0.66 cnf(i_0_121, plain, (existent(X1,X2)|~entity(X1,X2))).
% 2.04/0.66 cnf(i_0_122, plain, (impartial(X1,X2)|~organism(X1,X2))).
% 2.04/0.66 cnf(i_0_123, plain, (living(X1,X2)|~organism(X1,X2))).
% 2.04/0.66 cnf(i_0_124, plain, (human(X1,X2)|~human_person(X1,X2))).
% 2.04/0.66 cnf(i_0_125, plain, (animate(X1,X2)|~human_person(X1,X2))).
% 2.04/0.66 cnf(i_0_136, plain, (dance(X1,X2)|~accessible_world(X3,X1)|~dance(X3,X2))).
% 2.04/0.66 cnf(i_0_137, plain, (event(X1,X2)|~accessible_world(X3,X1)|~event(X3,X2))).
% 2.04/0.66 cnf(i_0_138, plain, (eventuality(X1,X2)|~accessible_world(X3,X1)|~eventuality(X3,X2))).
% 2.04/0.66 cnf(i_0_145, plain, (desire_want(X1,X2)|~accessible_world(X3,X1)|~desire_want(X3,X2))).
% 2.04/0.66 cnf(i_0_146, plain, (proposition(X1,X2)|~accessible_world(X3,X1)|~proposition(X3,X2))).
% 2.04/0.66 cnf(i_0_151, plain, (forename(X1,X2)|~accessible_world(X3,X1)|~forename(X3,X2))).
% 2.04/0.66 cnf(i_0_153, plain, (mia_forename(X1,X2)|~accessible_world(X3,X1)|~mia_forename(X3,X2))).
% 2.04/0.66 cnf(i_0_154, plain, (woman(X1,X2)|~accessible_world(X3,X1)|~woman(X3,X2))).
% 2.04/0.66 cnf(i_0_139, plain, (thing(X1,X2)|~accessible_world(X3,X1)|~thing(X3,X2))).
% 2.04/0.66 cnf(i_0_164, plain, (vincent_forename(X1,X2)|~accessible_world(X3,X1)|~vincent_forename(X3,X2))).
% 2.04/0.66 cnf(i_0_140, plain, (singleton(X1,X2)|~accessible_world(X3,X1)|~singleton(X3,X2))).
% 2.04/0.66 cnf(i_0_141, plain, (specific(X1,X2)|~accessible_world(X3,X1)|~specific(X3,X2))).
% 2.04/0.66 cnf(i_0_142, plain, (nonexistent(X1,X2)|~accessible_world(X3,X1)|~nonexistent(X3,X2))).
% 2.04/0.66 cnf(i_0_143, plain, (unisex(X1,X2)|~accessible_world(X3,X1)|~unisex(X3,X2))).
% 2.04/0.66 cnf(i_0_165, plain, (man(X1,X2)|~accessible_world(X3,X1)|~man(X3,X2))).
% 2.04/0.66 cnf(i_0_144, plain, (present(X1,X2)|~present(X3,X2)|~accessible_world(X3,X1))).
% 2.04/0.66 cnf(i_0_147, plain, (relation(X1,X2)|~accessible_world(X3,X1)|~relation(X3,X2))).
% 2.04/0.66 cnf(i_0_148, plain, (abstraction(X1,X2)|~accessible_world(X3,X1)|~abstraction(X3,X2))).
% 2.04/0.66 cnf(i_0_149, plain, (nonhuman(X1,X2)|~accessible_world(X3,X1)|~nonhuman(X3,X2))).
% 2.04/0.66 cnf(i_0_150, plain, (general(X1,X2)|~accessible_world(X3,X1)|~general(X3,X2))).
% 2.04/0.66 cnf(i_0_152, plain, (relname(X1,X2)|~accessible_world(X3,X1)|~relname(X3,X2))).
% 2.04/0.66 cnf(i_0_155, plain, (human_person(X1,X2)|~accessible_world(X3,X1)|~human_person(X3,X2))).
% 2.04/0.66 cnf(i_0_156, plain, (organism(X1,X2)|~accessible_world(X3,X1)|~organism(X3,X2))).
% 2.04/0.66 cnf(i_0_157, plain, (entity(X1,X2)|~accessible_world(X3,X1)|~entity(X3,X2))).
% 2.04/0.66 cnf(i_0_158, plain, (existent(X1,X2)|~accessible_world(X3,X1)|~existent(X3,X2))).
% 2.04/0.66 cnf(i_0_159, plain, (impartial(X1,X2)|~accessible_world(X3,X1)|~impartial(X3,X2))).
% 2.04/0.66 cnf(i_0_160, plain, (living(X1,X2)|~accessible_world(X3,X1)|~living(X3,X2))).
% 2.04/0.66 cnf(i_0_161, plain, (human(X1,X2)|~accessible_world(X3,X1)|~human(X3,X2))).
% 2.04/0.66 cnf(i_0_162, plain, (animate(X1,X2)|~accessible_world(X3,X1)|~animate(X3,X2))).
% 2.04/0.66 cnf(i_0_163, plain, (female(X1,X2)|~accessible_world(X3,X1)|~female(X3,X2))).
% 2.04/0.66 cnf(i_0_166, plain, (male(X1,X2)|~accessible_world(X3,X1)|~male(X3,X2))).
% 2.04/0.66 cnf(i_0_167, plain, (agent(X1,X2,X3)|~agent(X4,X2,X3)|~accessible_world(X4,X1))).
% 2.04/0.66 cnf(i_0_168, plain, (theme(X1,X2,X3)|~theme(X4,X2,X3)|~accessible_world(X4,X1))).
% 2.04/0.66 cnf(i_0_169, plain, (of(X1,X2,X3)|~of(X4,X2,X3)|~accessible_world(X4,X1))).
% 2.04/0.66 cnf(i_0_170, plain, (X1=X2|~of(X3,X2,X4)|~of(X3,X1,X4)|~entity(X3,X4)|~forename(X3,X2)|~forename(X3,X1))).
% 2.04/0.66 cnf(i_0_171, plain, (X1=X2|~theme(X3,X4,X2)|~theme(X3,X5,X1)|~proposition(X3,X2)|~proposition(X3,X1)|~desire_want(X3,X4)|~desire_want(X3,X5))).
% 2.04/0.66 cnf(i_0_190, negated_conjecture, (proposition(X1,skf4(X2,X1))|~actual_world(X1)|~of(X1,X3,X4)|~of(X1,X5,X2)|~theme(X1,X6,X7)|~agent(X7,X8,X4)|~agent(X1,X6,X4)|~present(X7,X8)|~present(X1,X6)|~accessible_world(X1,X7)|~man(X1,X2)|~vincent_forename(X1,X5)|~woman(X1,X4)|~mia_forename(X1,X3)|~proposition(X1,X7)|~desire_want(X1,X6)|~dance(X7,X8))).
% 2.04/0.66 cnf(i_0_189, negated_conjecture, (accessible_world(X1,skf4(X2,X1))|~actual_world(X1)|~of(X1,X3,X4)|~of(X1,X5,X2)|~theme(X1,X6,X7)|~agent(X7,X8,X4)|~agent(X1,X6,X4)|~present(X7,X8)|~present(X1,X6)|~accessible_world(X1,X7)|~man(X1,X2)|~vincent_forename(X1,X5)|~woman(X1,X4)|~mia_forename(X1,X3)|~proposition(X1,X7)|~desire_want(X1,X6)|~dance(X7,X8))).
% 2.04/0.66 cnf(i_0_188, negated_conjecture, (desire_want(X1,skf3(X1,X2))|~actual_world(X1)|~of(X1,X3,X4)|~of(X1,X5,X6)|~theme(X1,X7,X8)|~agent(X8,X9,X4)|~agent(X1,X7,X4)|~present(X8,X9)|~present(X1,X7)|~accessible_world(X1,X8)|~man(X1,X6)|~vincent_forename(X1,X5)|~woman(X1,X4)|~mia_forename(X1,X3)|~proposition(X1,X8)|~desire_want(X1,X7)|~dance(X8,X9))).
% 2.04/0.66 cnf(i_0_187, negated_conjecture, (present(X1,skf3(X1,X2))|~actual_world(X1)|~of(X1,X3,X4)|~of(X1,X5,X6)|~theme(X1,X7,X8)|~agent(X8,X9,X4)|~agent(X1,X7,X4)|~present(X8,X9)|~present(X1,X7)|~accessible_world(X1,X8)|~man(X1,X6)|~vincent_forename(X1,X5)|~woman(X1,X4)|~mia_forename(X1,X3)|~proposition(X1,X8)|~desire_want(X1,X7)|~dance(X8,X9))).
% 2.04/0.66 cnf(i_0_191, negated_conjecture, (agent(X1,skf3(X1,X2),X2)|~actual_world(X1)|~of(X1,X3,X4)|~of(X1,X5,X2)|~theme(X1,X6,X7)|~agent(X7,X8,X4)|~agent(X1,X6,X4)|~present(X7,X8)|~present(X1,X6)|~accessible_world(X1,X7)|~man(X1,X2)|~vincent_forename(X1,X5)|~woman(X1,X4)|~mia_forename(X1,X3)|~proposition(X1,X7)|~desire_want(X1,X6)|~dance(X7,X8))).
% 2.04/0.66 cnf(i_0_193, negated_conjecture, (dance(skf4(X1,X2),skf5(X2,X1))|~actual_world(X3)|~of(X3,X4,X5)|~of(X3,X6,X1)|~theme(X3,X7,X8)|~agent(X8,X9,X5)|~agent(X3,X7,X5)|~present(X8,X9)|~present(X3,X7)|~accessible_world(X3,X8)|~man(X3,X1)|~vincent_forename(X3,X6)|~woman(X3,X5)|~mia_forename(X3,X4)|~proposition(X3,X8)|~desire_want(X3,X7)|~dance(X8,X9))).
% 2.04/0.66 cnf(i_0_196, negated_conjecture, (theme(X1,skf3(X1,X2),skf4(X2,X1))|~actual_world(X1)|~of(X1,X3,X4)|~of(X1,X5,X2)|~theme(X1,X6,X7)|~agent(X7,X8,X4)|~agent(X1,X6,X4)|~present(X7,X8)|~present(X1,X6)|~accessible_world(X1,X7)|~man(X1,X2)|~vincent_forename(X1,X5)|~woman(X1,X4)|~mia_forename(X1,X3)|~proposition(X1,X7)|~desire_want(X1,X6)|~dance(X7,X8))).
% 2.04/0.66 cnf(i_0_192, negated_conjecture, (event(skf4(X1,X2),skf5(X2,X1))|~actual_world(X3)|~of(X3,X4,X5)|~of(X3,X6,X1)|~theme(X3,X7,X8)|~agent(X8,X9,X5)|~agent(X3,X7,X5)|~present(X8,X9)|~present(X3,X7)|~accessible_world(X3,X8)|~man(X3,X1)|~vincent_forename(X3,X6)|~woman(X3,X5)|~mia_forename(X3,X4)|~proposition(X3,X8)|~desire_want(X3,X7)|~dance(X8,X9))).
% 2.04/0.66 cnf(i_0_194, negated_conjecture, (present(skf4(X1,X2),skf5(X2,X1))|~actual_world(X3)|~of(X3,X4,X5)|~of(X3,X6,X1)|~theme(X3,X7,X8)|~agent(X8,X9,X5)|~agent(X3,X7,X5)|~present(X8,X9)|~present(X3,X7)|~accessible_world(X3,X8)|~man(X3,X1)|~vincent_forename(X3,X6)|~woman(X3,X5)|~mia_forename(X3,X4)|~proposition(X3,X8)|~desire_want(X3,X7)|~dance(X8,X9))).
% 2.04/0.66 cnf(i_0_195, negated_conjecture, (agent(skf4(X1,X2),skf5(X2,X1),X1)|~actual_world(X3)|~of(X3,X4,X5)|~of(X3,X6,X1)|~theme(X3,X7,X8)|~agent(X8,X9,X5)|~agent(X3,X7,X5)|~present(X8,X9)|~present(X3,X7)|~accessible_world(X3,X8)|~man(X3,X1)|~vincent_forename(X3,X6)|~woman(X3,X5)|~mia_forename(X3,X4)|~proposition(X3,X8)|~desire_want(X3,X7)|~dance(X8,X9))).
% 2.04/0.66 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.04/0.66 # Begin printing tableau
% 2.04/0.66 # Found 19 steps
% 2.04/0.66 cnf(i_0_196, negated_conjecture, (theme(skc6,skf3(skc6,skc10),skf4(skc10,skc6))|~actual_world(skc6)|~of(skc6,skc9,skc10)|~of(skc6,skc9,skc10)|~theme(skc6,skc7,skc8)|~agent(skc8,skc11,skc10)|~agent(skc6,skc7,skc10)|~present(skc8,skc11)|~present(skc6,skc7)|~accessible_world(skc6,skc8)|~man(skc6,skc10)|~vincent_forename(skc6,skc9)|~woman(skc6,skc10)|~mia_forename(skc6,skc9)|~proposition(skc6,skc8)|~desire_want(skc6,skc7)|~dance(skc8,skc11)), inference(start_rule)).
% 2.04/0.66 cnf(i_0_249, plain, (~actual_world(skc6)), inference(closure_rule, [i_0_172])).
% 2.04/0.66 cnf(i_0_250, plain, (~of(skc6,skc9,skc10)), inference(closure_rule, [i_0_183])).
% 2.04/0.66 cnf(i_0_251, plain, (~of(skc6,skc9,skc10)), inference(closure_rule, [i_0_183])).
% 2.04/0.66 cnf(i_0_252, plain, (~theme(skc6,skc7,skc8)), inference(closure_rule, [i_0_186])).
% 2.04/0.66 cnf(i_0_253, plain, (~agent(skc8,skc11,skc10)), inference(closure_rule, [i_0_185])).
% 2.04/0.66 cnf(i_0_254, plain, (~agent(skc6,skc7,skc10)), inference(closure_rule, [i_0_184])).
% 2.04/0.66 cnf(i_0_255, plain, (~present(skc8,skc11)), inference(closure_rule, [i_0_175])).
% 2.04/0.66 cnf(i_0_256, plain, (~present(skc6,skc7)), inference(closure_rule, [i_0_182])).
% 2.04/0.66 cnf(i_0_257, plain, (~accessible_world(skc6,skc8)), inference(closure_rule, [i_0_180])).
% 2.04/0.66 cnf(i_0_260, plain, (~woman(skc6,skc10)), inference(closure_rule, [i_0_174])).
% 2.04/0.66 cnf(i_0_261, plain, (~mia_forename(skc6,skc9)), inference(closure_rule, [i_0_178])).
% 2.04/0.66 cnf(i_0_262, plain, (~proposition(skc6,skc8)), inference(closure_rule, [i_0_179])).
% 2.04/0.66 cnf(i_0_263, plain, (~desire_want(skc6,skc7)), inference(closure_rule, [i_0_181])).
% 2.04/0.66 cnf(i_0_264, plain, (~dance(skc8,skc11)), inference(closure_rule, [i_0_176])).
% 2.04/0.66 cnf(i_0_248, plain, (theme(skc6,skf3(skc6,skc10),skf4(skc10,skc6))), inference(extension_rule, [i_0_168])).
% 2.04/0.66 cnf(i_0_554, plain, (~accessible_world(skc6,skc8)), inference(closure_rule, [i_0_180])).
% 2.04/0.66 cnf(i_0_552, plain, (theme(skc8,skf3(skc6,skc10),skf4(skc10,skc6))), inference(extension_rule, [i_0_171])).
% 2.04/0.66 cnf(i_0_736, plain, (~theme(skc8,skf3(skc6,skc10),skf4(skc10,skc6))), inference(closure_rule, [i_0_552])).
% 2.04/0.66 # End printing tableau
% 2.04/0.66 # SZS output end
% 2.04/0.66 # Branches closed with saturation will be marked with an "s"
% 2.04/0.66 # Child (28934) has found a proof.
% 2.04/0.66
% 2.04/0.66 # Proof search is over...
% 2.04/0.66 # Freeing feature tree
%------------------------------------------------------------------------------