%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP249-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n003.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:25 EDT 2022 % Result : Satisfiable 0.12s 0.41s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : NLP249-1 : TPTP v8.1.0. Released v2.4.0. % 0.12/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.33 % Computer : n003.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.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Fri Jul 1 12:22:22 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 110 Number of unprocessed: 110 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 110 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 39 conjectures. % 0.12/0.37 # There are 39 start rule candidates: % 0.12/0.37 # Found 35 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 39 start rule tableaux created. % 0.12/0.37 # 75 extension rule candidate clauses % 0.12/0.37 # 35 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.41 # 16471 Satisfiable branch % 0.12/0.41 # Satisfiable branch found. % 0.12/0.41 # There were 1 total branch saturation attempts. % 0.12/0.41 # There were 0 of these attempts blocked. % 0.12/0.41 # There were 0 deferred branch saturation attempts. % 0.12/0.41 # There were 0 free duplicated saturations. % 0.12/0.41 # There were 0 total successful branch saturations. % 0.12/0.41 # There were 0 successful branch saturations in interreduction. % 0.12/0.41 # There were 0 successful branch saturations on the branch. % 0.12/0.41 # There were 0 successful branch saturations after the branch. % 0.12/0.41 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.41 # Begin clausification derivation % 0.12/0.41 % 0.12/0.41 # End clausification derivation % 0.12/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.41 cnf(i_0_182, negated_conjecture, (actual_world(skc13))). % 0.12/0.41 cnf(i_0_191, negated_conjecture, (smoke(skc14,skc21))). % 0.12/0.41 cnf(i_0_196, negated_conjecture, (event(skc13,skc17))). % 0.12/0.41 cnf(i_0_201, negated_conjecture, (event(skc13,skc15))). % 0.12/0.41 cnf(i_0_186, negated_conjecture, (event(skc14,skc21))). % 0.12/0.41 cnf(i_0_204, negated_conjecture, (proposition(skc13,skc14))). % 0.12/0.41 cnf(i_0_203, negated_conjecture, (proposition(skc13,skc16))). % 0.12/0.41 cnf(i_0_206, negated_conjecture, (state(skc13,skc24))). % 0.12/0.41 cnf(i_0_185, negated_conjecture, (man(skc13,skc25))). % 0.12/0.41 cnf(i_0_189, negated_conjecture, (man(skc13,skc19))). % 0.12/0.41 cnf(i_0_184, negated_conjecture, (forename(skc13,skc26))). % 0.12/0.41 cnf(i_0_187, negated_conjecture, (forename(skc13,skc20))). % 0.12/0.41 cnf(i_0_193, negated_conjecture, (forename(skc13,skc22))). % 0.12/0.41 cnf(i_0_194, negated_conjecture, (forename(skc13,skc18))). % 0.12/0.41 cnf(i_0_188, negated_conjecture, (vincent_forename(skc13,skc20))). % 0.12/0.41 cnf(i_0_195, negated_conjecture, (vincent_forename(skc13,skc18))). % 0.12/0.41 cnf(i_0_183, negated_conjecture, (jules_forename(skc13,skc26))). % 0.12/0.41 cnf(i_0_192, negated_conjecture, (jules_forename(skc13,skc22))). % 0.12/0.41 cnf(i_0_205, negated_conjecture, (accessible_world(skc13,skc14))). % 0.12/0.41 cnf(i_0_202, negated_conjecture, (accessible_world(skc13,skc16))). % 0.12/0.41 cnf(i_0_197, negated_conjecture, (present(skc13,skc17))). % 0.12/0.41 cnf(i_0_200, negated_conjecture, (present(skc13,skc15))). % 0.12/0.41 cnf(i_0_190, negated_conjecture, (present(skc14,skc21))). % 0.12/0.41 cnf(i_0_198, negated_conjecture, (think_believe_consider(skc13,skc17))). % 0.12/0.41 cnf(i_0_199, negated_conjecture, (think_believe_consider(skc13,skc15))). % 0.12/0.41 cnf(i_0_211, negated_conjecture, (agent(skc13,skc17,skc19))). % 0.12/0.41 cnf(i_0_212, negated_conjecture, (agent(skc13,skc15,skc19))). % 0.12/0.41 cnf(i_0_213, negated_conjecture, (agent(skc14,skc21,skc19))). % 0.12/0.41 cnf(i_0_214, negated_conjecture, (theme(skc13,skc17,skc16))). % 0.12/0.41 cnf(i_0_215, negated_conjecture, (theme(skc13,skc15,skc14))). % 0.12/0.41 cnf(i_0_207, negated_conjecture, (of(skc13,skc26,skc25))). % 0.12/0.41 cnf(i_0_209, negated_conjecture, (of(skc13,skc20,skc19))). % 0.12/0.41 cnf(i_0_208, negated_conjecture, (of(skc13,skc22,skc19))). % 0.12/0.41 cnf(i_0_210, negated_conjecture, (of(skc13,skc18,skc19))). % 0.12/0.41 cnf(i_0_216, negated_conjecture, (be(skc13,skc24,skc25,skc25))). % 0.12/0.41 cnf(i_0_142, plain, (~general(X1,X2)|~specific(X1,X2))). % 0.12/0.41 cnf(i_0_144, plain, (~existent(X1,X2)|~nonexistent(X1,X2))). % 0.12/0.41 cnf(i_0_141, plain, (~male(X1,X2)|~unisex(X1,X2))). % 0.12/0.41 cnf(i_0_143, plain, (~human(X1,X2)|~nonhuman(X1,X2))). % 0.12/0.41 cnf(i_0_111, plain, (event(X1,X2)|~smoke(X1,X2))). % 0.12/0.41 cnf(i_0_125, plain, (event(X1,X2)|~state(X1,X2))). % 0.12/0.41 cnf(i_0_124, plain, (eventuality(X1,X2)|~state(X1,X2))). % 0.12/0.41 cnf(i_0_138, plain, (relation(X1,X2)|~relname(X1,X2))). % 0.12/0.41 cnf(i_0_119, plain, (abstraction(X1,X2)|~relation(X1,X2))). % 0.12/0.41 cnf(i_0_128, plain, (entity(X1,X2)|~organism(X1,X2))). % 0.12/0.41 cnf(i_0_139, plain, (forename(X1,X2)|~vincent_forename(X1,X2))). % 0.12/0.41 cnf(i_0_140, plain, (forename(X1,X2)|~jules_forename(X1,X2))). % 0.12/0.41 cnf(i_0_112, plain, (eventuality(X1,X2)|~event(X1,X2))). % 0.12/0.41 cnf(i_0_145, plain, (X1=X2|~be(X3,X4,X1,X2))). % 0.12/0.41 cnf(i_0_113, plain, (thing(X1,X2)|~eventuality(X1,X2))). % 0.12/0.41 cnf(i_0_120, plain, (thing(X1,X2)|~abstraction(X1,X2))). % 0.12/0.41 cnf(i_0_129, plain, (thing(X1,X2)|~entity(X1,X2))). % 0.12/0.41 cnf(i_0_114, plain, (singleton(X1,X2)|~thing(X1,X2))). % 0.12/0.41 cnf(i_0_115, plain, (specific(X1,X2)|~eventuality(X1,X2))). % 0.12/0.41 cnf(i_0_130, plain, (specific(X1,X2)|~entity(X1,X2))). % 0.12/0.41 cnf(i_0_116, plain, (nonexistent(X1,X2)|~eventuality(X1,X2))). % 0.12/0.41 cnf(i_0_117, plain, (unisex(X1,X2)|~eventuality(X1,X2))). % 0.12/0.41 cnf(i_0_217, negated_conjecture, (smoke(skc16,skf1(X1))|~man(skc16,X2))). % 0.12/0.41 cnf(i_0_219, negated_conjecture, (event(skc16,skf1(X1))|~man(skc16,X2))). % 0.12/0.41 cnf(i_0_218, negated_conjecture, (present(skc16,skf1(X1))|~man(skc16,X2))). % 0.12/0.41 cnf(i_0_123, plain, (unisex(X1,X2)|~abstraction(X1,X2))). % 0.12/0.41 cnf(i_0_118, plain, (relation(X1,X2)|~proposition(X1,X2))). % 0.12/0.41 cnf(i_0_121, plain, (nonhuman(X1,X2)|~abstraction(X1,X2))). % 0.12/0.41 cnf(i_0_122, plain, (general(X1,X2)|~abstraction(X1,X2))). % 0.12/0.41 cnf(i_0_126, plain, (human_person(X1,X2)|~man(X1,X2))). % 0.12/0.41 cnf(i_0_127, plain, (organism(X1,X2)|~human_person(X1,X2))). % 0.12/0.41 cnf(i_0_136, plain, (male(X1,X2)|~man(X1,X2))). % 0.12/0.41 cnf(i_0_220, negated_conjecture, (agent(skc16,skf1(X1),X1)|~man(skc16,X1))). % 0.12/0.41 cnf(i_0_137, plain, (relname(X1,X2)|~forename(X1,X2))). % 0.12/0.41 cnf(i_0_131, plain, (existent(X1,X2)|~entity(X1,X2))). % 0.12/0.41 cnf(i_0_132, plain, (impartial(X1,X2)|~organism(X1,X2))). % 0.12/0.41 cnf(i_0_133, plain, (living(X1,X2)|~organism(X1,X2))). % 0.12/0.41 cnf(i_0_134, plain, (human(X1,X2)|~human_person(X1,X2))). % 0.12/0.41 cnf(i_0_135, plain, (animate(X1,X2)|~human_person(X1,X2))). % 0.12/0.41 cnf(i_0_146, plain, (smoke(X1,X2)|~accessible_world(X3,X1)|~smoke(X3,X2))). % 0.12/0.41 cnf(i_0_147, plain, (event(X1,X2)|~accessible_world(X3,X1)|~event(X3,X2))). % 0.12/0.41 cnf(i_0_148, plain, (eventuality(X1,X2)|~accessible_world(X3,X1)|~eventuality(X3,X2))). % 0.12/0.41 cnf(i_0_156, plain, (proposition(X1,X2)|~accessible_world(X3,X1)|~proposition(X3,X2))). % 0.12/0.41 cnf(i_0_161, plain, (state(X1,X2)|~accessible_world(X3,X1)|~state(X3,X2))). % 0.12/0.41 cnf(i_0_162, plain, (man(X1,X2)|~accessible_world(X3,X1)|~man(X3,X2))). % 0.12/0.41 cnf(i_0_172, plain, (forename(X1,X2)|~accessible_world(X3,X1)|~forename(X3,X2))). % 0.12/0.41 cnf(i_0_174, plain, (vincent_forename(X1,X2)|~accessible_world(X3,X1)|~vincent_forename(X3,X2))). % 0.12/0.41 cnf(i_0_149, plain, (thing(X1,X2)|~accessible_world(X3,X1)|~thing(X3,X2))). % 0.12/0.41 cnf(i_0_175, plain, (jules_forename(X1,X2)|~accessible_world(X3,X1)|~jules_forename(X3,X2))). % 0.12/0.41 cnf(i_0_150, plain, (singleton(X1,X2)|~accessible_world(X3,X1)|~singleton(X3,X2))). % 0.12/0.41 cnf(i_0_151, plain, (specific(X1,X2)|~accessible_world(X3,X1)|~specific(X3,X2))). % 0.12/0.41 cnf(i_0_152, plain, (nonexistent(X1,X2)|~accessible_world(X3,X1)|~nonexistent(X3,X2))). % 0.12/0.41 cnf(i_0_153, plain, (unisex(X1,X2)|~accessible_world(X3,X1)|~unisex(X3,X2))). % 0.12/0.41 cnf(i_0_154, plain, (present(X1,X2)|~present(X3,X2)|~accessible_world(X3,X1))). % 0.12/0.41 cnf(i_0_155, plain, (think_believe_consider(X1,X2)|~think_believe_consider(X3,X2)|~accessible_world(X3,X1))). % 0.12/0.41 cnf(i_0_157, plain, (relation(X1,X2)|~accessible_world(X3,X1)|~relation(X3,X2))). % 0.12/0.41 cnf(i_0_158, plain, (abstraction(X1,X2)|~accessible_world(X3,X1)|~abstraction(X3,X2))). % 0.12/0.41 cnf(i_0_159, plain, (nonhuman(X1,X2)|~accessible_world(X3,X1)|~nonhuman(X3,X2))). % 0.12/0.41 cnf(i_0_160, plain, (general(X1,X2)|~accessible_world(X3,X1)|~general(X3,X2))). % 0.12/0.41 cnf(i_0_163, plain, (human_person(X1,X2)|~accessible_world(X3,X1)|~human_person(X3,X2))). % 0.12/0.41 cnf(i_0_164, plain, (organism(X1,X2)|~accessible_world(X3,X1)|~organism(X3,X2))). % 0.12/0.41 cnf(i_0_165, plain, (entity(X1,X2)|~accessible_world(X3,X1)|~entity(X3,X2))). % 0.12/0.41 cnf(i_0_166, plain, (existent(X1,X2)|~accessible_world(X3,X1)|~existent(X3,X2))). % 0.12/0.41 cnf(i_0_167, plain, (impartial(X1,X2)|~accessible_world(X3,X1)|~impartial(X3,X2))). % 0.12/0.41 cnf(i_0_168, plain, (living(X1,X2)|~accessible_world(X3,X1)|~living(X3,X2))). % 0.12/0.41 cnf(i_0_169, plain, (human(X1,X2)|~accessible_world(X3,X1)|~human(X3,X2))). % 0.12/0.41 cnf(i_0_170, plain, (animate(X1,X2)|~accessible_world(X3,X1)|~animate(X3,X2))). % 0.12/0.41 cnf(i_0_171, plain, (male(X1,X2)|~accessible_world(X3,X1)|~male(X3,X2))). % 0.12/0.41 cnf(i_0_173, plain, (relname(X1,X2)|~accessible_world(X3,X1)|~relname(X3,X2))). % 0.12/0.41 cnf(i_0_176, plain, (agent(X1,X2,X3)|~agent(X4,X2,X3)|~accessible_world(X4,X1))). % 0.12/0.41 cnf(i_0_177, plain, (theme(X1,X2,X3)|~theme(X4,X2,X3)|~accessible_world(X4,X1))). % 0.12/0.41 cnf(i_0_178, plain, (of(X1,X2,X3)|~of(X4,X2,X3)|~accessible_world(X4,X1))). % 0.12/0.41 cnf(i_0_179, plain, (be(X1,X2,X3,X4)|~accessible_world(X5,X1)|~be(X5,X2,X3,X4))). % 0.12/0.41 cnf(i_0_180, plain, (X1=X2|~of(X3,X2,X4)|~of(X3,X1,X4)|~forename(X3,X2)|~forename(X3,X1)|~entity(X3,X4))). % 0.12/0.41 cnf(i_0_181, plain, (X1=X2|~theme(X3,X4,X2)|~theme(X3,X5,X1)|~agent(X3,X4,X6)|~agent(X3,X5,X6)|~think_believe_consider(X3,X4)|~think_believe_consider(X3,X5)|~proposition(X3,X2)|~proposition(X3,X1))). % 0.12/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.41 # Begin printing tableau % 0.12/0.41 # Found 7 steps % 0.12/0.41 cnf(i_0_217, negated_conjecture, (smoke(skc16,skf1(X1))|~man(skc16,skc19)), inference(start_rule)). % 0.12/0.41 cnf(i_0_227, plain, (smoke(skc16,skf1(X1))), inference(extension_rule, [i_0_111])). % 0.12/0.41 cnf(i_0_272, plain, (event(skc16,skf1(X1))), inference(extension_rule, [i_0_112])). % 0.12/0.41 cnf(i_0_296, plain, (eventuality(skc16,skf1(X1))), inference(extension_rule, [i_0_113])). % 0.12/0.41 cnf(i_0_228, plain, (~man(skc16,skc19)), inference(extension_rule, [i_0_162])). % 0.12/0.41 cnf(i_0_404, plain, (~accessible_world(skc13,skc16)), inference(closure_rule, [i_0_202])). % 0.12/0.41 cnf(i_0_405, plain, (~man(skc13,skc19)), inference(closure_rule, [i_0_189])). % 0.12/0.41 # End printing tableau % 0.12/0.41 # SZS output end % 0.12/0.41 # Branches closed with saturation will be marked with an "s" % 0.12/0.41 # Child (16471) has found a proof. % 0.12/0.41 % 0.12/0.41 # Proof search is over... % 0.12/0.41 # Freeing feature tree %------------------------------------------------------------------------------