%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP023-10 : TPTP v8.1.0. Released v7.3.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 : n011.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:43 EDT 2022 % Result : Satisfiable 0.18s 0.41s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NLP023-10 : TPTP v8.1.0. Released v7.3.0. % 0.12/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 : n011.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 05:54:33 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 84 Number of unprocessed: 84 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.37 # The folding up rule is enabled... % 0.18/0.37 # Local unification is enabled... % 0.18/0.37 # Any saturation attempts will use folding labels... % 0.18/0.37 # 84 beginning clauses after preprocessing and clausification % 0.18/0.37 # Creating start rules for all 16 conjectures. % 0.18/0.37 # There are 16 start rule candidates: % 0.18/0.37 # Found 84 unit axioms. % 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.37 # 16 start rule tableaux created. % 0.18/0.37 # 0 extension rule candidate clauses % 0.18/0.37 # 84 unit axiom clauses % 0.18/0.37 % 0.18/0.37 # Requested 8, 32 cores available to the main process. % 0.18/0.41 # Creating equality axioms % 0.18/0.41 # Ran out of tableaux, making start rules for all clauses % 0.18/0.41 # 16514 Satisfiable branch % 0.18/0.41 # Creating equality axioms % 0.18/0.41 # Ran out of tableaux, making start rules for all clauses % 0.18/0.41 # 16513 Satisfiable branch % 0.18/0.41 # Creating equality axioms % 0.18/0.41 # Ran out of tableaux, making start rules for all clauses % 0.18/0.41 # 16516 Satisfiable branch % 0.18/0.41 # Creating equality axioms % 0.18/0.41 # Ran out of tableaux, making start rules for all clauses % 0.18/0.41 # 16517 Satisfiable branch % 0.18/0.41 # Satisfiable branch found. % 0.18/0.41 # There were 1 total branch saturation attempts. % 0.18/0.41 # There were 0 of these attempts blocked. % 0.18/0.41 # There were 0 deferred branch saturation attempts. % 0.18/0.41 # There were 0 free duplicated saturations. % 0.18/0.41 # There were 0 total successful branch saturations. % 0.18/0.41 # There were 0 successful branch saturations in interreduction. % 0.18/0.41 # There were 0 successful branch saturations on the branch. % 0.18/0.41 # There were 0 successful branch saturations after the branch. % 0.18/0.41 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # Begin clausification derivation % 0.18/0.41 % 0.18/0.41 # End clausification derivation % 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.41 cnf(i_0_149, negated_conjecture, (actual_world(skc6)=true)). % 0.18/0.41 cnf(i_0_153, negated_conjecture, (dance(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_150, negated_conjecture, (event(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_158, negated_conjecture, (desire_want(skc6,skc7)=true)). % 0.18/0.41 cnf(i_0_156, negated_conjecture, (proposition(skc6,skc8)=true)). % 0.18/0.41 cnf(i_0_154, negated_conjecture, (forename(skc6,skc9)=true)). % 0.18/0.41 cnf(i_0_155, negated_conjecture, (mia_forename(skc6,skc9)=true)). % 0.18/0.41 cnf(i_0_151, negated_conjecture, (woman(skc6,skc10)=true)). % 0.18/0.41 cnf(i_0_157, negated_conjecture, (accessible_world(skc6,skc8)=true)). % 0.18/0.41 cnf(i_0_159, negated_conjecture, (present(skc6,skc7)=true)). % 0.18/0.41 cnf(i_0_152, negated_conjecture, (present(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_161, negated_conjecture, (agent(skc6,skc7,skc10)=true)). % 0.18/0.41 cnf(i_0_162, negated_conjecture, (agent(skc8,skc11,skc10)=true)). % 0.18/0.41 cnf(i_0_163, negated_conjecture, (theme(skc6,skc7,skc8)=true)). % 0.18/0.41 cnf(i_0_160, negated_conjecture, (of(skc6,skc9,skc10)=true)). % 0.18/0.41 cnf(i_0_85, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_86, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_87, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_88, plain, (ifeq2(dance(X1,X2),true,event(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_89, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_90, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_95, plain, (ifeq2(desire_want(X1,X2),true,event(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_104, plain, (ifeq2(mia_forename(X1,X2),true,forename(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_96, plain, (ifeq2(proposition(X1,X2),true,relation(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_102, plain, (ifeq2(forename(X1,X2),true,relname(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_105, plain, (ifeq2(woman(X1,X2),true,human_person(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_92, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_115, plain, (ifeq2(woman(X1,X2),true,female(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_93, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_94, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_91, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_97, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_98, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_101, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_99, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_100, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_103, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_106, plain, (ifeq2(human_person(X1,X2),true,organism(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_113, plain, (ifeq2(human_person(X1,X2),true,human(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_114, plain, (ifeq2(human_person(X1,X2),true,animate(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_107, plain, (ifeq2(organism(X1,X2),true,entity(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_111, plain, (ifeq2(organism(X1,X2),true,impartial(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_112, plain, (ifeq2(organism(X1,X2),true,living(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_108, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_109, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_110, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_116, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(dance(X1,X3),true,dance(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_117, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(event(X1,X3),true,event(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_165, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_167, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_164, plain, (ifeq(tuple(unisex(X1,X2),female(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_166, plain, (ifeq(tuple(nonhuman(X1,X# Satisfiable branch found. % 0.18/0.41 # There were 1 total branch saturation attempts. % 0.18/0.41 # There were 0 of these attempts blocked. % 0.18/0.41 # There were 0 deferred branch saturation attempts. % 0.18/0.41 # There were 0 free duplicated saturations. % 0.18/0.41 # There were 0 total successful branch saturations. % 0.18/0.41 # There were 0 successful branch saturations in interreduction. % 0.18/0.41 # There were 0 successful branch saturations on the branch. % 0.18/0.41 # There were 0 successful branch saturations after the branch. % 0.18/0.41 2),human(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_118, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(eventuality(X1,X3),true,eventuality(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_119, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(thing(X1,X3),true,thing(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_125, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(desire_want(X1,X3),true,desire_want(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_126, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(proposition(X1,X3),true,proposition(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_131, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(forename(X1,X3),true,forename(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_133, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(mia_forename(X1,X3),true,mia_forename(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_134, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(woman(X1,X3),true,woman(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_120, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(singleton(X1,X3),true,singleton(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_124, plain, (ifeq2(present(X1,X2),true,ifeq2(accessible_world(X1,X3),true,present(X3,X2),true),true)=true)). % 0.18/0.41 cnf(i_0_121, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(specific(X1,X3),true,specific(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_122, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonexistent(X1,X3),true,nonexistent(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_123, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(unisex(X1,X3),true,unisex(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_127, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relation(X1,X3),true,relation(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_128, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(abstraction(X1,X3),true,abstraction(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_129, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonhuman(X1,X3),true,nonhuman(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_130, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(general(X1,X3),true,general(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_132, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relname(X1,X3),true,relname(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_135, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human_person(X1,X3),true,human_person(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_136, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(organism(X1,X3),true,organism(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_137, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(entity(X1,X3),true,entity(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_138, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(existent(X1,X3),true,existent(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_139, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(impartial(X1,X3),true,impartial(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_140, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(living(X1,X3),true,living(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_141, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human(X1,X3),true,human(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_142, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(animate(X1,X3),true,animate(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_143, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(female(X1,X3),true,female(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_144, plain, (ifeq2(agent(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,agent(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_145, plain, (ifeq2(theme(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,theme(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_146, plain, (ifeq2(of(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,of(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_147, 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)). % 0.18/0.41 cnf(i_0_148, 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)). % 0.18/0.41 cnf(i_0_168, negated_conjecture, (a!=b)). % 0.18/0.41 cnf(i_0_185, plain, (X6=X6)). % 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.41 # Begin printing tabl# SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # Begin clausification derivation % 0.18/0.41 % 0.18/0.41 # End clausification derivation % 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.41 cnf(i_0_149, negated_conjecture, (actual_world(skc6)=true)). % 0.18/0.41 cnf(i_0_153, negated_conjecture, (dance(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_150, negated_conjecture, (event(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_158, negated_conjecture, (desire_want(skc6,skc7)=true)). % 0.18/0.41 cnf(i_0_156, negated_conjecture, (proposition(skc6,skc8)=true)). % 0.18/0.41 cnf(i_0_154, negated_conjecture, (forename(skc6,skc9)=true)). % 0.18/0.41 cnf(i_0_155, negated_conjecture, (mia_forename(skc6,skc9)=true)). % 0.18/0.41 cnf(i_0_151, negated_conjecture, (woman(skc6,skc10)=true)). % 0.18/0.41 cnf(i_0_157, negated_conjecture, (accessible_world(skc6,skc8)=true)). % 0.18/0.41 cnf(i_0_159, negated_conjecture, (present(skc6,skc7)=true)). % 0.18/0.41 cnf(i_0_152, negated_conjecture, (present(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_161, negated_conjecture, (agent(skc6,skc7,skc10)=true)). % 0.18/0.41 cnf(i_0_162, negated_conjecture, (agent(skc8,skc11,skc10)=true)). % 0.18/0.41 cnf(i_0_163, negated_conjecture, (theme(skc6,skc7,skc8)=true)). % 0.18/0.41 cnf(i_0_160, negated_conjecture, (of(skc6,skc9,skc10)=true)). % 0.18/0.41 cnf(i_0_85, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_86, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_87, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_88, plain, (ifeq2(dance(X1,X2),true,event(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_89, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_90, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_95, plain, (ifeq2(desire_want(X1,X2),true,event(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_104, plain, (ifeq2(mia_forename(X1,X2),true,forename(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_96, plain, (ifeq2(proposition(X1,X2),true,relation(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_102, plain, (ifeq2(forename(X1,X2),true,relname(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_105, plain, (ifeq2(woman(X1,X2),true,human_person(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_92, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_115, plain, (ifeq2(woman(X1,X2),true,female(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_93, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_94, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_91, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_97, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_98, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_101, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_99, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_100, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_103, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_106, plain, (ifeq2(human_person(X1,X2),true,organism(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_113, plain, (ifeq2(human_person(X1,X2),true,human(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_114, plain, (ifeq2(human_person(X1,X2),true,animate(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_107, plain, (ifeq2(organism(X1,X2),true,entity(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_111, plain, (ifeq2(organism(X1,X2),true,impartial(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_112, plain, (ifeq2(organism(X1,X2),true,living(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_108, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_109, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_110, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_116, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(dance(X1,X3),true,dance(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_117, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(event(X1,X3),true,event(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_165, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_167, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_164, plain, (ifeq(tuple(unisex(X1,X2),female(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_166, plain, (ifeq(tuple(nonhuman(X1,X# Satisfiable branch found. % 0.18/0.41 # There were 1 total branch saturation attempts. % 0.18/0.41 # There were 0 of these attempts blocked. % 0.18/0.41 # There were 0 deferred branch saturation attempts. % 0.18/0.41 # There were 0 free duplicated saturations. % 0.18/0.41 # There were 0 total successful branch saturations. % 0.18/0.41 # There were 0 successful branch saturations in interreduction. % 0.18/0.41 # There were 0 successful branch saturations on the branch. % 0.18/0.41 # There were 0 successful branch saturations after the branch. % 0.18/0.41 2),human(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_118, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(eventuality(X1,X3),true,eventuality(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_119, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(thing(X1,X3),true,thing(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_125, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(desire_want(X1,X3),true,desire_want(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_126, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(proposition(X1,X3),true,proposition(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_131, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(forename(X1,X3),true,forename(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_133, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(mia_forename(X1,X3),true,mia_forename(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_134, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(woman(X1,X3),true,woman(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_120, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(singleton(X1,X3),true,singleton(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_124, plain, (ifeq2(present(X1,X2),true,ifeq2(accessible_world(X1,X3),true,present(X3,X2),true),true)=true)). % 0.18/0.41 cnf(i_0_121, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(specific(X1,X3),true,specific(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_122, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonexistent(X1,X3),true,nonexistent(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_123, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(unisex(X1,X3),true,unisex(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_127, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relation(X1,X3),true,relation(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_128, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(abstraction(X1,X3),true,abstraction(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_129, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonhuman(X1,X3),true,nonhuman(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_130, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(general(X1,X3),true,general(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_132, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relname(X1,X3),true,relname(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_135, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human_person(X1,X3),true,human_person(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_136, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(organism(X1,X3),true,organism(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_137, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(entity(X1,X3),true,entity(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_138, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(existent(X1,X3),true,existent(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_139, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(impartial(X1,X3),true,impartial(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_140, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(living(X1,X3),true,living(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_141, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human(X1,X3),true,human(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_142, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(animate(X1,X3),true,animate(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_143, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(female(X1,X3),true,female(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_144, plain, (ifeq2(agent(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,agent(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_145, plain, (ifeq2(theme(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,theme(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_146, plain, (ifeq2(of(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,of(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_147, 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)). % 0.18/0.41 cnf(i_0_148, 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)). % 0.18/0.41 cnf(i_0_168, negated_conjecture, (a!=b)). % 0.18/0.41 cnf(i_0_185, plain, (X6=X6)). % 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.41 # Begin printing tableau % 0.18/0.41 # Found 7 steps % 0.18/0.41 cnf(i_0_185, plain, (true=true), inference(start_rule)). % 0.18/0.41 cnf(i_0_310, plain, (true=true), inference(extension_rule, [i_0_189])). % 0.18/0.41 cnf(i_0_320, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_321, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_322, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_318, plain, (ifeq3(true,actual_world(skc6),actual_world(skc6),actual_world(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_188])). % 0.18/0.41 cnf(i_0_329, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_85])). % 0.18/0.41 # End printing tableau % 0.18/0.41 # SZS output end % 0.18/0.41 # Branches closed with saturation will be marked with an "s" % 0.18/0.41 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # Begin clausification derivation % 0.18/0.41 % 0.18/0.41 # End clausification derivation % 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.41 cnf(i_0_149, negated_conjecture, (actual_world(skc6)=true)). % 0.18/0.41 cnf(i_0_153, negated_conjecture, (dance(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_150, negated_conjecture, (event(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_158, negated_conjecture, (desire_want(skc6,skc7)=true)). % 0.18/0.41 cnf(i_0_156, negated_conjecture, (proposition(skc6,skc8)=true)). % 0.18/0.41 cnf(i_0_154, negated_conjecture, (forename(skc6,skc9)=true)). % 0.18/0.41 cnf(i_0_155, negated_conjecture, (mia_forename(skc6,skc9)=true)). % 0.18/0.41 cnf(i_0_151, negated_conjecture, (woman(skc6,skc10)=true)). % 0.18/0.41 cnf(i_0_157, negated_conjecture, (accessible_world(skc6,skc8)=true)). % 0.18/0.41 cnf(i_0_159, negated_conjecture, (present(skc6,skc7)=true)). % 0.18/0.41 cnf(i_0_152, negated_conjecture, (present(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_161, negated_conjecture, (agent(skc6,skc7,skc10)=true)). % 0.18/0.41 cnf(i_0_162, negated_conjecture, (agent(skc8,skc11,skc10)=true)). % 0.18/0.41 cnf(i_0_163, negated_conjecture, (theme(skc6,skc7,skc8)=true)). % 0.18/0.41 cnf(i_0_160, negated_conjecture, (of(skc6,skc9,skc10)=true)). % 0.18/0.41 cnf(i_0_85, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_86, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_87, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_88, plain, (ifeq2(dance(X1,X2),true,event(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_89, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_90, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_95, plain, (ifeq2(desire_want(X1,X2),true,event(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_104, plain, (ifeq2(mia_forename(X1,X2),true,forename(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_96, plain, (ifeq2(proposition(X1,X2),true,relation(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_102, plain, (ifeq2(forename(X1,X2),true,relname(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_105, plain, (ifeq2(woman(X1,X2),true,human_person(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_92, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_115, plain, (ifeq2(woman(X1,X2),true,female(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_93, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_94, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_91, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_97, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_98, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_101, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_99, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_100, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_103, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_106, plain, (ifeq2(human_person(X1,X2),true,organism(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_113, plain, (ifeq2(human_person(X1,X2),true,human(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_114, plain, (ifeq2(human_person(X1,X2),true,animate(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_107, plain, (ifeq2(organism(X1,X2),true,entity(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_111, plain, (ifeq2(organism(X1,X2),true,impartial(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_112, plain, (ifeq2(organism(X1,X2),true,living(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_108, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_109, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_110, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_116, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(dance(X1,X3),true,dance(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_117, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(event(X1,X3),true,event(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_165, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_167, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_164, plain, (ifeq(tuple(unisex(X1,X2),female(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_166, plain, (ifeq(tuple(nonhuman(X1,X2),human(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_118, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(eventuality(X1,X3),true,eventuality(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_119, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(thing(X1,X3),true,thing(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_125, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(desire_want(X1,X3),true,desire_want(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_126, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(proposition(X1,X3),true,proposition(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_131, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(forename(X1,X3),true,forename(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_133, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(mia_forename(X1,X3),true,mia_forename(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_134, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(woman(X1,X3),true,woman(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_120, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(singleton(X1,X3),true,singleton(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_124, plain, (ifeq2(present(X1,X2),true,ifeq2(accessible_world(X1,X3),true,present(X3,X2),true),true)=true)). % 0.18/0.41 cnf(i_0_121, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(specific(X1,X3),true,specific(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_122, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonexistent(X1,X3),true,nonexistent(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_123, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(unisex(X1,X3),true,unisex(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_127, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relation(X1,X3),true,relation(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_128, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(abstraction(X1,X3),true,abstraction(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_129, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonhuman(X1,X3),true,nonhuman(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_130, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(general(X1,X3),true,general(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_132, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relname(X1,X3),true,relname(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_135, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human_person(X1,X3),true,human_person(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_136, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(organism(X1,X3),true,organism(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_137, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(entity(X1,X3),true,entity(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_138, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(existent(X1,X3),true,existent(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_139, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(impartial(X1,X3),true,impartial(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_140, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(living(X1,X3),true,living(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_141, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human(X1,X3),true,human(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_142, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(animate(X1,X3),true,animate(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_143, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(female(X1,X3),true,female(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_144, plain, (ifeq2(agent(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,agent(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_145, plain, (ifeq2(theme(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,theme(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_146, plain, (ifeq2(of(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,of(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_147, 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)). % 0.18/0.41 cnf(i_0_148, 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)). % 0.18/0.41 cnf(i_0_168, negated_conjecture, (a!=b)). % 0.18/0.41 cnf(i_0_185, plain, (X6=X6)). % 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.41 # Begin printing tableau % 0.18/0.41 # Found 7 steps % 0.18/0.41 cnf(i_0_185, plain, (true=true), inference(start_rule)). % 0.18/0.41 cnf(i_0_310, plain, (true=true), inference(extension_rule, [i_0_189])). % 0.18/0.41 cnf(i_0_320, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_321, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_322, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_318, plain, (ifeq3(true,actual_world(skc6),actual_world(skc6),actual_world(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_188])). % 0.18/0.41 cnf(i_0_329, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_85])). % 0.18/0.41 # End printing tableau % 0.18/0.41 # SZS output end % 0.18/0.41 # Branches closed with saturation will be marked with an "s" % 0.18/0.41 # Satisfiable branch found. % 0.18/0.41 # There were 1 total branch saturation attempts. % 0.18/0.41 # There were 0 of these attempts blocked. % 0.18/0.41 # There were 0 deferred branch saturation attempts. % 0.18/0.41 # There were 0 free duplicated saturations. % 0.18/0.41 # There were 0 total successful branch saturations. % 0.18/0.41 # There were 0 successful branch saturations in interreduction. % 0.18/0.41 # There were 0 successful branch saturations on the branch. % 0.18/0.41 # There were 0 successful branch saturations after the branch. % 0.18/0.41 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # Begin clausification derivation % 0.18/0.41 % 0.18/0.41 # End clausification derivation % 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.41 cnf(i_0_149, negated_conjecture, (actual_world(skc6)=true)). % 0.18/0.41 cnf(i_0_153, negated_conjecture, (dance(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_150, negated_conjecture, (event(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_158, negated_conjecture, (desire_want(skc6,skc7)=true)). % 0.18/0.41 cnf(i_0_156, negated_conjecture, (proposition(skc6,skc8)=true)). % 0.18/0.41 cnf(i_0_154, negated_conjecture, (forename(skc6,skc9)=true)). % 0.18/0.41 cnf(i_0_155, negated_conjecture, (mia_forename(skc6,skc9)=true)). % 0.18/0.41 cnf(i_0_151, negated_conjecture, (woman(skc6,skc10)=true)). % 0.18/0.41 cnf(i_0_157, negated_conjecture, (accessible_world(skc6,skc8)=true)). % 0.18/0.41 cnf(i_0_159, negated_conjecture, (present(skc6,skc7)=true)). % 0.18/0.41 cnf(i_0_152, negated_conjecture, (present(skc8,skc11)=true)). % 0.18/0.41 cnf(i_0_161, negated_conjecture, (agent(skc6,skc7,skc10)=true)). % 0.18/0.41 cnf(i_0_162, negated_conjecture, (agent(skc8,skc11,skc10)=true)). % 0.18/0.41 cnf(i_0_163, negated_conjecture, (theme(skc6,skc7,skc8)=true)). % 0.18/0.41 cnf(i_0_160, negated_conjecture, (of(skc6,skc9,skc10)=true)). % 0.18/0.41 cnf(i_0_85, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_86, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_87, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.18/0.41 cnf(i_0_88, plain, (ifeq2(dance(X1,X2),true,event(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_89, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_90, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_95, plain, (ifeq2(desire_want(X1,X2),true,event(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_104, plain, (ifeq2(mia_forename(X1,X2),true,forename(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_96, plain, (ifeq2(proposition(X1,X2),true,relation(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_102, plain, (ifeq2(forename(X1,X2),true,relname(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_105, plain, (ifeq2(woman(X1,X2),true,human_person(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_92, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_115, plain, (ifeq2(woman(X1,X2),true,female(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_93, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_94, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_91, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_97, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_98, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_101, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_99, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_100, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_103, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_106, plain, (ifeq2(human_person(X1,X2),true,organism(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_113, plain, (ifeq2(human_person(X1,X2),true,human(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_114, plain, (ifeq2(human_person(X1,X2),true,animate(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_107, plain, (ifeq2(organism(X1,X2),true,entity(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_111, plain, (ifeq2(organism(X1,X2),true,impartial(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_112, plain, (ifeq2(organism(X1,X2),true,living(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_108, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_109, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_110, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.18/0.41 cnf(i_0_116, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(dance(X1,X3),true,dance(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_117, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(event(X1,X3),true,event(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_165, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_167, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_164, plain, (ifeq(tuple(unisex(X1,X2),female(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_166, plain, (ifeq(tuple(nonhuman(X1,X2),human(X1,X2)),tuple(true,true),a,b)=b)). % 0.18/0.41 cnf(i_0_118, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(eventuality(X1,X3),true,eventuality(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_119, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(thing(X1,X3),true,thing(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_125, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(desire_want(X1,X3),true,desire_want(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_126, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(proposition(X1,X3),true,proposition(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_131, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(forename(X1,X3),true,forename(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_133, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(mia_forename(X1,X3),true,mia_forename(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_134, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(woman(X1,X3),true,woman(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_120, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(singleton(X1,X3),true,singleton(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_124, plain, (ifeq2(present(X1,X2),true,ifeq2(accessible_world(X1,X3),true,present(X3,X2),true),true)=true)). % 0.18/0.41 cnf(i_0_121, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(specific(X1,X3),true,specific(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_122, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonexistent(X1,X3),true,nonexistent(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_123, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(unisex(X1,X3),true,unisex(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_127, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relation(X1,X3),true,relation(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_128, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(abstraction(X1,X3),true,abstraction(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_129, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(nonhuman(X1,X3),true,nonhuman(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_130, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(general(X1,X3),true,general(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_132, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(relname(X1,X3),true,relname(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_135, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human_person(X1,X3),true,human_person(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_136, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(organism(X1,X3),true,organism(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_137, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(entity(X1,X3),true,entity(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_138, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(existent(X1,X3),true,existent(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_139, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(impartial(X1,X3),true,impartial(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_140, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(living(X1,X3),true,living(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_141, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(human(X1,X3),true,human(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_142, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(animate(X1,X3),true,animate(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_143, plain, (ifeq2(accessible_world(X1,X2),true,ifeq2(female(X1,X3),true,female(X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_144, plain, (ifeq2(agent(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,agent(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_145, plain, (ifeq2(theme(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,theme(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_146, plain, (ifeq2(of(X1,X2,X3),true,ifeq2(accessible_world(X1,X4),true,of(X4,X2,X3),true),true)=true)). % 0.18/0.41 cnf(i_0_147, 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)). % 0.18/0.41 cnf(i_0_148, 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)). % 0.18/0.41 cnf(i_0_168, negated_conjecture, (a!=b)). % 0.18/0.41 cnf(i_0_185, plain, (X6=X6)). % 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.41 # Begin printing tableau % 0.18/0.41 # Found 7 steps % 0.18/0.41 cnf(i_0_185, plain, (true=true), inference(start_rule)). % 0.18/0.41 cnf(i_0_310, plain, (true=true), inference(extension_rule, [i_0_189])). % 0.18/0.41 cnf(i_0_320, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_321, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_322, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_318, plain, (ifeq3(true,actual_world(skc6),actual_world(skc6),actual_world(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_188])). % 0.18/0.41 cnf(i_0_329, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_85])). % 0.18/0.41 # End printing tableau % 0.18/0.41 # SZS output end % 0.18/0.41 # Branches closed with saturation will be marked with an "s" % 0.18/0.41 # Creating equality axioms % 0.18/0.41 # Ran out of tableaux, making start rules for all clauses % 0.18/0.41 # 16519 Satisfiable branch % 0.18/0.41 eau % 0.18/0.41 # Found 7 steps % 0.18/0.41 cnf(i_0_185, plain, (true=true), inference(start_rule)). % 0.18/0.41 cnf(i_0_310, plain, (true=true), inference(extension_rule, [i_0_189])). % 0.18/0.41 cnf(i_0_320, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_321, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_322, plain, (actual_world(skc6)!=true), inference(closure_rule, [i_0_149])). % 0.18/0.41 cnf(i_0_318, plain, (ifeq3(true,actual_world(skc6),actual_world(skc6),actual_world(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_188])). % 0.18/0.41 cnf(i_0_329, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_85])). % 0.18/0.41 # End printing tableau % 0.18/0.41 # SZS output end % 0.18/0.41 # Branches closed with saturation will be marked with an "s" % 0.18/0.42 # Child (16514) has found a proof. % 0.18/0.42 % 0.18/0.42 # Proof search is over... % 0.18/0.42 # Freeing feature tree %------------------------------------------------------------------------------