%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP072-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 : n015.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:12:16 EDT 2022 % Result : Satisfiable 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : NLP072-1 : TPTP v8.1.0. Released v2.4.0. % 0.04/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.34 % Computer : n015.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 05:38:12 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 81 Number of unprocessed: 81 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 81 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 12 conjectures. % 0.20/0.38 # There are 12 start rule candidates: % 0.20/0.38 # Found 5 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 12 start rule tableaux created. % 0.20/0.38 # 76 extension rule candidate clauses % 0.20/0.38 # 5 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # 16585 Satisfiable branch % 0.20/0.39 # Satisfiable branch found. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 0 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 0 successful branch saturations after the branch. % 0.20/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_151, negated_conjecture, (actual_world(skc3))). % 0.20/0.39 cnf(i_0_153, negated_conjecture, (group(skc3,skc4))). % 0.20/0.39 cnf(i_0_154, negated_conjecture, (six(skc3,skc4))). % 0.20/0.39 cnf(i_0_152, negated_conjecture, (male(skc3,skc5))). % 0.20/0.39 cnf(i_0_82, plain, (~member(X1,X2,X2))). % 0.20/0.39 cnf(i_0_155, negated_conjecture, (shot(skc3,X1)|~member(skc3,X1,skc4))). % 0.20/0.39 cnf(i_0_83, plain, (action(X1,X2)|~shot(X1,X2))). % 0.20/0.39 cnf(i_0_95, plain, (event(X1,X2)|~fire(X1,X2))). % 0.20/0.39 cnf(i_0_117, plain, (~multiple(X1,X2)|~singleton(X1,X2))). % 0.20/0.39 cnf(i_0_119, plain, (~existent(X1,X2)|~nonexistent(X1,X2))). % 0.20/0.39 cnf(i_0_116, plain, (~male(X1,X2)|~unisex(X1,X2))). % 0.20/0.39 cnf(i_0_94, plain, (group(X1,X2)|~six(X1,X2))). % 0.20/0.39 cnf(i_0_115, plain, (male(X1,X2)|~man(X1,X2))). % 0.20/0.39 cnf(i_0_118, plain, (~living(X1,X2)|~nonliving(X1,X2))). % 0.20/0.39 cnf(i_0_120, plain, (~animate(X1,X2)|~nonliving(X1,X2))). % 0.20/0.39 cnf(i_0_85, plain, (event(X1,X2)|~act(X1,X2))). % 0.20/0.39 cnf(i_0_84, plain, (act(X1,X2)|~action(X1,X2))). % 0.20/0.39 cnf(i_0_86, plain, (eventuality(X1,X2)|~event(X1,X2))). % 0.20/0.39 cnf(i_0_100, plain, (object(X1,X2)|~artifact(X1,X2))). % 0.20/0.39 cnf(i_0_101, plain, (entity(X1,X2)|~object(X1,X2))). % 0.20/0.39 cnf(i_0_110, plain, (entity(X1,X2)|~organism(X1,X2))). % 0.20/0.39 cnf(i_0_109, plain, (organism(X1,X2)|~human_person(X1,X2))). % 0.20/0.39 cnf(i_0_92, plain, (set(X1,X2)|~group(X1,X2))). % 0.20/0.39 cnf(i_0_96, plain, (weapon(X1,X2)|~cannon(X1,X2))). % 0.20/0.39 cnf(i_0_108, plain, (human_person(X1,X2)|~man(X1,X2))). % 0.20/0.39 cnf(i_0_131, plain, (skf18(X1,X2)!=skf20(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_130, plain, (skf16(X1,X2)!=skf20(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_87, plain, (thing(X1,X2)|~eventuality(X1,X2))). % 0.20/0.39 cnf(i_0_102, plain, (thing(X1,X2)|~entity(X1,X2))). % 0.20/0.39 cnf(i_0_135, plain, (skf16(X1,X2)!=skf18(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_129, plain, (skf14(X1,X2)!=skf20(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_134, plain, (skf14(X1,X2)!=skf18(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_138, plain, (skf14(X1,X2)!=skf16(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_88, plain, (singleton(X1,X2)|~thing(X1,X2))). % 0.20/0.39 cnf(i_0_128, plain, (skf12(X1,X2)!=skf20(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_133, plain, (skf12(X1,X2)!=skf18(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_137, plain, (skf12(X1,X2)!=skf16(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_140, plain, (skf12(X1,X2)!=skf14(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_89, plain, (specific(X1,X2)|~eventuality(X1,X2))). % 0.20/0.39 cnf(i_0_103, plain, (specific(X1,X2)|~entity(X1,X2))). % 0.20/0.39 cnf(i_0_127, plain, (skf10(X1,X2)!=skf20(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_132, plain, (skf10(X1,X2)!=skf18(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_136, plain, (skf10(X1,X2)!=skf16(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_139, plain, (skf10(X1,X2)!=skf14(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_90, plain, (nonexistent(X1,X2)|~eventuality(X1,X2))). % 0.20/0.39 cnf(i_0_141, plain, (skf10(X1,X2)!=skf12(X1,X2)|~six(X2,X1))). % 0.20/0.39 cnf(i_0_91, plain, (unisex(X1,X2)|~eventuality(X1,X2))). % 0.20/0.39 cnf(i_0_107, plain, (unisex(X1,X2)|~object(X1,X2))). % 0.20/0.39 cnf(i_0_93, plain, (multiple(X1,X2)|~set(X1,X2))). % 0.20/0.39 cnf(i_0_97, plain, (weaponry(X1,X2)|~weapon(X1,X2))). % 0.20/0.39 cnf(i_0_98, plain, (instrumentality(X1,X2)|~weaponry(X1,X2))). % 0.20/0.39 cnf(i_0_99, plain, (artifact(X1,X2)|~instrumentality(X1,X2))). % 0.20/0.39 cnf(i_0_104, plain, (existent(X1,X2)|~entity(X1,X2))). % 0.20/0.39 cnf(i_0_105, plain, (nonliving(X1,X2)|~object(X1,X2))). % 0.20/0.39 cnf(i_0_106, plain, (impartial(X1,X2)|~object(X1,X2))). % 0.20/0.39 cnf(i_0_111, plain, (impartial(X1,X2)|~organism(X1,X2))). % 0.20/0.39 cnf(i_0_112, plain, (living(X1,X2)|~organism(X1,X2))). % 0.20/0.39 cnf(i_0_113, plain, (human(X1,X2)|~human_person(X1,X2))). % 0.20/0.39 cnf(i_0_114, plain, (animate(X1,X2)|~human_person(X1,X2))). % 0.20/0.39 cnf(i_0_142, plain, (~agent(X1,X2,X3)|~patient(X1,X2,X3)|~nonreflexive(X1,X2))). % 0.20/0.39 cnf(i_0_121, plain, (member(X1,skf20(X2,X1),X2)|~six(X1,X2))). % 0.20/0.39 cnf(i_0_122, plain, (member(X1,skf18(X2,X1),X2)|~six(X1,X2))). % 0.20/0.39 cnf(i_0_123, plain, (member(X1,skf16(X2,X1),X2)|~six(X1,X2))). % 0.20/0.39 cnf(i_0_124, plain, (member(X1,skf14(X2,X1),X2)|~six(X1,X2))). % 0.20/0.39 cnf(i_0_125, plain, (member(X1,skf12(X2,X1),X2)|~six(X1,X2))). % 0.20/0.39 cnf(i_0_126, plain, (member(X1,skf10(X2,X1),X2)|~six(X1,X2))). % 0.20/0.39 cnf(i_0_160, negated_conjecture, (patient(skc3,skf8(X1,X2,X3),X3)|~of(skc3,X2,skc5)|~man(skc3,X1)|~cannon(skc3,X2)|~member(skc3,X3,skc4))). % 0.20/0.39 cnf(i_0_156, negated_conjecture, (event(skc3,skf8(X1,X2,X3))|~of(skc3,X4,skc5)|~man(skc3,X5)|~cannon(skc3,X4)|~member(skc3,X6,skc4))). % 0.20/0.39 cnf(i_0_159, negated_conjecture, (fire(skc3,skf8(X1,X2,X3))|~of(skc3,X4,skc5)|~man(skc3,X5)|~cannon(skc3,X4)|~member(skc3,X6,skc4))). % 0.20/0.39 cnf(i_0_158, negated_conjecture, (nonreflexive(skc3,skf8(X1,X2,X3))|~of(skc3,X4,skc5)|~man(skc3,X5)|~cannon(skc3,X4)|~member(skc3,X6,skc4))). % 0.20/0.39 cnf(i_0_157, negated_conjecture, (present(skc3,skf8(X1,X2,X3))|~of(skc3,X4,skc5)|~man(skc3,X5)|~cannon(skc3,X4)|~member(skc3,X6,skc4))). % 0.20/0.39 cnf(i_0_143, plain, (X1=skf10(X2,X3)|X1=skf12(X2,X3)|X1=skf14(X2,X3)|X1=skf16(X2,X3)|X1=skf18(X2,X3)|X1=skf20(X2,X3)|~six(X3,X2)|~member(X3,X1,X2))). % 0.20/0.39 cnf(i_0_161, negated_conjecture, (from_loc(skc3,skf8(X1,X2,X3),X2)|~of(skc3,X2,skc5)|~man(skc3,X1)|~cannon(skc3,X2)|~member(skc3,X4,skc4))). % 0.20/0.39 cnf(i_0_162, negated_conjecture, (agent(skc3,skf8(X1,X2,X3),X1)|~of(skc3,X4,skc5)|~man(skc3,X1)|~cannon(skc3,X4)|~member(skc3,X5,skc4))). % 0.20/0.39 cnf(i_0_150, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X1=X6|X2=X3|X2=X4|X2=X5|X2=X6|X3=X4|X3=X5|X3=X6|X4=X5|X4=X6|X5=X6|six(X7,X8)|skf21(X1,X2,X3,X4,X5,X6,X9,X10)!=X6|~member(X7,X6,X8)|~member(X7,X5,X8)|~member(X7,X4,X8)|~member(X7,X3,X8)|~member(X7,X2,X8)|~member(X7,X1,X8))). % 0.20/0.39 cnf(i_0_149, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X1=X6|X2=X3|X2=X4|X2=X5|X2=X6|X3=X4|X3=X5|X3=X6|X4=X5|X4=X6|X5=X6|six(X7,X8)|member(X7,skf21(X1,X2,X3,X4,X5,X6,X8,X7),X8)|~member(X7,X6,X8)|~member(X7,X5,X8)|~member(X7,X4,X8)|~member(X7,X3,X8)|~member(X7,X2,X8)|~member(X7,X1,X8))). % 0.20/0.39 cnf(i_0_144, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X1=X6|X2=X3|X2=X4|X2=X5|X2=X6|X3=X4|X3=X5|X3=X6|X4=X5|X4=X6|X5=X6|six(X7,X8)|skf21(X1,X2,X3,X4,X5,X9,X10,X11)!=X5|~member(X7,X6,X8)|~member(X7,X5,X8)|~member(X7,X4,X8)|~member(X7,X3,X8)|~member(X7,X2,X8)|~member(X7,X1,X8))). % 0.20/0.39 cnf(i_0_145, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X1=X6|X2=X3|X2=X4|X2=X5|X2=X6|X3=X4|X3=X5|X3=X6|X4=X5|X4=X6|X5=X6|six(X7,X8)|skf21(X1,X2,X3,X4,X9,X10,X11,X12)!=X4|~member(X7,X6,X8)|~member(X7,X5,X8)|~member(X7,X4,X8)|~member(X7,X3,X8)|~member(X7,X2,X8)|~member(X7,X1,X8))). % 0.20/0.39 cnf(i_0_146, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X1=X6|X2=X3|X2=X4|X2=X5|X2=X6|X3=X4|X3=X5|X3=X6|X4=X5|X4=X6|X5=X6|six(X7,X8)|skf21(X1,X2,X3,X9,X10,X11,X12,X13)!=X3|~member(X7,X6,X8)|~member(X7,X5,X8)|~member(X7,X4,X8)|~member(X7,X3,X8)|~member(X7,X2,X8)|~member(X7,X1,X8))). % 0.20/0.39 cnf(i_0_147, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X1=X6|X2=X3|X2=X4|X2=X5|X2=X6|X3=X4|X3=X5|X3=X6|X4=X5|X4=X6|X5=X6|six(X7,X8)|skf21(X1,X2,X9,X10,X11,X12,X13,X14)!=X2|~member(X7,X6,X8)|~member(X7,X5,X8)|~member(X7,X4,X8)|~member(X7,X3,X8)|~member(X7,X2,X8)|~member(X7,X1,X8))). % 0.20/0.39 cnf(i_0_148, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X1=X6|X2=X3|X2=X4|X2=X5|X2=X6|X3=X4|X3=X5|X3=X6|X4=X5|X4=X6|X5=X6|six(X7,X8)|skf21(X1,X9,X10,X11,X12,X13,X14,X15)!=X1|~member(X7,X6,X8)|~member(X7,X5,X8)|~member(X7,X4,X8)|~member(X7,X3,X8)|~member(X7,X2,X8)|~member(X7,X1,X8))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 6 steps % 0.20/0.39 cnf(i_0_155, negated_conjecture, (shot(skc3,skf20(skc4,skc3))|~member(skc3,skf20(skc4,skc3),skc4)), inference(start_rule)). % 0.20/0.39 cnf(i_0_198, plain, (shot(skc3,skf20(skc4,skc3))), inference(extension_rule, [i_0_83])). % 0.20/0.39 cnf(i_0_204, plain, (action(skc3,skf20(skc4,skc3))), inference(extension_rule, [i_0_84])). % 0.20/0.39 cnf(i_0_224, plain, (act(skc3,skf20(skc4,skc3))), inference(extension_rule, [i_0_85])). % 0.20/0.39 cnf(i_0_199, plain, (~member(skc3,skf20(skc4,skc3),skc4)), inference(extension_rule, [i_0_121])). % 0.20/0.39 cnf(i_0_348, plain, (~six(skc3,skc4)), inference(closure_rule, [i_0_154])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # 16579 Satisfiable branch % 0.20/0.39 # 16580 Satisfiable branch % 0.20/0.40 # Child (16585) has found a proof. % 0.20/0.40 % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------