TSTP Solution File: NLP025-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP025-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 : n004.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 31.66s 4.43s
% Output : CNFRefutation 31.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NLP025-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.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 1 00:26:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.39 # No SInE strategy applied
% 0.20/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.39 #
% 0.20/0.39 # Presaturation interreduction done
% 0.20/0.39 # Number of axioms: 102 Number of unprocessed: 102
% 0.20/0.39 # Tableaux proof search.
% 0.20/0.39 # APR header successfully linked.
% 0.20/0.39 # Hello from C++
% 0.20/0.39 # The folding up rule is enabled...
% 0.20/0.39 # Local unification is enabled...
% 0.20/0.39 # Any saturation attempts will use folding labels...
% 0.20/0.39 # 102 beginning clauses after preprocessing and clausification
% 0.20/0.39 # Creating start rules for all 26 conjectures.
% 0.20/0.39 # There are 26 start rule candidates:
% 0.20/0.39 # Found 102 unit axioms.
% 0.20/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.39 # 26 start rule tableaux created.
% 0.20/0.39 # 0 extension rule candidate clauses
% 0.20/0.39 # 102 unit axiom clauses
% 0.20/0.39
% 0.20/0.39 # Requested 8, 32 cores available to the main process.
% 30.79/4.28 # Creating equality axioms
% 30.79/4.28 # Ran out of tableaux, making start rules for all clauses
% 30.79/4.28 # 3128 Satisfiable branch
% 30.79/4.32 # Creating equality axioms
% 30.79/4.32 # Ran out of tableaux, making start rules for all clauses
% 30.79/4.32 # 3127 Satisfiable branch
% 31.36/4.38 # Creating equality axioms
% 31.36/4.38 # Ran out of tableaux, making start rules for all clauses
% 31.36/4.38 # 3126 Satisfiable branch
% 31.66/4.39 # Creating equality axioms
% 31.66/4.39 # Ran out of tableaux, making start rules for all clauses
% 31.66/4.39 # 3125 Satisfiable branch
% 31.66/4.42 # Creating equality axioms
% 31.66/4.42 # Ran out of tableaux, making start rules for all clauses
% 31.66/4.42 # 3124 Satisfiable branch
% 31.66/4.43 # Satisfiable branch found.
% 31.66/4.43 # There were 1 total branch saturation attempts.
% 31.66/4.43 # There were 0 of these attempts blocked.
% 31.66/4.43 # There were 0 deferred branch saturation attempts.
% 31.66/4.43 # There were 0 free duplicated saturations.
% 31.66/4.43 # There were 0 total successful branch saturations.
% 31.66/4.43 # There were 0 successful branch saturations in interreduction.
% 31.66/4.43 # There were 0 successful branch saturations on the branch.
% 31.66/4.43 # There were 0 successful branch saturations after the branch.
% 31.66/4.43 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 31.66/4.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 31.66/4.43 # Begin clausification derivation
% 31.66/4.43
% 31.66/4.43 # End clausification derivation
% 31.66/4.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 31.66/4.43 cnf(i_0_173, negated_conjecture, (actual_world(skc6)=true)).
% 31.66/4.43 cnf(i_0_177, negated_conjecture, (dance(skc8,skc11)=true)).
% 31.66/4.43 cnf(i_0_174, negated_conjecture, (event(skc8,skc11)=true)).
% 31.66/4.43 cnf(i_0_182, negated_conjecture, (desire_want(skc6,skc7)=true)).
% 31.66/4.43 cnf(i_0_180, negated_conjecture, (proposition(skc6,skc8)=true)).
% 31.66/4.43 cnf(i_0_178, negated_conjecture, (forename(skc6,skc9)=true)).
% 31.66/4.43 cnf(i_0_179, negated_conjecture, (mia_forename(skc6,skc9)=true)).
% 31.66/4.43 cnf(i_0_175, negated_conjecture, (woman(skc6,skc10)=true)).
% 31.66/4.43 cnf(i_0_181, negated_conjecture, (accessible_world(skc6,skc8)=true)).
% 31.66/4.43 cnf(i_0_183, negated_conjecture, (present(skc6,skc7)=true)).
% 31.66/4.43 cnf(i_0_176, negated_conjecture, (present(skc8,skc11)=true)).
% 31.66/4.43 cnf(i_0_185, negated_conjecture, (agent(skc6,skc7,skc10)=true)).
% 31.66/4.43 cnf(i_0_186, negated_conjecture, (agent(skc8,skc11,skc10)=true)).
% 31.66/4.43 cnf(i_0_187, negated_conjecture, (theme(skc6,skc7,skc8)=true)).
% 31.66/4.43 cnf(i_0_184, negated_conjecture, (of(skc6,skc9,skc10)=true)).
% 31.66/4.43 cnf(i_0_103, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 31.66/4.43 cnf(i_0_104, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 31.66/4.43 cnf(i_0_105, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 31.66/4.43 cnf(i_0_106, plain, (ifeq2(dance(X1,X2),true,event(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_107, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_108, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_113, plain, (ifeq2(desire_want(X1,X2),true,event(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_122, plain, (ifeq2(mia_forename(X1,X2),true,forename(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_134, plain, (ifeq2(vincent_forename(X1,X2),true,forename(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_114, plain, (ifeq2(proposition(X1,X2),true,relation(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_120, plain, (ifeq2(forename(X1,X2),true,relname(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_110, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_123, plain, (ifeq2(woman(X1,X2),true,human_person(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_111, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_112, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_109, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_115, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_133, plain, (ifeq2(woman(X1,X2),true,female(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_135, plain, (ifeq2(man(X1,X2),true,human_person(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_136, plain, (ifeq2(man(X1,X2),true,male(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_116, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_119, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_117, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_118, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_121, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_124, plain, (ifeq2(human_person(X1,X2),true,organism(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_131, plain, (ifeq2(human_person(X1,X2),true,human(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_132, plain, (ifeq2(human_person(X1,X2),true,animate(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_125, plain, (ifeq2(organism(X1,X2),true,entity(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_129, plain, (ifeq2(organism(X1,X2),true,impartial(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_130, plain, (ifeq2(organism(X1,X2),true,living(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_126, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_127, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_128, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)).
% 31.66/4.43 cnf(i_0_137, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(dance(X1,X3),true,dance(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_200, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)).
% 31.66/4.43 cnf(i_0_203, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)).
% 31.66/4.43 cnf(i_0_199, plain, (ifeq(tuple(unisex(X1,X2),female(X1,X2)),tuple(true,true),a,b)=b)).
% 31.66/4.43 cnf(i_0_198, plain, (ifeq(tuple(unisex(X1,X2),male(X1,X2)),tuple(true,true),a,b)=b)).
% 31.66/4.43 cnf(i_0_138, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(event(X1,X3),true,event(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_146, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(desire_want(X1,X3),true,desire_want(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_147, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(proposition(X1,X3),true,proposition(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_152, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(forename(X1,X3),true,forename(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_154, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(mia_forename(X1,X3),true,mia_forename(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_201, plain, (ifeq(tuple(nonhuman(X1,X2),human(X1,X2)),tuple(true,true),a,b)=b)).
% 31.66/4.43 cnf(i_0_155, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(woman(X1,X3),true,woman(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_202, plain, (ifeq(tuple(female(X1,X2),male(X1,X2)),tuple(true,true),a,b)=b)).
% 31.66/4.43 cnf(i_0_139, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(eventuality(X1,X3),true,eventuality(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_140, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(thing(X1,X3),true,thing(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_141, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(singleton(X1,X3),true,singleton(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_165, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(vincent_forename(X1,X3),true,vincent_forename(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_166, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(man(X1,X3),true,man(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_145, plain, (ifeq2(present(X1,X2),true,ifeq2(accessible_world(X1,X3),true,present(X3,X2),true),true)=true)).
% 31.66/4.43 cnf(i_0_142, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(specific(X1,X3),true,specific(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_143, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonexistent(X1,X3),true,nonexistent(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_144, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(unisex(X1,X3),true,unisex(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_148, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relation(X1,X3),true,relation(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_149, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(abstraction(X1,X3),true,abstraction(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_150, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonhuman(X1,X3),true,nonhuman(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_151, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(general(X1,X3),true,general(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_153, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relname(X1,X3),true,relname(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_156, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human_person(X1,X3),true,human_person(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_157, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(organism(X1,X3),true,organism(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_158, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(entity(X1,X3),true,entity(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_159, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(existent(X1,X3),true,existent(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_160, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(impartial(X1,X3),true,impartial(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_161, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(living(X1,X3),true,living(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_162, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human(X1,X3),true,human(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_163, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(animate(X1,X3),true,animate(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_164, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(female(X1,X3),true,female(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_167, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(male(X1,X3),true,male(X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_168, plain, (ifeq2(agent(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,agent(X4,X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_169, plain, (ifeq2(theme(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,theme(X4,X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_170, plain, (ifeq2(of(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,of(X4,X2,X3),true),true)=true)).
% 31.66/4.43 cnf(i_0_171, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(entity(X1,X3),true,ifeq3(forename(X1,X2),true,ifeq3(forename(X1,X4),true,X2,X4),X4),X4),X4),X4)=X4)).
% 31.66/4.43 cnf(i_0_172, plain, (ifeq3(theme(X1,X2,X3),true,ifeq3(theme(X1,X4,X5),true,ifeq3(proposition(X1,X3),true,ifeq3(proposition(X1,X5),true,ifeq3(desire_want(X1,X2),true,ifeq3(desire_want(X1,X4),true,X3,X5),X5),X5),X5),X5),X5)=X5)).
% 31.66/4.43 cnf(i_0_189, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,desire_want(X1,skf3(X1,X9)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_191, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,proposition(X1,skf4(X5,X1)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_190, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,accessible_world(X1,skf4(X5,X1)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_188, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,present(X1,skf3(X1,X9)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_192, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,agent(X1,skf3(X1,X5),X5),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_194, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,dance(skf4(X5,X9),skf5(X9,X5)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_193, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,event(skf4(X5,X9),skf5(X9,X5)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_195, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,present(skf4(X5,X9),skf5(X9,X5)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_197, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,theme(X1,skf3(X1,X5),skf4(X5,X1)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_196, negated_conjecture, (ifeq2(actual_world(X1),true,ifeq2(of(X1,X2,X3),true,ifeq2(of(X1,X4,X5),true,ifeq2(theme(X1,X6,X7),true,ifeq2(agent(X7,X8,X3),true,ifeq2(agent(X1,X6,X3),true,ifeq2(present(X7,X8),true,ifeq2(present(X1,X6),true,ifeq2(accessible_world(X1,X7),true,ifeq2(man(X1,X5),true,ifeq2(vincent_forename(X1,X4),true,ifeq2(woman(X1,X3),true,ifeq2(mia_forename(X1,X2),true,ifeq2(forename(X1,X2),true,ifeq2(forename(X1,X4),true,ifeq2(proposition(X1,X7),true,ifeq2(desire_want(X1,X6),true,ifeq2(event(X7,X8),true,ifeq2(dance(X7,X8),true,agent(skf4(X5,X9),skf5(X9,X5),X5),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 31.66/4.43 cnf(i_0_204, negated_conjecture, (a!=b)).
% 31.66/4.43 cnf(i_0_231, plain, (X10=X10)).
% 31.66/4.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 31.66/4.43 # Begin printing tableau
% 31.66/4.43 # Found 7 steps
% 31.66/4.43 cnf(i_0_231, plain, (true=true), inference(start_rule)).
% 31.66/4.43 cnf(i_0_380, plain, (true=true), inference(extension_rule, [i_0_235])).
% 31.66/4.43 cnf(i_0_390, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_173])).
% 31.66/4.43 cnf(i_0_391, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_173])).
% 31.66/4.43 cnf(i_0_392, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_173])).
% 31.66/4.43 cnf(i_0_388, plain, (ifeq3(true,actual_world(skc6),actual_world(skc6),actual_world(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_234])).
% 31.66/4.43 cnf(i_0_399, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_103])).
% 31.66/4.43 # End printing tableau
% 31.66/4.43 # SZS output end
% 31.66/4.43 # Branches closed with saturation will be marked with an "s"
% 31.66/4.43 # Creating equality axioms
% 31.66/4.43 # Ran out of tableaux, making start rules for all clauses
% 31.66/4.43 # 3129 Satisfiable branch
% 32.14/4.44 # Child (3128) has found a proof.
% 32.14/4.44
% 32.14/4.44 # Proof search is over...
% 32.14/4.44 # Freeing feature tree
%------------------------------------------------------------------------------