%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP067-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 : n029.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:13 EDT 2022 % Result : Satisfiable 1.66s 0.62s % Output : CNFRefutation 1.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : NLP067-1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jul 1 00:06:23 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.13/0.36 # and selection function SelectNewComplexAHP. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 40 Number of unprocessed: 40 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 40 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 40 conjectures. % 0.13/0.36 # There are 40 start rule candidates: % 0.13/0.36 # Found 2 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 40 start rule tableaux created. % 0.13/0.36 # 38 extension rule candidate clauses % 0.13/0.36 # 2 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 1.66/0.62 # 21926 Satisfiable branch % 1.66/0.62 # Satisfiable branch found. % 1.66/0.62 # There were 1 total branch saturation attempts. % 1.66/0.62 # There were 0 of these attempts blocked. % 1.66/0.62 # There were 0 deferred branch saturation attempts. % 1.66/0.62 # There were 0 free duplicated saturations. % 1.66/0.62 # There were 0 total successful branch saturations. % 1.66/0.62 # There were 0 successful branch saturations in interreduction. % 1.66/0.62 # There were 0 successful branch saturations on the branch. % 1.66/0.62 # There were 0 successful branch saturations after the branch. % 1.66/0.62 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.66/0.62 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.66/0.62 # Begin clausification derivation % 1.66/0.62 % 1.66/0.62 # End clausification derivation % 1.66/0.62 # Begin listing active clauses obtained from FOF to CNF conversion % 1.66/0.62 cnf(i_0_41, negated_conjecture, (actual_world(skc46))). % 1.66/0.62 cnf(i_0_42, negated_conjecture, (actual_world(skc4))). % 1.66/0.62 cnf(i_0_49, negated_conjecture, (ssSkP0(skc5,skc4)|~ssSkC0)). % 1.66/0.62 cnf(i_0_45, negated_conjecture, (ssSkP1(skc47,skc46)|ssSkC0)). % 1.66/0.62 cnf(i_0_47, negated_conjecture, (group(skc4,skc5)|~ssSkC0)). % 1.66/0.62 cnf(i_0_43, negated_conjecture, (group(skc46,skc47)|ssSkC0)). % 1.66/0.62 cnf(i_0_44, negated_conjecture, (six(skc46,skc47)|ssSkC0)). % 1.66/0.62 cnf(i_0_48, negated_conjecture, (six(skc4,skc5)|~ssSkC0)). % 1.66/0.62 cnf(i_0_50, negated_conjecture, (male(skc4,skc5)|~ssSkC0)). % 1.66/0.62 cnf(i_0_46, negated_conjecture, (male(skc46,skc47)|ssSkC0)). % 1.66/0.62 cnf(i_0_59, negated_conjecture, (shot(skc4,X1)|~member(skc4,X1,skc5)|~ssSkC0)). % 1.66/0.62 cnf(i_0_58, negated_conjecture, (shot(skc46,X1)|ssSkC0|~member(skc46,X1,skc47))). % 1.66/0.62 cnf(i_0_53, negated_conjecture, (cannon(X1,skf19(X1,X2))|ssSkP1(X3,X1))). % 1.66/0.62 cnf(i_0_51, negated_conjecture, (cannon(X1,skf12(X1,X2))|ssSkP0(X3,X1))). % 1.66/0.62 cnf(i_0_52, negated_conjecture, (man(X1,skf14(X1,X2))|ssSkP0(X3,X1))). % 1.66/0.62 cnf(i_0_57, negated_conjecture, (of(X1,skf19(X1,X2),X2)|ssSkP1(X2,X1))). % 1.66/0.62 cnf(i_0_56, negated_conjecture, (member(X1,skf19(X1,X2),X2)|ssSkP1(X2,X1))). % 1.66/0.62 cnf(i_0_54, negated_conjecture, (of(X1,skf12(X1,X2),X2)|ssSkP0(X2,X1))). % 1.66/0.62 cnf(i_0_55, negated_conjecture, (member(X1,skf12(X1,X2),X2)|ssSkP0(X2,X1))). % 1.66/0.62 cnf(i_0_70, negated_conjecture, (~shot(X1,skf9(X1,X2))|~male(X1,X3)|~ssSkP1(X3,X1)|~six(X1,X3)|~group(X1,X3)|~ssSkC0|~actual_world(X1))). % 1.66/0.62 cnf(i_0_67, negated_conjecture, (ssSkC0|~shot(X1,skf21(X1,X2))|~ssSkP0(X3,X1)|~male(X1,X3)|~six(X1,X3)|~group(X1,X3)|~actual_world(X1))). % 1.66/0.62 cnf(i_0_71, negated_conjecture, (member(X1,skf9(X1,X2),X2)|~male(X1,X2)|~ssSkP1(X2,X1)|~six(X1,X2)|~group(X1,X2)|~ssSkC0|~actual_world(X1))). % 1.66/0.62 cnf(i_0_60, negated_conjecture, (man(X1,skf16(X1,X2))|~member(X1,X3,X4)|~of(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))). % 1.66/0.62 cnf(i_0_68, negated_conjecture, (member(X1,skf21(X1,X2),X2)|ssSkC0|~ssSkP0(X2,X1)|~male(X1,X2)|~six(X1,X2)|~group(X1,X2)|~actual_world(X1))). % 1.66/0.62 cnf(i_0_61, negated_conjecture, (fire(X1,skf15(X1,X2))|~member(X1,X3,X4)|~of(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))). % 1.66/0.62 cnf(i_0_62, negated_conjecture, (nonreflexive(X1,skf15(X1,X2))|~member(X1,X3,X4)|~of(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))). % 1.66/0.62 cnf(i_0_63, negated_conjecture, (present(X1,skf15(X1,X2))|~member(X1,X3,X4)|~of(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))). % 1.66/0.62 cnf(i_0_64, negated_conjecture, (event(X1,skf15(X1,X2))|~member(X1,X3,X4)|~of(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))). % 1.66/0.62 cnf(i_0_65, negated_conjecture, (patient(X1,skf15(X1,X2),X2)|~member(X1,X2,X3)|~of(X1,X2,X3)|~cannon(X1,X2)|~ssSkP1(X3,X1))). % 1.66/0.62 cnf(i_0_66, negated_conjecture, (from_loc(X1,skf15(X1,X2),X2)|~member(X1,X2,X3)|~of(X1,X2,X3)|~cannon(X1,X2)|~ssSkP1(X3,X1))). % 1.66/0.62 cnf(i_0_72, negated_conjecture, (fire(X1,skf10(X1,X2,X3))|~member(X1,X4,X5)|~of(X1,X4,X5)|~man(X1,X6)|~cannon(X1,X4)|~ssSkP0(X5,X1))). % 1.66/0.62 cnf(i_0_73, negated_conjecture, (nonreflexive(X1,skf10(X1,X2,X3))|~member(X1,X4,X5)|~of(X1,X4,X5)|~man(X1,X6)|~cannon(X1,X4)|~ssSkP0(X5,X1))). % 1.66/0.62 cnf(i_0_74, negated_conjecture, (present(X1,skf10(X1,X2,X3))|~member(X1,X4,X5)|~of(X1,X4,X5)|~man(X1,X6)|~cannon(X1,X4)|~ssSkP0(X5,X1))). % 1.66/0.62 cnf(i_0_69, negated_conjecture, (agent(X1,skf15(X1,X2),skf16(X1,X2))|~member(X1,X3,X4)|~of(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))). % 1.66/0.62 cnf(i_0_75, negated_conjecture, (event(X1,skf10(X1,X2,X3))|~member(X1,X4,X5)|~of(X1,X4,X5)|~man(X1,X6)|~cannon(X1,X4)|~ssSkP0(X5,X1))). % 1.66/0.62 cnf(i_0_76, negated_conjecture, (patient(X1,skf10(X1,X2,X3),X3)|~member(X1,X3,X4)|~of(X1,X3,X4)|~man(X1,X2)|~cannon(X1,X3)|~ssSkP0(X4,X1))). % 1.66/0.62 cnf(i_0_78, negated_conjecture, (from_loc(X1,skf10(X1,X2,X3),X3)|~member(X1,X3,X4)|~of(X1,X3,X4)|~man(X1,X2)|~cannon(X1,X3)|~ssSkP0(X4,X1))). % 1.66/0.62 cnf(i_0_77, negated_conjecture, (agent(X1,skf10(X1,X2,X3),X2)|~member(X1,X4,X5)|~of(X1,X4,X5)|~man(X1,X2)|~cannon(X1,X4)|~ssSkP0(X5,X1))). % 1.66/0.62 cnf(i_0_80, negated_conjecture, (ssSkP1(X1,X2)|~agent(X2,X3,X4)|~from_loc(X2,X3,skf19(X2,X5))|~patient(X2,X3,skf19(X2,X5))|~event(X2,X3)|~present(X2,X3)|~nonreflexive(X2,X3)|~fire(X2,X3)|~man(X2,X4))). % 1.66/0.62 cnf(i_0_79, negated_conjecture, (ssSkP0(X1,X2)|~agent(X2,X3,skf14(X2,X4))|~from_loc(X2,X3,skf12(X2,X4))|~patient(X2,X3,skf12(X2,X4))|~event(X2,X3)|~present(X2,X3)|~nonreflexive(X2,X3)|~fire(X2,X3))). % 1.66/0.62 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.66/0.62 # Begin printing tableau % 1.66/0.62 # Found 18 steps % 1.66/0.62 cnf(i_0_66, negated_conjecture, (from_loc(skc46,skf15(skc46,skf12(skc46,skc47)),skf12(skc46,skc47))|~member(skc46,skf12(skc46,skc47),skc47)|~of(skc46,skf12(skc46,skc47),skc47)|~cannon(skc46,skf12(skc46,skc47))|~ssSkP1(skc47,skc46)), inference(start_rule)). % 1.66/0.62 cnf(i_0_145, plain, (from_loc(skc46,skf15(skc46,skf12(skc46,skc47)),skf12(skc46,skc47))), inference(closure_rule, [i_0_0])). % 1.66/0.62 cnf(i_0_146, plain, (~member(skc46,skf12(skc46,skc47),skc47)), inference(closure_rule, [i_0_0])). % 1.66/0.62 cnf(i_0_147, plain, (~of(skc46,skf12(skc46,skc47),skc47)), inference(extension_rule, [i_0_54])). % 1.66/0.62 cnf(i_0_38575, plain, (ssSkP0(skc47,skc46)), inference(extension_rule, [i_0_74])). % 1.66/0.62 cnf(i_0_38580, plain, (present(skc46,skf10(skc46,X8,X9))), inference(extension_rule, [i_0_80])). % 1.66/0.62 cnf(i_0_38582, plain, (~of(skc46,skf19(skc46,skc47),skc47)), inference(extension_rule, [i_0_57])). % 1.66/0.62 cnf(i_0_38583, plain, (~man(skc46,skf16(skc46,X7))), inference(extension_rule, [i_0_60])). % 1.66/0.62 cnf(i_0_38584, plain, (~cannon(skc46,skf19(skc46,skc47))), inference(extension_rule, [i_0_53])). % 1.66/0.62 cnf(i_0_38581, plain, (~member(skc46,skf19(skc46,skc47),skc47)), inference(extension_rule, [i_0_56])). % 1.66/0.62 cnf(i_0_148, plain, (~cannon(skc46,skf12(skc46,skc47))), inference(extension_rule, [i_0_51])). % 1.66/0.62 cnf(i_0_39688, plain, (ssSkP0(X4,skc46)), inference(extension_rule, [i_0_73])). % 1.66/0.62 cnf(i_0_39693, plain, (nonreflexive(skc46,skf10(skc46,X18,X19))), inference(extension_rule, [i_0_80])). % 1.66/0.62 cnf(i_0_39695, plain, (~of(skc46,skf19(skc46,X4),X4)), inference(extension_rule, [i_0_57])). % 1.66/0.62 cnf(i_0_39696, plain, (~man(skc46,skf16(skc46,X17))), inference(extension_rule, [i_0_60])). % 1.66/0.62 cnf(i_0_39697, plain, (~cannon(skc46,skf19(skc46,X4))), inference(extension_rule, [i_0_53])). % 1.66/0.62 cnf(i_0_39694, plain, (~member(skc46,skf19(skc46,X4),X4)), inference(extension_rule, [i_0_56])). % 1.66/0.62 cnf(i_0_149, plain, (~ssSkP1(skc47,skc46)), inference(extension_rule, [i_0_45])). % 1.66/0.62 # End printing tableau % 1.66/0.62 # SZS output end % 1.66/0.62 # Branches closed with saturation will be marked with an "s" % 1.66/0.62 # Child (21926) has found a proof. % 1.66/0.62 % 1.66/0.62 # Proof search is over... % 1.66/0.62 # Freeing feature tree %------------------------------------------------------------------------------