%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP059-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 : n005.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 3.89s 0.85s % Output : CNFRefutation 3.89s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : NLP059-1 : TPTP v8.1.0. Released v2.4.0. % 0.06/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 : n005.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 : Thu Jun 30 23:41:22 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.12/0.36 # and selection function SelectNewComplexAHP. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 40 Number of unprocessed: 40 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 40 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 40 conjectures. % 0.12/0.36 # There are 40 start rule candidates: % 0.12/0.36 # Found 2 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 40 start rule tableaux created. % 0.12/0.36 # 38 extension rule candidate clauses % 0.12/0.36 # 2 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 3.89/0.84 # 20304 Satisfiable branch % 3.89/0.85 # Satisfiable branch found. % 3.89/0.85 # There were 1 total branch saturation attempts. % 3.89/0.85 # There were 0 of these attempts blocked. % 3.89/0.85 # There were 0 deferred branch saturation attempts. % 3.89/0.85 # There were 0 free duplicated saturations. % 3.89/0.85 # There were 0 total successful branch saturations. % 3.89/0.85 # There were 0 successful branch saturations in interreduction. % 3.89/0.85 # There were 0 successful branch saturations on the branch. % 3.89/0.85 # There were 0 successful branch saturations after the branch. % 3.89/0.85 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.89/0.85 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.89/0.85 # Begin clausification derivation % 3.89/0.85 % 3.89/0.85 # End clausification derivation % 3.89/0.85 # Begin listing active clauses obtained from FOF to CNF conversion % 3.89/0.85 cnf(i_0_41, negated_conjecture, (actual_world(skc50))). % 3.89/0.85 cnf(i_0_42, negated_conjecture, (actual_world(skc6))). % 3.89/0.85 cnf(i_0_50, negated_conjecture, (ssSkP0(skc7,skc8,skc6)|~ssSkC0)). % 3.89/0.85 cnf(i_0_46, negated_conjecture, (six(skc6,skc7)|~ssSkC0)). % 3.89/0.85 cnf(i_0_47, negated_conjecture, (group(skc6,skc7)|~ssSkC0)). % 3.89/0.85 cnf(i_0_43, negated_conjecture, (six(skc50,skc51)|ssSkC0)). % 3.89/0.85 cnf(i_0_44, negated_conjecture, (group(skc50,skc51)|ssSkC0)). % 3.89/0.85 cnf(i_0_48, negated_conjecture, (male(skc6,skc8)|~ssSkC0)). % 3.89/0.85 cnf(i_0_45, negated_conjecture, (male(skc50,skc52)|ssSkC0)). % 3.89/0.85 cnf(i_0_49, negated_conjecture, (ssSkP1(skc51,skc52,skc50)|ssSkC0)). % 3.89/0.85 cnf(i_0_52, negated_conjecture, (shot(skc6,X1)|~member(skc6,X1,skc7)|~ssSkC0)). % 3.89/0.85 cnf(i_0_51, negated_conjecture, (shot(skc50,X1)|ssSkC0|~member(skc50,X1,skc51))). % 3.89/0.85 cnf(i_0_55, negated_conjecture, (cannon(X1,skf19(X1,X2,X3))|ssSkP1(X4,X5,X1))). % 3.89/0.85 cnf(i_0_53, negated_conjecture, (cannon(X1,skf12(X1,X2,X3))|ssSkP0(X4,X5,X1))). % 3.89/0.85 cnf(i_0_54, negated_conjecture, (man(X1,skf14(X1,X2,X3))|ssSkP0(X4,X5,X1))). % 3.89/0.85 cnf(i_0_58, negated_conjecture, (member(X1,skf19(X1,X2,X3),X2)|ssSkP1(X2,X4,X1))). % 3.89/0.85 cnf(i_0_59, negated_conjecture, (of(X1,skf19(X1,X2,X3),X3)|ssSkP1(X2,X3,X1))). % 3.89/0.85 cnf(i_0_57, negated_conjecture, (member(X1,skf12(X1,X2,X3),X3)|ssSkP0(X3,X2,X1))). % 3.89/0.85 cnf(i_0_70, negated_conjecture, (~shot(X1,skf9(X1,X2))|~ssSkP1(X3,X4,X1)|~male(X1,X4)|~group(X1,X3)|~six(X1,X3)|~ssSkC0|~actual_world(X1))). % 3.89/0.85 cnf(i_0_67, negated_conjecture, (ssSkC0|~shot(X1,skf21(X1,X2))|~ssSkP0(X3,X4,X1)|~male(X1,X4)|~group(X1,X3)|~six(X1,X3)|~actual_world(X1))). % 3.89/0.85 cnf(i_0_56, negated_conjecture, (of(X1,skf12(X1,X2,X3),X2)|ssSkP0(X4,X2,X1))). % 3.89/0.85 cnf(i_0_71, negated_conjecture, (member(X1,skf9(X1,X2),X2)|~ssSkP1(X2,X3,X1)|~male(X1,X3)|~group(X1,X2)|~six(X1,X2)|~ssSkC0|~actual_world(X1))). % 3.89/0.85 cnf(i_0_60, negated_conjecture, (man(X1,skf16(X1,X2))|~of(X1,X3,X4)|~cannon(X1,X3)|~member(X1,X3,X5)|~ssSkP1(X5,X4,X1))). % 3.89/0.85 cnf(i_0_68, negated_conjecture, (member(X1,skf21(X1,X2),X2)|ssSkC0|~ssSkP0(X2,X3,X1)|~male(X1,X3)|~group(X1,X2)|~six(X1,X2)|~actual_world(X1))). % 3.89/0.85 cnf(i_0_61, negated_conjecture, (fire(X1,skf15(X1,X2))|~of(X1,X3,X4)|~cannon(X1,X3)|~member(X1,X3,X5)|~ssSkP1(X5,X4,X1))). % 3.89/0.85 cnf(i_0_62, negated_conjecture, (nonreflexive(X1,skf15(X1,X2))|~of(X1,X3,X4)|~cannon(X1,X3)|~member(X1,X3,X5)|~ssSkP1(X5,X4,X1))). % 3.89/0.85 cnf(i_0_63, negated_conjecture, (present(X1,skf15(X1,X2))|~of(X1,X3,X4)|~cannon(X1,X3)|~member(X1,X3,X5)|~ssSkP1(X5,X4,X1))). % 3.89/0.85 cnf(i_0_64, negated_conjecture, (event(X1,skf15(X1,X2))|~of(X1,X3,X4)|~cannon(X1,X3)|~member(X1,X3,X5)|~ssSkP1(X5,X4,X1))). % 3.89/0.85 cnf(i_0_65, negated_conjecture, (patient(X1,skf15(X1,X2),X2)|~of(X1,X2,X3)|~cannon(X1,X2)|~member(X1,X2,X4)|~ssSkP1(X4,X3,X1))). % 3.89/0.85 cnf(i_0_66, negated_conjecture, (from_loc(X1,skf15(X1,X2),X2)|~of(X1,X2,X3)|~cannon(X1,X2)|~member(X1,X2,X4)|~ssSkP1(X4,X3,X1))). % 3.89/0.85 cnf(i_0_72, negated_conjecture, (fire(X1,skf10(X1,X2,X3))|~of(X1,X4,X5)|~man(X1,X6)|~cannon(X1,X4)|~member(X1,X4,X7)|~ssSkP0(X7,X5,X1))). % 3.89/0.85 cnf(i_0_73, negated_conjecture, (nonreflexive(X1,skf10(X1,X2,X3))|~of(X1,X4,X5)|~man(X1,X6)|~cannon(X1,X4)|~member(X1,X4,X7)|~ssSkP0(X7,X5,X1))). % 3.89/0.85 cnf(i_0_74, negated_conjecture, (present(X1,skf10(X1,X2,X3))|~of(X1,X4,X5)|~man(X1,X6)|~cannon(X1,X4)|~member(X1,X4,X7)|~ssSkP0(X7,X5,X1))). % 3.89/0.85 cnf(i_0_69, negated_conjecture, (agent(X1,skf15(X1,X2),skf16(X1,X2))|~of(X1,X3,X4)|~cannon(X1,X3)|~member(X1,X3,X5)|~ssSkP1(X5,X4,X1))). % 3.89/0.85 cnf(i_0_75, negated_conjecture, (event(X1,skf10(X1,X2,X3))|~of(X1,X4,X5)|~man(X1,X6)|~cannon(X1,X4)|~member(X1,X4,X7)|~ssSkP0(X7,X5,X1))). % 3.89/0.85 cnf(i_0_76, negated_conjecture, (patient(X1,skf10(X1,X2,X3),X3)|~of(X1,X3,X4)|~man(X1,X2)|~cannon(X1,X3)|~member(X1,X3,X5)|~ssSkP0(X5,X4,X1))). % 3.89/0.85 cnf(i_0_78, negated_conjecture, (from_loc(X1,skf10(X1,X2,X3),X3)|~of(X1,X3,X4)|~man(X1,X2)|~cannon(X1,X3)|~member(X1,X3,X5)|~ssSkP0(X5,X4,X1))). % 3.89/0.85 cnf(i_0_77, negated_conjecture, (agent(X1,skf10(X1,X2,X3),X2)|~of(X1,X4,X5)|~man(X1,X2)|~cannon(X1,X4)|~member(X1,X4,X6)|~ssSkP0(X6,X5,X1))). % 3.89/0.85 cnf(i_0_80, negated_conjecture, (ssSkP1(X1,X2,X3)|~agent(X3,X4,X5)|~from_loc(X3,X4,skf19(X3,X6,X7))|~patient(X3,X4,skf19(X3,X6,X7))|~event(X3,X4)|~present(X3,X4)|~nonreflexive(X3,X4)|~fire(X3,X4)|~man(X3,X5))). % 3.89/0.85 cnf(i_0_79, negated_conjecture, (ssSkP0(X1,X2,X3)|~agent(X3,X4,skf14(X3,X5,X6))|~from_loc(X3,X4,skf12(X3,X6,X5))|~patient(X3,X4,skf12(X3,X6,X5))|~event(X3,X4)|~present(X3,X4)|~nonreflexive(X3,X4)|~fire(X3,X4))). % 3.89/0.85 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.89/0.85 # Begin printing tableau % 3.89/0.85 # Found 21 steps % 3.89/0.85 cnf(i_0_66, negated_conjecture, (from_loc(skc50,skf15(skc50,skf19(skc50,skc51,skc52)),skf19(skc50,skc51,skc52))|~of(skc50,skf19(skc50,skc51,skc52),skc52)|~cannon(skc50,skf19(skc50,skc51,skc52))|~member(skc50,skf19(skc50,skc51,skc52),skc51)|~ssSkP1(skc51,skc52,skc50)), inference(start_rule)). % 3.89/0.85 cnf(i_0_145, plain, (from_loc(skc50,skf15(skc50,skf19(skc50,skc51,skc52)),skf19(skc50,skc51,skc52))), inference(closure_rule, [i_0_0])). % 3.89/0.85 cnf(i_0_146, plain, (~of(skc50,skf19(skc50,skc51,skc52),skc52)), inference(extension_rule, [i_0_59])). % 3.89/0.85 cnf(i_0_24883, plain, (ssSkP1(skc51,skc52,skc50)), inference(extension_rule, [i_0_66])). % 3.89/0.85 cnf(i_0_25172, plain, (from_loc(skc50,skf15(skc50,skf12(skc50,skc52,skc51)),skf12(skc50,skc52,skc51))), inference(extension_rule, [i_0_79])). % 3.89/0.85 cnf(i_0_25173, plain, (~of(skc50,skf12(skc50,skc52,skc51),skc52)), inference(extension_rule, [i_0_56])). % 3.89/0.85 cnf(i_0_25174, plain, (~cannon(skc50,skf12(skc50,skc52,skc51))), inference(extension_rule, [i_0_53])). % 3.89/0.85 cnf(i_0_25175, plain, (~member(skc50,skf12(skc50,skc52,skc51),skc51)), inference(extension_rule, [i_0_57])). % 3.89/0.85 cnf(i_0_147, plain, (~cannon(skc50,skf19(skc50,skc51,skc52))), inference(extension_rule, [i_0_55])). % 3.89/0.85 cnf(i_0_25711, plain, (ssSkP1(X8,X6,skc50)), inference(extension_rule, [i_0_60])). % 3.89/0.85 cnf(i_0_25772, plain, (man(skc50,skf16(skc50,X24))), inference(extension_rule, [i_0_78])). % 3.89/0.85 cnf(i_0_25773, plain, (~of(skc50,skf12(skc50,X6,X8),X6)), inference(extension_rule, [i_0_56])). % 3.89/0.85 cnf(i_0_25774, plain, (~cannon(skc50,skf12(skc50,X6,X8))), inference(extension_rule, [i_0_53])). % 3.89/0.85 cnf(i_0_25775, plain, (~member(skc50,skf12(skc50,X6,X8),X8)), inference(extension_rule, [i_0_57])). % 3.89/0.85 cnf(i_0_148, plain, (~member(skc50,skf19(skc50,skc51,skc52),skc51)), inference(extension_rule, [i_0_58])). % 3.89/0.85 cnf(i_0_26316, plain, (ssSkP1(skc51,X5,skc50)), inference(extension_rule, [i_0_65])). % 3.89/0.85 cnf(i_0_26371, plain, (patient(skc50,skf15(skc50,skf12(skc50,X5,skc51)),skf12(skc50,X5,skc51))), inference(extension_rule, [i_0_79])). % 3.89/0.85 cnf(i_0_26372, plain, (~of(skc50,skf12(skc50,X5,skc51),X5)), inference(extension_rule, [i_0_56])). % 3.89/0.85 cnf(i_0_26373, plain, (~cannon(skc50,skf12(skc50,X5,skc51))), inference(extension_rule, [i_0_53])). % 3.89/0.85 cnf(i_0_26374, plain, (~member(skc50,skf12(skc50,X5,skc51),skc51)), inference(extension_rule, [i_0_57])). % 3.89/0.85 cnf(i_0_149, plain, (~ssSkP1(skc51,skc52,skc50)), inference(extension_rule, [i_0_49])). % 3.89/0.85 # End printing tableau % 3.89/0.85 # SZS output end % 3.89/0.85 # Branches closed with saturation will be marked with an "s" % 3.89/0.85 # 20308 Satisfiable branch % 3.89/0.85 # Child (20304) has found a proof. % 3.89/0.85 % 3.89/0.85 # Proof search is over... % 3.89/0.85 # Freeing feature tree %------------------------------------------------------------------------------