%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP223-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 : n014.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:14:03 EDT 2022 % Result : Satisfiable 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : NLP223-1 : TPTP v8.1.0. Released v2.4.0. % 0.12/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 : n014.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 09:02:11 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_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 48 Number of unprocessed: 48 % 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 # 48 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 48 conjectures. % 0.13/0.38 # There are 48 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 # 48 start rule tableaux created. % 0.13/0.38 # 46 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.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # 11328 Satisfiable branch % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # 11329 Satisfiable branch % 0.13/0.39 # Satisfiable branch found. % 0.13/0.39 # Satisfiable branch found. % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_49, negated_conjecture, (actual_world(skc27))). % 0.13/0.39 cnf(i_0_50, negated_conjecture, (actual_world(skc16))). % 0.13/0.39 cnf(i_0_66, negated_conjecture, (proposition(skc16,skc19)|~ssSkC0)). % 0.13/0.39 cnf(i_0_65, negated_conjecture, (accessible_world(skc16,skc19)|~ssSkC0)). % 0.13/0.39 cnf(i_0_69, negated_conjecture, (think_believe_consider(skc16,skc20)|~ssSkC0)). % 0.13/0.39 cnf(i_0_51, negated_conjecture, (proposition(skc27,skc31)|ssSkC0)). % 0.13/0.39 cnf(i_0_52, negated_conjecture, (accessible_world(skc27,skc31)|ssSkC0)). % 0.13/0.39 cnf(i_0_68, negated_conjecture, (present(skc16,skc20)|~ssSkC0)). % 0.13/0.39 cnf(i_0_67, negated_conjecture, (event(skc16,skc20)|~ssSkC0)). % 0.13/0.39 cnf(i_0_71, negated_conjecture, (vincent_forename(skc16,skc21)|~ssSkC0)). % 0.13/0.39 cnf(i_0_70, negated_conjecture, (forename(skc16,skc21)|~ssSkC0)). % 0.13/0.39 cnf(i_0_53, negated_conjecture, (think_believe_consider(skc27,skc32)|ssSkC0)). % 0.13/0.39 cnf(i_0_73, negated_conjecture, (forename(skc16,skc23)|~ssSkC0)). % 0.13/0.39 cnf(i_0_64, negated_conjecture, (man(skc16,skc18)|~ssSkC0)). % 0.13/0.39 cnf(i_0_72, negated_conjecture, (man(skc16,skc22)|~ssSkC0)). % 0.13/0.39 cnf(i_0_63, negated_conjecture, (state(skc16,skc17)|~ssSkC0)). % 0.13/0.39 cnf(i_0_54, negated_conjecture, (present(skc27,skc32)|ssSkC0)). % 0.13/0.39 cnf(i_0_55, negated_conjecture, (event(skc27,skc32)|ssSkC0)). % 0.13/0.39 cnf(i_0_74, negated_conjecture, (jules_forename(skc16,skc23)|~ssSkC0)). % 0.13/0.39 cnf(i_0_56, negated_conjecture, (vincent_forename(skc27,skc33)|ssSkC0)). % 0.13/0.39 cnf(i_0_57, negated_conjecture, (forename(skc27,skc33)|ssSkC0)). % 0.13/0.39 cnf(i_0_61, negated_conjecture, (forename(skc27,skc30)|ssSkC0)). % 0.13/0.39 cnf(i_0_58, negated_conjecture, (man(skc27,skc34)|ssSkC0)). % 0.13/0.39 cnf(i_0_60, negated_conjecture, (man(skc27,skc29)|ssSkC0)). % 0.13/0.39 cnf(i_0_59, negated_conjecture, (state(skc27,skc28)|ssSkC0)). % 0.13/0.39 cnf(i_0_62, negated_conjecture, (jules_forename(skc27,skc30)|ssSkC0)). % 0.13/0.39 cnf(i_0_79, negated_conjecture, (theme(skc16,skc20,skc19)|~ssSkC0)). % 0.13/0.39 cnf(i_0_86, negated_conjecture, (present(skc31,skf11(X1))|ssSkC0|~man(skc31,X2))). % 0.13/0.39 cnf(i_0_75, negated_conjecture, (theme(skc27,skc32,skc31)|ssSkC0)). % 0.13/0.39 cnf(i_0_81, negated_conjecture, (agent(skc16,skc20,skc22)|~ssSkC0)). % 0.13/0.39 cnf(i_0_80, negated_conjecture, (of(skc16,skc21,skc22)|~ssSkC0)). % 0.13/0.39 cnf(i_0_82, negated_conjecture, (of(skc16,skc23,skc22)|~ssSkC0)). % 0.13/0.39 cnf(i_0_76, negated_conjecture, (agent(skc27,skc32,skc34)|ssSkC0)). % 0.13/0.39 cnf(i_0_77, negated_conjecture, (of(skc27,skc33,skc34)|ssSkC0)). % 0.13/0.39 cnf(i_0_78, negated_conjecture, (of(skc27,skc30,skc29)|ssSkC0)). % 0.13/0.39 cnf(i_0_84, negated_conjecture, (be(skc16,skc17,skc22,skc18)|~ssSkC0)). % 0.13/0.39 cnf(i_0_83, negated_conjecture, (be(skc27,skc28,skc29,skc29)|ssSkC0)). % 0.13/0.39 cnf(i_0_89, negated_conjecture, (present(skc19,skf7(X1))|~man(skc19,X2)|~ssSkC0)). % 0.13/0.39 cnf(i_0_85, negated_conjecture, (event(skc31,skf11(X1))|ssSkC0|~man(skc31,X2))). % 0.13/0.39 cnf(i_0_87, negated_conjecture, (smoke(skc31,skf11(X1))|ssSkC0|~man(skc31,X2))). % 0.13/0.39 cnf(i_0_88, negated_conjecture, (event(skc19,skf7(X1))|~man(skc19,X2)|~ssSkC0)). % 0.13/0.39 cnf(i_0_90, negated_conjecture, (smoke(skc19,skf7(X1))|~man(skc19,X2)|~ssSkC0)). % 0.13/0.39 cnf(i_0_92, negated_conjecture, (agent(skc19,skf7(X1),X1)|~man(skc19,X1)|~ssSkC0)). % 0.13/0.39 cnf(i_0_91, negated_conjecture, (agent(skc31,skf11(X1),X1)|ssSkC0|~man(skc31,X1))). % 0.13/0.39 cnf(i_0_93, negated_conjecture, (man(X1,skf13(X1))|ssSkC0|~be(X2,X3,X4,X5)|~of(X2,X6,X4)|~of(X2,X7,X4)|~agent(X2,X8,X4)|~theme(X2,X8,X1)|~jules_forename(X2,X6)|~state(X2,X3)|~man(X2,X4)|~man(X2,X5)|~forename(X2,X6)|~forename(X2,X7)|~vincent_forename(X2,X7)|~event(X2,X8)|~present(X2,X8)|~think_believe_consider(X2,X8)|~accessible_world(X2,X1)|~proposition(X2,X1)|~actual_world(X2))). % 0.13/0.39 cnf(i_0_94, negated_conjecture, (man(X1,skf9(X1))|~be(X2,X3,X4,X4)|~of(X2,X5,X4)|~of(X2,X6,X7)|~agent(X2,X8,X7)|~theme(X2,X8,X1)|~jules_forename(X2,X5)|~state(X2,X3)|~man(X2,X4)|~man(X2,X7)|~forename(X2,X5)|~forename(X2,X6)|~vincent_forename(X2,X6)|~event(X2,X8)|~present(X2,X8)|~think_believe_consider(X2,X8)|~accessible_world(X2,X1)|~proposition(X2,X1)|~ssSkC# SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_49, negated_conjecture, (actual_world(skc27))). % 0.13/0.39 cnf(i_0_50, negated_conjecture, (actual_world(skc16))). % 0.13/0.39 cnf(i_0_66, negated_conjecture, (proposition(skc16,skc19)|~ssSkC0)). % 0.13/0.39 cnf(i_0_65, negated_conjecture, (accessible_world(skc16,skc19)|~ssSkC0)). % 0.13/0.39 cnf(i_0_69, negated_conjecture, (think_believe_consider(skc16,skc20)|~ssSkC0)). % 0.13/0.39 cnf(i_0_51, negated_conjecture, (proposition(skc27,skc31)|ssSkC0)). % 0.13/0.39 cnf(i_0_52, negated_conjecture, (accessible_world(skc27,skc31)|ssSkC0)). % 0.13/0.39 cnf(i_0_68, negated_conjecture, (present(skc16,skc20)|~ssSkC0)). % 0.13/0.39 cnf(i_0_67, negated_conjecture, (event(skc16,skc20)|~ssSkC0)). % 0.13/0.39 cnf(i_0_71, negated_conjecture, (vincent_forename(skc16,skc21)|~ssSkC0)). % 0.13/0.39 cnf(i_0_70, negated_conjecture, (forename(skc16,skc21)|~ssSkC0)). % 0.13/0.39 cnf(i_0_53, negated_conjecture, (think_believe_consider(skc27,skc32)|ssSkC0)). % 0.13/0.39 cnf(i_0_73, negated_conjecture, (forename(skc16,skc23)|~ssSkC0)). % 0.13/0.39 cnf(i_0_64, negated_conjecture, (man(skc16,skc18)|~ssSkC0)). % 0.13/0.39 cnf(i_0_72, negated_conjecture, (man(skc16,skc22)|~ssSkC0)). % 0.13/0.39 cnf(i_0_63, negated_conjecture, (state(skc16,skc17)|~ssSkC0)). % 0.13/0.39 cnf(i_0_54, negated_conjecture, (present(skc27,skc32)|ssSkC0)). % 0.13/0.39 cnf(i_0_55, negated_conjecture, (event(skc27,skc32)|ssSkC0)). % 0.13/0.39 cnf(i_0_74, negated_conjecture, (jules_forename(skc16,skc23)|~ssSkC0)). % 0.13/0.39 cnf(i_0_56, negated_conjecture, (vincent_forename(skc27,skc33)|ssSkC0)). % 0.13/0.39 cnf(i_0_57, negated_conjecture, (forename(skc27,skc33)|ssSkC0)). % 0.13/0.39 cnf(i_0_61, negated_conjecture, (forename(skc27,skc30)|ssSkC0)). % 0.13/0.39 cnf(i_0_58, negated_conjecture, (man(skc27,skc34)|ssSkC0)). % 0.13/0.39 cnf(i_0_60, negated_conjecture, (man(skc27,skc29)|ssSkC0)). % 0.13/0.39 cnf(i_0_59, negated_conjecture, (state(skc27,skc28)|ssSkC0)). % 0.13/0.39 cnf(i_0_62, negated_conjecture, (jules_forename(skc27,skc30)|ssSkC0)). % 0.13/0.39 cnf(i_0_79, negated_conjecture, (theme(skc16,skc20,skc19)|~ssSkC0)). % 0.13/0.39 cnf(i_0_86, negated_conjecture, (present(skc31,skf11(X1))|ssSkC0|~man(skc31,X2))). % 0.13/0.39 cnf(i_0_75, negated_conjecture, (theme(skc27,skc32,skc31)|ssSkC0)). % 0.13/0.39 cnf(i_0_81, negated_conjecture, (agent(skc16,skc20,skc22)|~ssSkC0)). % 0.13/0.39 cnf(i_0_80, negated_conjecture, (of(skc16,skc21,skc22)|~ssSkC0)). % 0.13/0.39 cnf(i_0_82, negated_conjecture, (of(skc16,skc23,skc22)|~ssSkC0)). % 0.13/0.39 cnf(i_0_76, negated_conjecture, (agent(skc27,skc32,skc34)|ssSkC0)). % 0.13/0.39 cnf(i_0_77, negated_conjecture, (of(skc27,skc33,skc34)|ssSkC0)). % 0.13/0.39 cnf(i_0_78, negated_conjecture, (of(skc27,skc30,skc29)|ssSkC0)). % 0.13/0.39 cnf(i_0_84, negated_conjecture, (be(skc16,skc17,skc22,skc18)|~ssSkC0)). % 0.13/0.39 cnf(i_0_83, negated_conjecture, (be(skc27,skc28,skc29,skc29)|ssSkC0)). % 0.13/0.39 cnf(i_0_89, negated_conjecture, (present(skc19,skf7(X1))|~man(skc19,X2)|~ssSkC0)). % 0.13/0.39 cnf(i_0_85, negated_conjecture, (event(skc31,skf11(X1))|ssSkC0|~man(skc31,X2))). % 0.13/0.39 cnf(i_0_87, negated_conjecture, (smoke(skc31,skf11(X1))|ssSkC0|~man(skc31,X2))). % 0.13/0.39 cnf(i_0_88, negated_conjecture, (event(skc19,skf7(X1))|~man(skc19,X2)|~ssSkC0)). % 0.13/0.39 cnf(i_0_90, negated_conjecture, (smoke(skc19,skf7(X1))|~man(skc19,X2)|~ssSkC0)). % 0.13/0.39 cnf(i_0_92, negated_conjecture, (agent(skc19,skf7(X1),X1)|~man(skc19,X1)|~ssSkC0)). % 0.13/0.39 cnf(i_0_91, negated_conjecture, (agent(skc31,skf11(X1),X1)|ssSkC0|~man(skc31,X1))). % 0.13/0.39 cnf(i_0_93, negated_conjecture, (man(X1,skf13(X1))|ssSkC0|~be(X2,X3,X4,X5)|~of(X2,X6,X4)|~of(X2,X7,X4)|~agent(X2,X8,X4)|~theme(X2,X8,X1)|~jules_forename(X2,X6)|~state(X2,X3)|~man(X2,X4)|~man(X2,X5)|~forename(X2,X6)|~forename(X2,X7)|~vincent_forename(X2,X7)|~event(X2,X8)|~present(X2,X8)|~think_believe_consider(X2,X8)|~accessible_world(X2,X1)|~proposition(X2,X1)|~actual_world(X2))). % 0.13/0.39 cnf(i_0_94, negated_conjecture, (man(X1,skf9(X1))|~be(X2,X3,X4,X4)|~of(X2,X5,X4)|~of(X2,X6,X7)|~agent(X2,X8,X7)|~theme(X2,X8,X1)|~jules_forename(X2,X5)|~state(X2,X3)|~man(X2,X4)|~man(X2,X7)|~forename(X2,X5)|~forename(X2,X6)|~vincent_forename(X2,X6)|~event(X2,X8)|~present(X2,X8)|~think_believe_consider(X2,X8)|~accessible_world(X2,X1)|~proposition(X2,X1)|~ssSkC0|~actual_world(X2))). % 0.13/0.39 cnf(i_0_96, negated_conjecture, (~smoke(X1,X2)|~be(X3,X4,X5,X5)|~of(X3,X6,X5)|~of(X3,X7,X8)|~agent(X1,X2,skf9(X1))|~agent(X3,X9,X8)|~theme(X3,X9,X1)|~jules_forename(X3,X6)|~state(X3,X4)|~man(X3,X5)|~man(X3,X8)|~forename(X3,X6)|~forename(X3,X7)|~vincent_forename(X3,X7)|~event(X1,X2)|~event(X3,X9)|~present(X1,X2)|~present(X3,X9)|~think_believe_consider(X3,X9)|~accessible_world(X3,X1)|~proposition(X3,X1)|~ssSkC0|~actual_world(X3))). % 0.13/0.39 cnf(i_0_95, negated_conjecture, (ssSkC0|~smoke(X1,X2)|~be(X3,X4,X5,X6)|~of(X3,X7,X5)|~of(X3,X8,X5)|~agent(X1,X2,skf13(X1))|~agent(X3,X9,X5)|~theme(X3,X9,X1)|~jules_forename(X3,X7)|~state(X3,X4)|~man(X3,X5)|~man(X3,X6)|~forename(X3,X7)|~forename(X3,X8)|~vincent_forename(X3,X8)|~event(X1,X2)|~event(X3,X9)|~present(X1,X2)|~present(X3,X9)|~think_believe_consider(X3,X9)|~accessible_world(X3,X1)|~proposition(X3,X1)|~actual_world(X3))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 3 steps % 0.13/0.39 cnf(i_0_50, negated_conjecture, (actual_world(skc16)), inference(start_rule)). % 0.13/0.39 cnf(i_0_2638, plain, (actual_world(skc16)), inference(extension_rule, [i_0_95])). % 0.13/0.39 cnf(i_0_3802, plain, (ssSkC0), inference(extension_rule, [i_0_90])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 0|~actual_world(X2))). % 0.13/0.39 cnf(i_0_96, negated_conjecture, (~smoke(X1,X2)|~be(X3,X4,X5,X5)|~of(X3,X6,X5)|~of(X3,X7,X8)|~agent(X1,X2,skf9(X1))|~agent(X3,X9,X8)|~theme(X3,X9,X1)|~jules_forename(X3,X6)|~state(X3,X4)|~man(X3,X5)|~man(X3,X8)|~forename(X3,X6)|~forename(X3,X7)|~vincent_forename(X3,X7)|~event(X1,X2)|~event(X3,X9)|~present(X1,X2)|~present(X3,X9)|~think_believe_consider(X3,X9)|~accessible_world(X3,X1)|~proposition(X3,X1)|~ssSkC0|~actual_world(X3))). % 0.13/0.39 cnf(i_0_95, negated_conjecture, (ssSkC0|~smoke(X1,X2)|~be(X3,X4,X5,X6)|~of(X3,X7,X5)|~of(X3,X8,X5)|~agent(X1,X2,skf13(X1))|~agent(X3,X9,X5)|~theme(X3,X9,X1)|~jules_forename(X3,X7)|~state(X3,X4)|~man(X3,X5)|~man(X3,X6)|~forename(X3,X7)|~forename(X3,X8)|~vincent_forename(X3,X8)|~event(X1,X2)|~event(X3,X9)|~present(X1,X2)|~present(X3,X9)|~think_believe_consider(X3,X9)|~accessible_world(X3,X1)|~proposition(X3,X1)|~actual_world(X3))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 3 steps % 0.13/0.39 cnf(i_0_50, negated_conjecture, (actual_world(skc16)), inference(start_rule)). % 0.13/0.39 cnf(i_0_2638, plain, (actual_world(skc16)), inference(extension_rule, [i_0_95])). % 0.13/0.39 cnf(i_0_3802, plain, (ssSkC0), inference(extension_rule, [i_0_90])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # Child (11328) has found a proof. % 0.13/0.40 % 0.13/0.40 # Proof search is over... % 0.13/0.40 # Freeing feature tree %------------------------------------------------------------------------------