TSTP Solution File: NLP246-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP246-10 : TPTP v8.1.0. Released v7.5.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 : n019.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:14:22 EDT 2022
% Result : Satisfiable 2.09s 0.63s
% Output : CNFRefutation 2.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP246-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/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 : n019.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 : 600
% 0.12/0.34 % DateTime : Fri Jul 1 10:53:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 114 Number of unprocessed: 114
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 114 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 40 conjectures.
% 0.19/0.38 # There are 40 start rule candidates:
% 0.19/0.38 # Found 114 unit axioms.
% 0.19/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.38 # 40 start rule tableaux created.
% 0.19/0.38 # 0 extension rule candidate clauses
% 0.19/0.38 # 114 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 1.57/0.61 # Creating equality axioms
% 1.57/0.61 # Ran out of tableaux, making start rules for all clauses
% 1.57/0.61 # 17165 Satisfiable branch
% 1.57/0.62 # Creating equality axioms
% 1.57/0.62 # Ran out of tableaux, making start rules for all clauses
% 1.57/0.62 # 17162 Satisfiable branch
% 1.57/0.62 # Creating equality axioms
% 1.57/0.62 # Ran out of tableaux, making start rules for all clauses
% 1.57/0.62 # 17161 Satisfiable branch
% 1.57/0.62 # Creating equality axioms
% 1.57/0.62 # Ran out of tableaux, making start rules for all clauses
% 1.57/0.62 # 17163 Satisfiable branch
% 1.57/0.62 # Creating equality axioms
% 1.57/0.62 # Ran out of tableaux, making start rules for all clauses
% 1.57/0.62 # 17160 Satisfiable branch
% 1.57/0.62 # Creating equality axioms
% 1.57/0.62 # Ran out of tableaux, making start rules for all clauses
% 1.57/0.62 # 17158 Satisfiable branch
% 2.09/0.62 # Creating equality axioms
% 2.09/0.62 # Ran out of tableaux, making start rules for all clauses
% 2.09/0.62 # 17164 Satisfiable branch
% 2.09/0.63 # Creating equality axioms
% 2.09/0.63 # Ran out of tableaux, making start rules for all clauses
% 2.09/0.63 # 17159 Satisfiable branch
% 2.09/0.63 # Satisfiable branch found.
% 2.09/0.63 # There were 1 total branch saturation attempts.
% 2.09/0.63 # There were 0 of these attempts blocked.
% 2.09/0.63 # There were 0 deferred branch saturation attempts.
% 2.09/0.63 # There were 0 free duplicated saturations.
% 2.09/0.63 # There were 0 total successful branch saturations.
% 2.09/0.63 # There were 0 successful branch saturations in interreduction.
% 2.09/0.63 # There were 0 successful branch saturations on the branch.
% 2.09/0.63 # There were 0 successful branch saturations after the branch.
% 2.09/0.63 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.09/0.63 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.09/0.63 # Begin clausification derivation
% 2.09/0.63
% 2.09/0.63 # End clausification derivation
% 2.09/0.63 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.09/0.63 cnf(i_0_185, negated_conjecture, (actual_world(skc13)=true)).
% 2.09/0.63 cnf(i_0_189, negated_conjecture, (smoke(skc14,skc24)=true)).
% 2.09/0.63 cnf(i_0_194, negated_conjecture, (event(skc13,skc21)=true)).
% 2.09/0.63 cnf(i_0_205, negated_conjecture, (event(skc13,skc15)=true)).
% 2.09/0.63 cnf(i_0_186, negated_conjecture, (event(skc14,skc24)=true)).
% 2.09/0.63 cnf(i_0_208, negated_conjecture, (proposition(skc13,skc14)=true)).
% 2.09/0.63 cnf(i_0_207, negated_conjecture, (proposition(skc13,skc20)=true)).
% 2.09/0.63 cnf(i_0_202, negated_conjecture, (state(skc13,skc16)=true)).
% 2.09/0.63 cnf(i_0_187, negated_conjecture, (man(skc13,skc23)=true)).
% 2.09/0.63 cnf(i_0_200, negated_conjecture, (man(skc13,skc17)=true)).
% 2.09/0.63 cnf(i_0_191, negated_conjecture, (forename(skc13,skc25)=true)).
% 2.09/0.63 cnf(i_0_192, negated_conjecture, (forename(skc13,skc22)=true)).
% 2.09/0.64 cnf(i_0_197, negated_conjecture, (forename(skc13,skc19)=true)).
% 2.09/0.64 cnf(i_0_199, negated_conjecture, (forename(skc13,skc18)=true)).
% 2.09/0.64 cnf(i_0_193, negated_conjecture, (vincent_forename(skc13,skc22)=true)).
% 2.09/0.64 cnf(i_0_201, negated_conjecture, (vincent_forename(skc13,skc19)=true)).
% 2.09/0.64 cnf(i_0_190, negated_conjecture, (jules_forename(skc13,skc25)=true)).
% 2.09/0.64 cnf(i_0_198, negated_conjecture, (jules_forename(skc13,skc18)=true)).
% 2.09/0.64 cnf(i_0_209, negated_conjecture, (accessible_world(skc13,skc14)=true)).
% 2.09/0.64 cnf(i_0_206, negated_conjecture, (accessible_world(skc13,skc20)=true)).
% 2.09/0.64 cnf(i_0_195, negated_conjecture, (present(skc13,skc21)=true)).
% 2.09/0.64 cnf(i_0_204, negated_conjecture, (present(skc13,skc15)=true)).
% 2.09/0.64 cnf(i_0_188, negated_conjecture, (present(skc14,skc24)=true)).
% 2.09/0.64 cnf(i_0_196, negated_conjecture, (think_believe_consider(skc13,skc21)=true)).
% 2.09/0.64 cnf(i_0_203, negated_conjecture, (think_believe_consider(skc13,skc15)=true)).
% 2.09/0.64 cnf(i_0_212, negated_conjecture, (agent(skc13,skc21,skc23)=true)).
% 2.09/0.64 cnf(i_0_216, negated_conjecture, (agent(skc13,skc15,skc17)=true)).
% 2.09/0.64 cnf(i_0_213, negated_conjecture, (agent(skc14,skc24,skc23)=true)).
% 2.09/0.64 cnf(i_0_115, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 2.09/0.64 cnf(i_0_116, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 2.09/0.64 cnf(i_0_117, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 2.09/0.64 cnf(i_0_214, negated_conjecture, (theme(skc13,skc21,skc20)=true)).
% 2.09/0.64 cnf(i_0_218, negated_conjecture, (theme(skc13,skc15,skc14)=true)).
% 2.09/0.64 cnf(i_0_210, negated_conjecture, (of(skc13,skc25,skc23)=true)).
% 2.09/0.64 cnf(i_0_211, negated_conjecture, (of(skc13,skc22,skc23)=true)).
% 2.09/0.64 cnf(i_0_217, negated_conjecture, (of(skc13,skc19,skc17)=true)).
% 2.09/0.64 cnf(i_0_215, negated_conjecture, (of(skc13,skc18,skc17)=true)).
% 2.09/0.64 cnf(i_0_219, negated_conjecture, (be(skc13,skc16,skc17,skc17)=true)).
% 2.09/0.64 cnf(i_0_220, negated_conjecture, (ifeq2(man(skc20,X1),true,smoke(skc20,skf1(X2)),true)=true)).
% 2.09/0.64 cnf(i_0_148, plain, (ifeq3(be(X1,X2,X3,X4),true,X3,X4)=X4)).
% 2.09/0.64 cnf(i_0_118, plain, (ifeq2(smoke(X1,X2),true,event(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_119, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_120, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_222, negated_conjecture, (ifeq2(man(skc20,X1),true,event(skc20,skf1(X2)),true)=true)).
% 2.09/0.64 cnf(i_0_221, negated_conjecture, (ifeq2(man(skc20,X1),true,present(skc20,skf1(X2)),true)=true)).
% 2.09/0.64 cnf(i_0_223, negated_conjecture, (ifeq2(man(skc20,X1),true,agent(skc20,skf1(X1),X1),true)=true)).
% 2.09/0.64 cnf(i_0_132, plain, (ifeq2(state(X1,X2),true,event(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_146, plain, (ifeq2(vincent_forename(X1,X2),true,forename(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_122, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_147, plain, (ifeq2(jules_forename(X1,X2),true,forename(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_123, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_124, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_121, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_125, plain, (ifeq2(proposition(X1,X2),true,relation(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_131, plain, (ifeq2(state(X1,X2),true,eventuality(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_133, plain, (ifeq2(man(X1,X2),true,human_person(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_143, plain, (ifeq2(man(X1,X2),true,male(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_144, plain, (ifeq2(forename(X1,X2),true,relname(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_126, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_127, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_130, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_128, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_129, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_134, plain, (ifeq2(human_person(X1,X2),true,organism(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_141, plain, (ifeq2(human_person(X1,X2),true,human(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_142, plain, (ifeq2(human_person(X1,X2),true,animate(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_135, plain, (ifeq2(organism(X1,X2),true,entity(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_139, plain, (ifeq2(organism(X1,X2),true,impartial(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_140, plain, (ifeq2(organism(X1,X2),true,living(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_136, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_137, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_138, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_145, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_225, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)).
% 2.09/0.64 cnf(i_0_227, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)).
% 2.09/0.64 cnf(i_0_224, plain, (ifeq(tuple(unisex(X1,X2),male(X1,X2)),tuple(true,true),a,b)=b)).
% 2.09/0.64 cnf(i_0_149, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(smoke(X1,X3),true,smoke(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_150, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(event(X1,X3),true,event(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_159, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(proposition(X1,X3),true,proposition(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_164, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(state(X1,X3),true,state(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_165, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(man(X1,X3),true,man(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_226, plain, (ifeq(tuple(nonhuman(X1,X2),human(X1,X2)),tuple(true,true),a,b)=b)).
% 2.09/0.64 cnf(i_0_175, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(forename(X1,X3),true,forename(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_151, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(eventuality(X1,X3),true,eventuality(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_152, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(thing(X1,X3),true,thing(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_153, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(singleton(X1,X3),true,singleton(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_154, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(specific(X1,X3),true,specific(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_177, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(vincent_forename(X1,X3),true,vincent_forename(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_178, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(jules_forename(X1,X3),true,jules_forename(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_157, plain, (ifeq2(present(X1,X2),true,ifeq2(accessible_world(X1,X3),true,present(X3,X2),true),true)=true)).
% 2.09/0.64 cnf(i_0_158, plain, (ifeq2(think_believe_consider(X1,X2),true,ifeq2(accessible_world(X1,X3),true,think_believe_consider(X3,X2),true),true)=true)).
% 2.09/0.64 cnf(i_0_155, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonexistent(X1,X3),true,nonexistent(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_156, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(unisex(X1,X3),true,unisex(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_160, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relation(X1,X3),true,relation(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_161, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(abstraction(X1,X3),true,abstraction(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_162, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonhuman(X1,X3),true,nonhuman(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_163, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(general(X1,X3),true,general(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_166, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human_person(X1,X3),true,human_person(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_167, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(organism(X1,X3),true,organism(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_168, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(entity(X1,X3),true,entity(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_169, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(existent(X1,X3),true,existent(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_170, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(impartial(X1,X3),true,impartial(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_171, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(living(X1,X3),true,living(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_172, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human(X1,X3),true,human(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_173, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(animate(X1,X3),true,animate(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_174, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(male(X1,X3),true,male(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_176, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relname(X1,X3),true,relname(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_179, plain, (ifeq2(agent(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,agent(X4,X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_180, plain, (ifeq2(theme(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,theme(X4,X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_181, plain, (ifeq2(of(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,of(X4,X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_182, plain, (ifeq2(be(X1,X2,X3,X4),true,ifeq2(accessible_world(X1,X5),true,be(X5,X2,X3,X4),true),true)=true)).
% 2.09/0.64 cnf(i_0_183, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(forename(X1,X2),true,ifeq3(forename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)).
% 2.09/0.64 cnf(i_0_184, plain, (ifeq3(theme(X1,X2,X3),true,ifeq3(theme(X1,X4,X5),true,ifeq3(agent(X1,X2,X6),true,ifeq3(agent(X1,X4,X6),true,ifeq3(think_believe_consider(X1,X2),true,ifeq3(think_believe_consider(X1,X4),true,ifeq3(proposition(X1,X3),true,ifeq3(proposition(X1,X5),true,X5,X3),X3),X3),X3),X3),X3),X3),X3)=X3)).
% 2.09/0.64 cnf(i_0_228, negated_conjecture, (a!=b)).
% 2.09/0.64 cnf(i_0_269, plain, (X7=X7)).
% 2.09/0.64 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.09/0.64 # Begin printing tableau
% 2.09/0.64 # Found 9 steps
% 2.09/0.64 cnf(i_0_269, plain, (actual_world(skc13)=actual_world(skc13)), inference(start_rule)).
% 2.09/0.64 cnf(i_0_428, plain, (actual_world(skc13)=actual_world(skc13)), inference(extension_rule, [i_0_273])).
% 2.09/0.64 cnf(i_0_438, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_439, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_440, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_436, plain, (ifeq3(actual_world(skc13),actual_world(skc13),actual_world(skc13),actual_world(skc13))=ifeq3(actual_world(skc13),true,true,true)), inference(extension_rule, [i_0_274])).
% 2.09/0.64 cnf(i_0_996, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_997, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_998, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 # End printing tableau
% 2.09/0.64 # SZS output end
% 2.09/0.64 # Branches closed with saturation will be marked with an "s"
% 2.09/0.64 # Satisfiable branch found.
% 2.09/0.64 # There were 1 total branch saturation attempts.
% 2.09/0.64 # There were 0 of these attempts blocked.
% 2.09/0.64 # There were 0 deferred branch saturation attempts.
% 2.09/0.64 # There were 0 free duplicated saturations.
% 2.09/0.64 # There were 0 total successful branch saturations.
% 2.09/0.64 # There were 0 successful branch saturations in interreduction.
% 2.09/0.64 # There were 0 successful branch saturations on the branch.
% 2.09/0.64 # There were 0 successful branch saturations after the branch.
% 2.09/0.64 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.09/0.64 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.09/0.64 # Begin clausification derivation
% 2.09/0.64
% 2.09/0.64 # End clausification derivation
% 2.09/0.64 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.09/0.64 cnf(i_0_185, negated_conjecture, (actual_world(skc13)=true)).
% 2.09/0.64 cnf(i_0_189, negated_conjecture, (smoke(skc14,skc24)=true)).
% 2.09/0.64 cnf(i_0_194, negated_conjecture, (event(skc13,skc21)=true)).
% 2.09/0.64 cnf(i_0_205, negated_conjecture, (event(skc13,skc15)=true)).
% 2.09/0.64 cnf(i_0_186, negated_conjecture, (event(skc14,skc24)=true)).
% 2.09/0.64 cnf(i_0_208, negated_conjecture, (proposition(skc13,skc14)=true)).
% 2.09/0.64 cnf(i_0_207, negated_conjecture, (proposition(skc13,skc20)=true)).
% 2.09/0.64 cnf(i_0_202, negated_conjecture, (state(skc13,skc16)=true)).
% 2.09/0.64 cnf(i_0_187, negated_conjecture, (man(skc13,skc23)=true)).
% 2.09/0.64 cnf(i_0_200, negated_conjecture, (man(skc13,skc17)=true)).
% 2.09/0.64 cnf(i_0_191, negated_conjecture, (forename(skc13,skc25)=true)).
% 2.09/0.64 cnf(i_0_192, negated_conjecture, (forename(skc13,skc22)=true)).
% 2.09/0.64 cnf(i_0_197, negated_conjecture, (forename(skc13,skc19)=true)).
% 2.09/0.64 cnf(i_0_199, negated_conjecture, (forename(skc13,skc18)=true)).
% 2.09/0.64 cnf(i_0_193, negated_conjecture, (vincent_forename(skc13,skc22)=true)).
% 2.09/0.64 cnf(i_0_201, negated_conjecture, (vincent_forename(skc13,skc19)=true)).
% 2.09/0.64 cnf(i_0_190, negated_conjecture, (jules_forename(skc13,skc25)=true)).
% 2.09/0.64 cnf(i_0_198, negated_conjecture, (jules_forename(skc13,skc18)=true)).
% 2.09/0.64 cnf(i_0_209, negated_conjecture, (accessible_world(skc13,skc14)=true)).
% 2.09/0.64 cnf(i_0_206, negated_conjecture, (accessible_world(skc13,skc20)=true)).
% 2.09/0.64 cnf(i_0_195, negated_conjecture, (present(skc13,skc21)=true)).
% 2.09/0.64 cnf(i_0_204, negated_conjecture, (present(skc13,skc15)=true)).
% 2.09/0.64 cnf(i_0_188, negated_conjecture, (present(skc14,skc24)=true)).
% 2.09/0.64 cnf(i_0_196, negated_conjecture, (think_believe_consider(skc13,skc21)=true)).
% 2.09/0.64 cnf(i_0_203, negated_conjecture, (think_believe_consider(skc13,skc15)=true)).
% 2.09/0.64 cnf(i_0_212, negated_conjecture, (agent(skc13,skc21,skc23)=true)).
% 2.09/0.64 cnf(i_0_216, negated_conjecture, (agent(skc13,skc15,skc17)=true)).
% 2.09/0.64 cnf(i_0_213, negated_conjecture, (agent(skc14,skc24,skc23)=true)).
% 2.09/0.64 cnf(i_0_115, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 2.09/0.64 cnf(i_0_116, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 2.09/0.64 cnf(i_0_117, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 2.09/0.64 cnf(i_0_214, negated_conjecture, (theme(skc13,skc21,skc20)=true)).
% 2.09/0.64 cnf(i_0_218, negated_conjecture, (theme(skc13,skc15,skc14)=true)).
% 2.09/0.64 cnf(i_0_210, negated_conjecture, (of(skc13,skc25,skc23)=true)).
% 2.09/0.64 cnf(i_0_211, negated_conjecture, (of(skc13,skc22,skc23)=true)).
% 2.09/0.64 cnf(i_0_217, negated_conjecture, (of(skc13,skc19,skc17)=true)).
% 2.09/0.64 cnf(i_0_215, negated_conjecture, (of(skc13,skc18,skc17)=true)).
% 2.09/0.64 cnf(i_0_219, negated_conjecture, (be(skc13,skc16,skc17,skc17)=true)).
% 2.09/0.64 cnf(i_0_220, negated_conjecture, (ifeq2(man(skc20,X1),true,smoke(skc20,skf1(X2)),true)=true)).
% 2.09/0.64 cnf(i_0_148, plain, (ifeq3(be(X1,X2,X3,X4),true,X3,X4)=X4)).
% 2.09/0.64 cnf(i_0_118, plain, (ifeq2(smoke(X1,X2),true,event(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_119, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_120, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_222, negated_conjecture, (ifeq2(man(skc20,X1),true,event(skc20,skf1(X2)),true)=true)).
% 2.09/0.64 cnf(i_0_221, negated_conjecture, (ifeq2(man(skc20,X1),true,present(skc20,skf1(X2)),true)=true)).
% 2.09/0.64 cnf(i_0_223, negated_conjecture, (ifeq2(man(skc20,X1),true,agent(skc20,skf1(X1),X1),true)=true)).
% 2.09/0.64 cnf(i_0_132, plain, (ifeq2(state(X1,X2),true,event(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_146, plain, (ifeq2(vincent_forename(X1,X2),true,forename(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_122, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_147, plain, (ifeq2(jules_forename(X1,X2),true,forename(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_123, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_124, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_121, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_125, plain, (ifeq2(proposition(X1,X2),true,relation(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_131, plain, (ifeq2(state(X1,X2),true,eventuality(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_133, plain, (ifeq2(man(X1,X2),true,human_person(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_143, plain, (ifeq2(man(X1,X2),true,male(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_144, plain, (ifeq2(forename(X1,X2),true,relname(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_126, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_127, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_130, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_128, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_129, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_134, plain, (ifeq2(human_person(X1,X2),true,organism(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_141, plain, (ifeq2(human_person(X1,X2),true,human(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_142, plain, (ifeq2(human_person(X1,X2),true,animate(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_135, plain, (ifeq2(organism(X1,X2),true,entity(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_139, plain, (ifeq2(organism(X1,X2),true,impartial(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_140, plain, (ifeq2(organism(X1,X2),true,living(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_136, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_137, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_138, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_145, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)).
% 2.09/0.64 cnf(i_0_225, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)).
% 2.09/0.64 cnf(i_0_227, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)).
% 2.09/0.64 cnf(i_0_224, plain, (ifeq(tuple(unisex(X1,X2),male(X1,X2)),tuple(true,true),a,b)=b)).
% 2.09/0.64 cnf(i_0_149, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(smoke(X1,X3),true,smoke(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_150, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(event(X1,X3),true,event(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_159, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(proposition(X1,X3),true,proposition(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_164, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(state(X1,X3),true,state(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_165, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(man(X1,X3),true,man(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_226, plain, (ifeq(tuple(nonhuman(X1,X2),human(X1,X2)),tuple(true,true),a,b)=b)).
% 2.09/0.64 cnf(i_0_175, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(forename(X1,X3),true,forename(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_151, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(eventuality(X1,X3),true,eventuality(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_152, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(thing(X1,X3),true,thing(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_153, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(singleton(X1,X3),true,singleton(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_154, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(specific(X1,X3),true,specific(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_177, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(vincent_forename(X1,X3),true,vincent_forename(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_178, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(jules_forename(X1,X3),true,jules_forename(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_157, plain, (ifeq2(present(X1,X2),true,ifeq2(accessible_world(X1,X3),true,present(X3,X2),true),true)=true)).
% 2.09/0.64 cnf(i_0_158, plain, (ifeq2(think_believe_consider(X1,X2),true,ifeq2(accessible_world(X1,X3),true,think_believe_consider(X3,X2),true),true)=true)).
% 2.09/0.64 cnf(i_0_155, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonexistent(X1,X3),true,nonexistent(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_156, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(unisex(X1,X3),true,unisex(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_160, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relation(X1,X3),true,relation(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_161, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(abstraction(X1,X3),true,abstraction(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_162, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonhuman(X1,X3),true,nonhuman(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_163, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(general(X1,X3),true,general(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_166, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human_person(X1,X3),true,human_person(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_167, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(organism(X1,X3),true,organism(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_168, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(entity(X1,X3),true,entity(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_169, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(existent(X1,X3),true,existent(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_170, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(impartial(X1,X3),true,impartial(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_171, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(living(X1,X3),true,living(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_172, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human(X1,X3),true,human(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_173, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(animate(X1,X3),true,animate(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_174, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(male(X1,X3),true,male(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_176, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relname(X1,X3),true,relname(X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_179, plain, (ifeq2(agent(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,agent(X4,X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_180, plain, (ifeq2(theme(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,theme(X4,X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_181, plain, (ifeq2(of(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,of(X4,X2,X3),true),true)=true)).
% 2.09/0.64 cnf(i_0_182, plain, (ifeq2(be(X1,X2,X3,X4),true,ifeq2(accessible_world(X1,X5),true,be(X5,X2,X3,X4),true),true)=true)).
% 2.09/0.64 cnf(i_0_183, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(forename(X1,X2),true,ifeq3(forename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)).
% 2.09/0.64 cnf(i_0_184, plain, (ifeq3(theme(X1,X2,X3),true,ifeq3(theme(X1,X4,X5),true,ifeq3(agent(X1,X2,X6),true,ifeq3(agent(X1,X4,X6),true,ifeq3(think_believe_consider(X1,X2),true,ifeq3(think_believe_consider(X1,X4),true,ifeq3(proposition(X1,X3),true,ifeq3(proposition(X1,X5),true,X5,X3),X3),X3),X3),X3),X3),X3),X3)=X3)).
% 2.09/0.64 cnf(i_0_228, negated_conjecture, (a!=b)).
% 2.09/0.64 cnf(i_0_269, plain, (X7=X7)).
% 2.09/0.64 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.09/0.64 # Begin printing tableau
% 2.09/0.64 # Found 9 steps
% 2.09/0.64 cnf(i_0_269, plain, (actual_world(skc13)=actual_world(skc13)), inference(start_rule)).
% 2.09/0.64 cnf(i_0_428, plain, (actual_world(skc13)=actual_world(skc13)), inference(extension_rule, [i_0_273])).
% 2.09/0.64 cnf(i_0_438, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_439, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_440, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_436, plain, (ifeq3(actual_world(skc13),actual_world(skc13),actual_world(skc13),actual_world(skc13))=ifeq3(actual_world(skc13),true,true,true)), inference(extension_rule, [i_0_274])).
% 2.09/0.64 cnf(i_0_996, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_997, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 cnf(i_0_998, plain, (actual_world(skc13)!=true), inference(closure_rule, [i_0_185])).
% 2.09/0.64 # End printing tableau
% 2.09/0.64 # SZS output end
% 2.09/0.64 # Branches closed with saturation will be marked with an "s"
% 2.09/0.64 # Child (17165) has found a proof.
% 2.09/0.64
% 2.09/0.64 # Proof search is over...
% 2.09/0.64 # Freeing feature tree
%------------------------------------------------------------------------------