%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP060-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 : n008.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:08 EDT 2022 % Result : Satisfiable 0.19s 0.54s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NLP060-1 : TPTP v8.1.0. Released v2.4.0. % 0.13/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 : n008.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 03:04:08 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI % 0.13/0.37 # and selection function SelectCQArNTNpEqFirst. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 40 Number of unprocessed: 40 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 40 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 40 conjectures. % 0.13/0.38 # There are 40 start rule candidates: % 0.13/0.38 # Found 2 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 40 start rule tableaux created. % 0.13/0.38 # 38 extension rule candidate clauses % 0.13/0.38 # 2 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.19/0.54 # 13979 Satisfiable branch % 0.19/0.54 # Satisfiable branch found. % 0.19/0.54 # There were 1 total branch saturation attempts. % 0.19/0.54 # There were 0 of these attempts blocked. % 0.19/0.54 # There were 0 deferred branch saturation attempts. % 0.19/0.54 # There were 0 free duplicated saturations. % 0.19/0.54 # There were 0 total successful branch saturations. % 0.19/0.54 # There were 0 successful branch saturations in interreduction. % 0.19/0.54 # There were 0 successful branch saturations on the branch. % 0.19/0.54 # There were 0 successful branch saturations after the branch. % 0.19/0.54 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.54 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.54 # Begin clausification derivation % 0.19/0.54 % 0.19/0.54 # End clausification derivation % 0.19/0.54 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.54 cnf(i_0_41, negated_conjecture, (actual_world(skc61))). % 0.19/0.54 cnf(i_0_42, negated_conjecture, (actual_world(skc6))). % 0.19/0.54 cnf(i_0_50, negated_conjecture, (ssSkP0(skc7,skc8,skc6)|~ssSkC0)). % 0.19/0.54 cnf(i_0_46, negated_conjecture, (six(skc6,skc7)|~ssSkC0)). % 0.19/0.54 cnf(i_0_47, negated_conjecture, (group(skc6,skc7)|~ssSkC0)). % 0.19/0.54 cnf(i_0_43, negated_conjecture, (six(skc61,skc62)|ssSkC0)). % 0.19/0.54 cnf(i_0_44, negated_conjecture, (group(skc61,skc62)|ssSkC0)). % 0.19/0.54 cnf(i_0_48, negated_conjecture, (male(skc6,skc8)|~ssSkC0)). % 0.19/0.54 cnf(i_0_45, negated_conjecture, (male(skc61,skc63)|ssSkC0)). % 0.19/0.54 cnf(i_0_49, negated_conjecture, (ssSkP1(skc63,skc62,skc61)|ssSkC0)). % 0.19/0.54 cnf(i_0_52, negated_conjecture, (shot(skc6,X1)|~member(skc6,X1,skc7)|~ssSkC0)). % 0.19/0.54 cnf(i_0_51, negated_conjecture, (shot(skc61,X1)|ssSkC0|~member(skc61,X1,skc62))). % 0.19/0.54 cnf(i_0_55, negated_conjecture, (man(X1,skf26(X1,X2,X3))|ssSkP1(X4,X5,X1))). % 0.19/0.54 cnf(i_0_54, negated_conjecture, (man(X1,skf18(X1,X2,X3))|ssSkP0(X4,X5,X1))). % 0.19/0.54 cnf(i_0_53, negated_conjecture, (cannon(X1,skf16(X1,X2,X3))|ssSkP0(X4,X5,X1))). % 0.19/0.54 cnf(i_0_58, negated_conjecture, (member(X1,skf23(X2,X1,X3),X2)|ssSkP1(X4,X2,X1))). % 0.19/0.54 cnf(i_0_56, negated_conjecture, (member(X1,skf14(X2,X1,X3),X2)|ssSkP0(X2,X4,X1))). % 0.19/0.54 cnf(i_0_57, negated_conjecture, (of(X1,skf16(X1,X2,X3),X2)|ssSkP0(X4,X2,X1))). % 0.19/0.54 cnf(i_0_71, negated_conjecture, (~shot(X1,skf11(X1,X2))|~ssSkP1(X3,X4,X1)|~male(X1,X3)|~group(X1,X4)|~six(X1,X4)|~ssSkC0|~actual_world(X1))). % 0.19/0.54 cnf(i_0_69, negated_conjecture, (ssSkC0|~shot(X1,skf28(X1,X2))|~ssSkP0(X3,X4,X1)|~male(X1,X4)|~group(X1,X3)|~six(X1,X3)|~actual_world(X1))). % 0.19/0.54 cnf(i_0_70, negated_conjecture, (member(X1,skf11(X1,X2),X2)|~ssSkP1(X3,X2,X1)|~male(X1,X3)|~group(X1,X2)|~six(X1,X2)|~ssSkC0|~actual_world(X1))). % 0.19/0.54 cnf(i_0_68, negated_conjecture, (member(X1,skf28(X1,X2),X2)|ssSkC0|~ssSkP0(X2,X3,X1)|~male(X1,X3)|~group(X1,X2)|~six(X1,X2)|~actual_world(X1))). % 0.19/0.54 cnf(i_0_63, negated_conjecture, (cannon(X1,skf20(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))). % 0.19/0.54 cnf(i_0_59, negated_conjecture, (event(X1,skf19(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))). % 0.19/0.54 cnf(i_0_60, negated_conjecture, (present(X1,skf19(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))). % 0.19/0.54 cnf(i_0_61, negated_conjecture, (nonreflexive(X1,skf19(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))). % 0.19/0.54 cnf(i_0_62, negated_conjecture, (fire(X1,skf19(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))). % 0.19/0.54 cnf(i_0_64, negated_conjecture, (of(X1,skf20(X1,X2,X3,X4),X2)|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X2,X7,X1))). % 0.19/0.54 cnf(i_0_65, negated_conjecture, (agent(X1,skf19(X1,X2,X3,X4),X2)|~man(X1,X2)|~member(X1,X5,X6)|~ssSkP1(X7,X6,X1))). % 0.19/0.54 cnf(i_0_66, negated_conjecture, (patient(X1,skf19(X1,X2,X3,X4),X3)|~man(X1,X2)|~member(X1,X3,X5)|~ssSkP1(X6,X5,X1))). % 0.19/0.54 cnf(i_0_74, negated_conjecture, (event(X1,skf12(X1,X2,X3,X4))|~of(X1,X5,X6)|~man(X1,X7)|~cannon(X1,X5)|~member(X1,X8,X9)|~ssSkP0(X9,X6,X1))). % 0.19/0.54 cnf(i_0_73, negated_conjecture, (present(X1,skf12(X1,X2,X3,X4))|~of(X1,X5,X6)|~man(X1,X7)|~cannon(X1,X5)|~member(X1,X8,X9)|~ssSkP0(X9,X6,X1))). % 0.19/0.54 cnf(i_0_72, negated_conjecture, (nonreflexive(X1,skf12(X1,X2,X3,X4))|~of(X1,X5,X6)|~man(X1,X7)|~cannon(X1,X5)|~member(X1,X8,X9)|~ssSkP0(X9,X6,X1))). % 0.19/0.54 cnf(i_0_75, negated_conjecture, (fire(X1,skf12(X1,X2,X3,X4))|~of(X1,X5,X6)|~man(X1,X7)|~cannon(X1,X5)|~member(X1,X8,X9)|~ssSkP0(X9,X6,X1))). % 0.19/0.54 cnf(i_0_76, negated_conjecture, (agent(X1,skf12(X1,X2,X3,X4),X2)|~of(X1,X5,X6)|~man(X1,X2)|~cannon(X1,X5)|~member(X1,X7,X8)|~ssSkP0(X8,X6,X1))). % 0.19/0.54 cnf(i_0_78, negated_conjecture, (patient(X1,skf12(X1,X2,X3,X4),X4)|~of(X1,X3,X5)|~man(X1,X2)|~cannon(X1,X3)|~member(X1,X4,X6)|~ssSkP0(X6,X5,X1))). % 0.19/0.54 cnf(i_0_77, negated_conjecture, (from_loc(X1,skf12(X1,X2,X3,X4),X3)|~of(X1,X3,X5)|~man(X1,X2)|~cannon(X1,X3)|~member(X1,X6,X7)|~ssSkP0(X7,X5,X1))). % 0.19/0.54 cnf(i_0_67, negated_conjecture, (from_loc(X1,skf19(X1,X2,X3,X4),skf20(X1,X4,X3,X2))|~man(X1,X2)|~member(X1,X3,X5)|~ssSkP1(X4,X5,X1))). % 0.19/0.54 cnf(i_0_80, negated_conjecture, (ssSkP1(X1,X2,X3)|~from_loc(X3,X4,X5)|~patient(X3,X4,skf23(X2,X3,X1))|~agent(X3,X4,skf26(X3,X2,X1))|~fire(X3,X4)|~nonreflexive(X3,X4)|~present(X3,X4)|~event(X3,X4)|~of(X3,X5,X1)|~cannon(X3,X5))). % 0.19/0.54 cnf(i_0_79, negated_conjecture, (ssSkP0(X1,X2,X3)|~from_loc(X3,X4,skf16(X3,X2,X1))|~patient(X3,X4,skf14(X1,X3,X2))|~agent(X3,X4,skf18(X3,X2,X1))|~fire(X3,X4)|~nonreflexive(X3,X4)|~present(X3,X4)|~event(X3,X4))). % 0.19/0.54 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.54 # Begin printing tableau % 0.19/0.54 # Found 26 steps % 0.19/0.54 cnf(i_0_79, negated_conjecture, (ssSkP0(skc7,skc8,skc6)|~from_loc(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)),skf16(skc6,skc8,skc7))|~patient(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)),skf14(skc7,skc6,skc8))|~agent(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)),skf18(skc6,skc8,skc7))|~fire(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)))|~nonreflexive(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)))|~present(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)))|~event(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)))), inference(start_rule)). % 0.19/0.54 cnf(i_0_81, plain, (ssSkP0(skc7,skc8,skc6)), inference(closure_rule, [i_0_0])). % 0.19/0.54 cnf(i_0_82, plain, (~from_loc(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)),skf16(skc6,skc8,skc7))), inference(extension_rule, [i_0_77])). % 0.19/0.54 cnf(i_0_580, plain, (~of(skc6,skf16(skc6,skc8,skc7),skc8)), inference(extension_rule, [i_0_57])). % 0.19/0.54 cnf(i_0_704, plain, (ssSkP0(X18,skc8,skc6)), inference(extension_rule, [i_0_78])). % 0.19/0.54 cnf(i_0_581, plain, (~man(skc6,skf18(skc6,skc8,skc7))), inference(extension_rule, [i_0_54])). % 0.19/0.54 cnf(i_0_852, plain, (ssSkP0(X28,X26,skc6)), inference(extension_rule, [i_0_76])). % 0.19/0.54 cnf(i_0_582, plain, (~cannon(skc6,skf16(skc6,skc8,skc7))), inference(extension_rule, [i_0_53])). % 0.19/0.54 cnf(i_0_992, plain, (ssSkP0(X37,X34,skc6)), inference(extension_rule, [i_0_75])). % 0.19/0.54 cnf(i_0_584, plain, (~ssSkP0(X40,skc8,skc6)), inference(extension_rule, [i_0_56])). % 0.19/0.54 cnf(i_0_2055, plain, (member(skc6,skf14(X40,skc6,X39),X40)), inference(extension_rule, [i_0_67])). % 0.19/0.54 cnf(i_0_583, plain, (~member(skc6,skf23(X40,skc6,X7),X40)), inference(extension_rule, [i_0_58])). % 0.19/0.54 cnf(i_0_2146, plain, (ssSkP1(X41,X40,skc6)), inference(extension_rule, [i_0_66])). % 0.19/0.54 cnf(i_0_83, plain, (~patient(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)),skf14(skc7,skc6,skc8))), inference(extension_rule, [i_0_78])). % 0.19/0.54 cnf(i_0_2282, plain, (~of(skc6,skf16(skc6,skc8,skc7),skc8)), inference(extension_rule, [i_0_57])). % 0.19/0.54 cnf(i_0_2388, plain, (ssSkP0(X49,skc8,skc6)), inference(extension_rule, [i_0_72])). % 0.19/0.54 cnf(i_0_2283, plain, (~man(skc6,skf18(skc6,skc8,skc7))), inference(extension_rule, [i_0_54])). % 0.19/0.54 cnf(i_0_2500, plain, (ssSkP0(X57,X54,skc6)), inference(extension_rule, [i_0_73])). % 0.19/0.54 cnf(i_0_2284, plain, (~cannon(skc6,skf16(skc6,skc8,skc7))), inference(extension_rule, [i_0_53])). % 0.19/0.54 cnf(i_0_2612, plain, (ssSkP0(X66,X63,skc6)), inference(extension_rule, [i_0_74])). % 0.19/0.54 cnf(i_0_2285, plain, (~member(skc6,skf14(skc7,skc6,skc8),skc7)), inference(extension_rule, [i_0_56])). % 0.19/0.54 cnf(i_0_2746, plain, (ssSkP0(skc7,X51,skc6)), inference(extension_rule, [i_0_69])). % 0.19/0.54 cnf(i_0_2791, plain, (~actual_world(skc6)), inference(closure_rule, [i_0_42])). % 0.19/0.54 cnf(i_0_2286, plain, (~ssSkP0(skc7,skc8,skc6)), inference(extension_rule, [i_0_50])). % 0.19/0.54 cnf(i_0_2860, plain, (~ssSkC0), inference(extension_rule, [i_0_51])). % 0.19/0.54 cnf(i_0_84, plain, (~agent(skc6,skf12(skc6,skf18(skc6,skc8,skc7),skf16(skc6,skc8,skc7),skf14(skc7,skc6,skc8)),skf18(skc6,skc8,skc7))), inference(extension_rule, [i_0_76])). % 0.19/0.54 # End printing tableau % 0.19/0.54 # SZS output end % 0.19/0.54 # Branches closed with saturation will be marked with an "s" % 0.19/0.54 # Child (13979) has found a proof. % 0.19/0.54 % 0.19/0.54 # Proof search is over... % 0.19/0.54 # Freeing feature tree %------------------------------------------------------------------------------