%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP027-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:11:47 EDT 2022 % Result : Satisfiable 8.10s 1.39s % Output : CNFRefutation 8.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NLP027-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.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 : Fri Jul 1 02:52:37 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.19/0.37 # and selection function SelectNewComplexAHP. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 46 Number of unprocessed: 46 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 46 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 46 conjectures. % 0.19/0.37 # There are 46 start rule candidates: % 0.19/0.37 # Found 2 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 46 start rule tableaux created. % 0.19/0.37 # 44 extension rule candidate clauses % 0.19/0.37 # 2 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 8.10/1.38 # 17902 Satisfiable branch % 8.10/1.39 # Satisfiable branch found. % 8.10/1.39 # There were 1 total branch saturation attempts. % 8.10/1.39 # There were 0 of these attempts blocked. % 8.10/1.39 # There were 0 deferred branch saturation attempts. % 8.10/1.39 # There were 0 free duplicated saturations. % 8.10/1.39 # There were 0 total successful branch saturations. % 8.10/1.39 # There were 0 successful branch saturations in interreduction. % 8.10/1.39 # There were 0 successful branch saturations on the branch. % 8.10/1.39 # There were 0 successful branch saturations after the branch. % 8.10/1.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.10/1.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.10/1.39 # Begin clausification derivation % 8.10/1.39 % 8.10/1.39 # End clausification derivation % 8.10/1.39 # Begin listing active clauses obtained from FOF to CNF conversion % 8.10/1.39 cnf(i_0_47, negated_conjecture, (actual_world(skc63))). % 8.10/1.39 cnf(i_0_48, negated_conjecture, (actual_world(skc5))). % 8.10/1.39 cnf(i_0_52, negated_conjecture, (group(skc5,skc6)|~ssSkC0)). % 8.10/1.39 cnf(i_0_53, negated_conjecture, (ssSkP3(skc6,skc5)|~ssSkC0)). % 8.10/1.39 cnf(i_0_49, negated_conjecture, (three(skc63,skc64)|ssSkC0)). % 8.10/1.39 cnf(i_0_50, negated_conjecture, (group(skc63,skc64)|ssSkC0)). % 8.10/1.39 cnf(i_0_51, negated_conjecture, (table(skc63,skc65)|ssSkC0)). % 8.10/1.39 cnf(i_0_54, negated_conjecture, (ssSkP2(skc65,skc64,skc63)|ssSkC0)). % 8.10/1.39 cnf(i_0_58, negated_conjecture, (hamburger(skc5,X1)|~member(skc5,X1,skc6)|~ssSkC0)). % 8.10/1.39 cnf(i_0_56, negated_conjecture, (guy(skc63,X1)|ssSkC0|~member(skc63,X1,skc64))). % 8.10/1.39 cnf(i_0_57, negated_conjecture, (young(skc63,X1)|ssSkC0|~member(skc63,X1,skc64))). % 8.10/1.39 cnf(i_0_55, negated_conjecture, (member(X1,skf31(X1,X2),X2)|ssSkP3(X2,X1))). % 8.10/1.39 cnf(i_0_76, negated_conjecture, (ssSkC0|~hamburger(X1,skf34(X1,X2))|~ssSkP3(X3,X1)|~group(X1,X3)|~actual_world(X1))). % 8.10/1.39 cnf(i_0_63, negated_conjecture, (group(X1,skf29(X1,X2))|~member(X1,X3,X4)|~ssSkP3(X4,X1))). % 8.10/1.39 cnf(i_0_62, negated_conjecture, (three(X1,skf29(X1,X2))|~member(X1,X3,X4)|~ssSkP3(X4,X1))). % 8.10/1.39 cnf(i_0_77, negated_conjecture, (member(X1,skf34(X1,X2),X2)|ssSkC0|~ssSkP3(X2,X1)|~group(X1,X2)|~actual_world(X1))). % 8.10/1.39 cnf(i_0_64, negated_conjecture, (ssSkP1(X1,skf29(X2,X1),X2)|~member(X2,X1,X3)|~ssSkP3(X3,X2))). % 8.10/1.39 cnf(i_0_60, negated_conjecture, (member(X1,skf26(X1,X2,X3),X3)|ssSkP2(X2,X3,X1))). % 8.10/1.39 cnf(i_0_82, negated_conjecture, (guy(X1,X2)|~member(X1,X2,skf29(X1,X3))|~member(X1,X4,X5)|~ssSkP3(X5,X1))). % 8.10/1.39 cnf(i_0_81, negated_conjecture, (young(X1,X2)|~member(X1,X2,skf29(X1,X3))|~member(X1,X4,X5)|~ssSkP3(X5,X1))). % 8.10/1.39 cnf(i_0_69, negated_conjecture, (group(X1,skf24(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP2(X6,X5,X1))). % 8.10/1.39 cnf(i_0_84, negated_conjecture, (hamburger(X1,X2)|~member(X1,X2,skf24(X1,X3,X4))|~member(X1,X5,X6)|~ssSkP2(X7,X6,X1))). % 8.10/1.39 cnf(i_0_59, negated_conjecture, (ssSkP1(X1,X2,X3)|member(X3,skf22(X1,X3,X2),X2))). % 8.10/1.39 cnf(i_0_65, negated_conjecture, (table(X1,skf19(X1,X2,X3))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))). % 8.10/1.39 cnf(i_0_66, negated_conjecture, (sit(X1,skf18(X1,X2,X3))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))). % 8.10/1.39 cnf(i_0_67, negated_conjecture, (present(X1,skf18(X1,X2,X3))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))). % 8.10/1.39 cnf(i_0_68, negated_conjecture, (event(X1,skf18(X1,X2,X3))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))). % 8.10/1.39 cnf(i_0_88, negated_conjecture, (member(X1,skf14(X1,X2),X2)|~ssSkP2(X3,X2,X1)|~table(X1,X3)|~group(X1,X2)|~three(X1,X2)|~ssSkC0|~actual_world(X1))). % 8.10/1.39 cnf(i_0_61, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|member(X4,skf17(X3,X4,X5,X6),X3))). % 8.10/1.39 cnf(i_0_75, negated_conjecture, (ssSkP0(X1,X2,skf24(X3,X2,X1),X3)|~member(X3,X2,X4)|~ssSkP2(X1,X4,X3))). % 8.10/1.39 cnf(i_0_86, negated_conjecture, (ssSkP2(X1,X2,X3)|~ssSkP0(X1,skf26(X3,X1,X4),X5,X3)|~hamburger(X3,skf27(X3,X6))|~group(X3,X5))). % 8.10/1.39 cnf(i_0_90, negated_conjecture, (~young(X1,skf14(X1,X2))|~guy(X1,skf14(X1,X2))|~ssSkP2(X3,X4,X1)|~table(X1,X3)|~group(X1,X4)|~three(X1,X4)|~ssSkC0|~actual_world(X1))). % 8.10/1.39 cnf(i_0_70, negated_conjecture, (with(X1,skf18(X1,X2,X3),X3)|~ssSkP1(X3,X4,X1)|~member(X1,X2,X4))). % 8.10/1.39 cnf(i_0_71, negated_conjecture, (agent(X1,skf18(X1,X2,X3),X2)|~ssSkP1(X4,X5,X1)|~member(X1,X2,X5))). % 8.10/1.39 cnf(i_0_74, negated_conjecture, (sit(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))). % 8.10/1.39 cnf(i_0_73, negated_conjecture, (present(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))). % 8.10/1.39 cnf(i_0_72, negated_conjecture, (event(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))). % 8.10/1.39 cnf(i_0_87, negated_conjecture, (member(X1,skf32(X1,X2),X2)|ssSkP3(X3,X1)|~ssSkP1(skf31(X1,X4),X2,X1)|~group(X1,X2)|~three(X1,X2))). % 8.10/1.39 cnf(i_0_89, negated_conjecture, (ssSkP3(X1,X2)|~ssSkP1(skf31(X2,X3),X4,X2)|~young(X2,skf32(X2,X5))|~guy(X2,skf32(X2,X5))|~group(X2,X4)|~three(X2,X4))). % 8.10/1.39 cnf(i_0_80, negated_conjecture, (with(X1,skf15(X1,X2,X3,X4),X2)|~ssSkP0(X5,X6,X7,X1)|~member(X1,X2,X7))). % 8.10/1.39 cnf(i_0_78, negated_conjecture, (agent(X1,skf15(X1,X2,X3,X4),X4)|~ssSkP0(X3,X4,X5,X1)|~member(X1,X2,X5))). % 8.10/1.39 cnf(i_0_79, negated_conjecture, (at(X1,skf15(X1,X2,X3,X4),X3)|~ssSkP0(X3,X5,X6,X1)|~member(X1,X2,X6))). % 8.10/1.39 cnf(i_0_85, negated_conjecture, (member(X1,skf27(X1,X2),X2)|ssSkP2(X3,X4,X1)|~ssSkP0(X3,skf26(X1,X3,X5),X2,X1)|~group(X1,X2))). % 8.10/1.39 cnf(i_0_92, negated_conjecture, (ssSkP1(X1,X2,X3)|~at(X3,X4,X5)|~agent(X3,X4,skf22(X1,X3,X6))|~with(X3,X4,X1)|~event(X3,X4)|~present(X3,X4)|~sit(X3,X4)|~table(X3,X5))). % 8.10/1.39 cnf(i_0_83, negated_conjecture, (at(X1,skf18(X1,X2,X3),skf19(X1,X3,X2))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))). % 8.10/1.39 cnf(i_0_91, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|~at(X4,X5,X1)|~agent(X4,X5,X2)|~with(X4,X5,skf17(X3,X4,X1,X2))|~event(X4,X5)|~present(X4,X5)|~sit(X4,X5))). % 8.10/1.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 8.10/1.39 # Begin printing tableau % 8.10/1.39 # Found 21 steps % 8.10/1.39 cnf(i_0_56, negated_conjecture, (guy(skc63,skf32(skc63,skc64))|ssSkC0|~member(skc63,skf32(skc63,skc64),skc64)), inference(start_rule)). % 8.10/1.39 cnf(i_0_230, plain, (ssSkC0), inference(closure_rule, [i_0_0])). % 8.10/1.39 cnf(i_0_229, plain, (guy(skc63,skf32(skc63,skc64))), inference(extension_rule, [i_0_89])). % 8.10/1.39 cnf(i_0_85843, plain, (ssSkP3(skf24(skc63,X13,X20),skc63)), inference(extension_rule, [i_0_76])). % 8.10/1.39 cnf(i_0_85869, plain, (~actual_world(skc63)), inference(closure_rule, [i_0_47])). % 8.10/1.39 cnf(i_0_85865, plain, (ssSkC0), inference(extension_rule, [i_0_88])). % 8.10/1.39 cnf(i_0_85897, plain, (~actual_world(skc5)), inference(closure_rule, [i_0_48])). % 8.10/1.39 cnf(i_0_85866, plain, (~hamburger(skc63,skf34(skc63,X19))), inference(extension_rule, [i_0_84])). % 8.10/1.39 cnf(i_0_85868, plain, (~group(skc63,skf24(skc63,X13,X20))), inference(extension_rule, [i_0_69])). % 8.10/1.39 cnf(i_0_85844, plain, (~ssSkP1(skf31(skc63,X25),skf29(skc63,X12),skc63)), inference(extension_rule, [i_0_59])). % 8.10/1.39 cnf(i_0_86127, plain, (member(skc63,skf22(skf31(skc63,X25),skc63,skf29(skc63,X12)),skf29(skc63,X12))), inference(extension_rule, [i_0_62])). % 8.10/1.39 cnf(i_0_85848, plain, (~three(skc63,skf29(skc63,X12))), inference(extension_rule, [i_0_62])). % 8.10/1.39 cnf(i_0_96695, plain, (~member(skc63,skf26(skc63,X5,X4),X4)), inference(extension_rule, [i_0_60])). % 8.10/1.39 cnf(i_0_96696, plain, (~ssSkP3(X4,skc63)), inference(extension_rule, [i_0_55])). % 8.10/1.39 cnf(i_0_85847, plain, (~group(skc63,skf29(skc63,X12))), inference(extension_rule, [i_0_63])). % 8.10/1.39 cnf(i_0_96900, plain, (~member(skc63,skf17(X24,skc63,X29,X30),X24)), inference(extension_rule, [i_0_61])). % 8.10/1.39 cnf(i_0_96901, plain, (~ssSkP3(X24,skc63)), inference(extension_rule, [i_0_89])). % 8.10/1.39 cnf(i_0_97104, plain, (~guy(skc63,skf32(skc63,skc64))), inference(closure_rule, [i_0_229])). % 8.10/1.39 cnf(i_0_85845, plain, (~young(skc63,skf32(skc63,skc64))), inference(extension_rule, [i_0_57])). % 8.10/1.39 cnf(i_0_97159, plain, (ssSkC0), inference(extension_rule, [i_0_53])). % 8.10/1.39 cnf(i_0_97160, plain, (~member(skc63,skf32(skc63,skc64),skc64)), inference(extension_rule, [i_0_87])). % 8.10/1.39 # End printing tableau % 8.10/1.39 # SZS output end % 8.10/1.39 # Branches closed with saturation will be marked with an "s" % 8.10/1.39 # Child (17902) has found a proof. % 8.10/1.39 % 8.10/1.39 # Proof search is over... % 8.10/1.39 # Freeing feature tree %------------------------------------------------------------------------------