%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP006-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 : n004.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:28 EDT 2022 % Result : Satisfiable 0.12s 0.40s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NLP006-1 : TPTP v8.1.0. Released v2.4.0. % 0.07/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 : n004.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 00:52:23 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 57 Number of unprocessed: 57 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 57 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 57 conjectures. % 0.12/0.37 # There are 57 start rule candidates: % 0.12/0.37 # Found 15 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 57 start rule tableaux created. % 0.12/0.37 # 42 extension rule candidate clauses % 0.12/0.37 # 15 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.40 # Creating equality axioms % 0.12/0.40 # Ran out of tableaux, making start rules for all clauses % 0.12/0.40 # 32602 Satisfiable branch % 0.12/0.40 # Creating equality axioms % 0.12/0.40 # Ran out of tableaux, making start rules for all clauses % 0.12/0.40 # 32608 Satisfiable branch % 0.12/0.40 # Satisfiable branch found. % 0.12/0.40 # There were 1 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 0 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 0 successful branch saturations after the branch. % 0.12/0.40 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # Begin clausification derivation % 0.12/0.40 % 0.12/0.40 # End clausification derivation % 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.40 cnf(i_0_58, negated_conjecture, (city(skc29))). % 0.12/0.40 cnf(i_0_66, negated_conjecture, (city(skc21))). % 0.12/0.40 cnf(i_0_59, negated_conjecture, (event(skc28))). % 0.12/0.40 cnf(i_0_67, negated_conjecture, (event(skc20))). % 0.12/0.40 cnf(i_0_60, negated_conjecture, (old(skc27))). % 0.12/0.40 cnf(i_0_68, negated_conjecture, (old(skc19))). % 0.12/0.40 cnf(i_0_61, negated_conjecture, (street(skc26))). % 0.12/0.40 cnf(i_0_69, negated_conjecture, (street(skc18))). % 0.12/0.40 cnf(i_0_62, negated_conjecture, (front(skc25))). % 0.12/0.40 cnf(i_0_63, negated_conjecture, (seat(skc24))). % 0.12/0.40 cnf(i_0_70, negated_conjecture, (seat(skc17))). % 0.12/0.40 cnf(i_0_64, negated_conjecture, (fellow(skc23))). % 0.12/0.40 cnf(i_0_72, negated_conjecture, (fellow(skc15))). % 0.12/0.40 cnf(i_0_65, negated_conjecture, (young(skc22))). % 0.12/0.40 cnf(i_0_71, negated_conjecture, (young(skc16))). % 0.12/0.40 cnf(i_0_112, negated_conjecture, (skc16!=skc15|~ssSkC0)). % 0.12/0.40 cnf(i_0_111, negated_conjecture, (ssSkC0|skc22!=skc23)). % 0.12/0.40 cnf(i_0_84, negated_conjecture, (ssSkC0|front(skc24))). % 0.12/0.40 cnf(i_0_99, negated_conjecture, (front(skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_97, negated_conjecture, (fellow(skc16)|~ssSkC0)). % 0.12/0.40 cnf(i_0_95, negated_conjecture, (young(skc15)|~ssSkC0)). % 0.12/0.40 cnf(i_0_88, negated_conjecture, (lonely(skc18)|~ssSkC0)). % 0.12/0.40 cnf(i_0_80, negated_conjecture, (ssSkC0|seat(skc25))). % 0.12/0.40 cnf(i_0_89, negated_conjecture, (way(skc18)|~ssSkC0)). % 0.12/0.40 cnf(i_0_90, negated_conjecture, (chevy(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_91, negated_conjecture, (car(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_92, negated_conjecture, (white(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_82, negated_conjecture, (ssSkC0|fellow(skc22))). % 0.12/0.40 cnf(i_0_86, negated_conjecture, (ssSkC0|young(skc23))). % 0.12/0.40 cnf(i_0_93, negated_conjecture, (dirty(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_94, negated_conjecture, (hollywood(skc21)|~ssSkC0)). % 0.12/0.40 cnf(i_0_100, negated_conjecture, (furniture(skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_98, negated_conjecture, (man(skc16)|~ssSkC0)). % 0.12/0.40 cnf(i_0_73, negated_conjecture, (lonely(skc26)|ssSkC0)). % 0.12/0.40 cnf(i_0_96, negated_conjecture, (man(skc15)|~ssSkC0)). % 0.12/0.40 cnf(i_0_74, negated_conjecture, (way(skc26)|ssSkC0)). % 0.12/0.40 cnf(i_0_75, negated_conjecture, (chevy(skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_76, negated_conjecture, (car(skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_77, negated_conjecture, (white(skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_78, negated_conjecture, (dirty(skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_79, negated_conjecture, (hollywood(skc29)|ssSkC0)). % 0.12/0.40 cnf(i_0_81, negated_conjecture, (furniture(skc25)|ssSkC0)). % 0.12/0.40 cnf(i_0_85, negated_conjecture, (furniture(skc24)|ssSkC0)). % 0.12/0.40 cnf(i_0_87, negated_conjecture, (man(skc23)|ssSkC0)). % 0.12/0.40 cnf(i_0_83, negated_conjecture, (man(skc22)|ssSkC0)). % 0.12/0.40 cnf(i_0_106, negated_conjecture, (down(skc20,skc18)|~ssSkC0)). % 0.12/0.40 cnf(i_0_107, negated_conjecture, (barrel(skc20,skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_108, negated_conjecture, (in(skc20,skc21)|~ssSkC0)). % 0.12/0.40 cnf(i_0_110, negated_conjecture, (in(skc16,skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_101, negated_conjecture, (down(skc28,skc26)|ssSkC0)). % 0.12/0.40 cnf(i_0_102, negated_conjecture, (barrel(skc28,skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_109, negated_conjecture, (in(skc15,skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_103, negated_conjecture, (in(skc28,skc29)|ssSkC0)). % 0.12/0.40 cnf(i_0_105, negated_conjecture, (in(skc23,skc24)|ssSkC0)). % 0.12/0.40 cnf(i_0_104, negated_conjecture, (in(skc22,skc25)|ssSkC0)). % 0.12/0.40 cnf(i_0_113, negated_conjecture, (X1=X2|ssSkC0|~in(X2,X3)|~in(X1,X3)|~in(X4,X5)|~barrel(X4,X6)|~down(X4,X7)|~man(X2)|~man(X1)|~furniture(X3)|~hollywood(X5)|~dirty(X6)|~white(X6)|~car(X6)|~chevy(X6)|~way(X7)|~lonely(X7)|~young(X2)|~young(X1)|~fellow(X2)|~fellow(X1)|~seat(X3)|~front(X3)|~street(X7)|~old(X6)|~event(X4)|~city(X5))). % 0.12/0.40 cnf(i_0_114, negated_conjecture, (X1=X2|~in(X2,X3)|~in(X1,X4)|~in(X5,X6)|~barrel(X5,X7)|~down(X5,X8)|~man(X2)|~man(X1)|~furniture(X3)|~furniture(X4)|~hollywood(X6)|~dirty(X7)|~white(X7)|~car(X7)|~chevy(X7)|~way(X8)|~lonely(X8)|~ssSkC0|~young(X2)|~young(X1)|~fellow(X2)|~fellow(X1)|~seat(X3)|~seat(X4)|~front(X3)|~front(X4)|~street(X8)|~old(X7)|~event(X5)|~city(X6))). % 0.12/0.40 cnf(i_0_7094, plain, (X9=X9)). % 0.12/0.40 # End listing active claus# Satisfiable branch found. % 0.12/0.40 # There were 1 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 0 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 0 successful branch saturations after the branch. % 0.12/0.40 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # Begin clausification derivation % 0.12/0.40 % 0.12/0.40 # End clausification derivation % 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.40 cnf(i_0_58, negated_conjecture, (city(skc29))). % 0.12/0.40 cnf(i_0_66, negated_conjecture, (city(skc21))). % 0.12/0.40 cnf(i_0_59, negated_conjecture, (event(skc28))). % 0.12/0.40 cnf(i_0_67, negated_conjecture, (event(skc20))). % 0.12/0.40 cnf(i_0_60, negated_conjecture, (old(skc27))). % 0.12/0.40 cnf(i_0_68, negated_conjecture, (old(skc19))). % 0.12/0.40 cnf(i_0_61, negated_conjecture, (street(skc26))). % 0.12/0.40 cnf(i_0_69, negated_conjecture, (street(skc18))). % 0.12/0.40 cnf(i_0_62, negated_conjecture, (front(skc25))). % 0.12/0.40 cnf(i_0_63, negated_conjecture, (seat(skc24))). % 0.12/0.40 cnf(i_0_70, negated_conjecture, (seat(skc17))). % 0.12/0.40 cnf(i_0_64, negated_conjecture, (fellow(skc23))). % 0.12/0.40 cnf(i_0_72, negated_conjecture, (fellow(skc15))). % 0.12/0.40 cnf(i_0_65, negated_conjecture, (young(skc22))). % 0.12/0.40 cnf(i_0_71, negated_conjecture, (young(skc16))). % 0.12/0.40 cnf(i_0_112, negated_conjecture, (skc16!=skc15|~ssSkC0)). % 0.12/0.40 cnf(i_0_111, negated_conjecture, (ssSkC0|skc22!=skc23)). % 0.12/0.40 cnf(i_0_84, negated_conjecture, (ssSkC0|front(skc24))). % 0.12/0.40 cnf(i_0_99, negated_conjecture, (front(skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_97, negated_conjecture, (fellow(skc16)|~ssSkC0)). % 0.12/0.40 cnf(i_0_95, negated_conjecture, (young(skc15)|~ssSkC0)). % 0.12/0.40 cnf(i_0_88, negated_conjecture, (lonely(skc18)|~ssSkC0)). % 0.12/0.40 cnf(i_0_80, negated_conjecture, (ssSkC0|seat(skc25))). % 0.12/0.40 cnf(i_0_89, negated_conjecture, (way(skc18)|~ssSkC0)). % 0.12/0.40 cnf(i_0_90, negated_conjecture, (chevy(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_91, negated_conjecture, (car(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_92, negated_conjecture, (white(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_82, negated_conjecture, (ssSkC0|fellow(skc22))). % 0.12/0.40 cnf(i_0_86, negated_conjecture, (ssSkC0|young(skc23))). % 0.12/0.40 cnf(i_0_93, negated_conjecture, (dirty(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_94, negated_conjecture, (hollywood(skc21)|~ssSkC0)). % 0.12/0.40 cnf(i_0_100, negated_conjecture, (furniture(skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_98, negated_conjecture, (man(skc16)|~ssSkC0)). % 0.12/0.40 cnf(i_0_73, negated_conjecture, (lonely(skc26)|ssSkC0)). % 0.12/0.40 cnf(i_0_96, negated_conjecture, (man(skc15)|~ssSkC0)). % 0.12/0.40 cnf(i_0_74, negated_conjecture, (way(skc26)|ssSkC0)). % 0.12/0.40 cnf(i_0_75, negated_conjecture, (chevy(skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_76, negated_conjecture, (car(skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_77, negated_conjecture, (white(skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_78, negated_conjecture, (dirty(skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_79, negated_conjecture, (hollywood(skc29)|ssSkC0)). % 0.12/0.40 cnf(i_0_81, negated_conjecture, (furniture(skc25)|ssSkC0)). % 0.12/0.40 cnf(i_0_85, negated_conjecture, (furniture(skc24)|ssSkC0)). % 0.12/0.40 cnf(i_0_87, negated_conjecture, (man(skc23)|ssSkC0)). % 0.12/0.40 cnf(i_0_83, negated_conjecture, (man(skc22)|ssSkC0)). % 0.12/0.40 cnf(i_0_106, negated_conjecture, (down(skc20,skc18)|~ssSkC0)). % 0.12/0.40 cnf(i_0_107, negated_conjecture, (barrel(skc20,skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_108, negated_conjecture, (in(skc20,skc21)|~ssSkC0)). % 0.12/0.40 cnf(i_0_110, negated_conjecture, (in(skc16,skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_101, negated_conjecture, (down(skc28,skc26)|ssSkC0)). % 0.12/0.40 cnf(i_0_102, negated_conjecture, (barrel(skc28,skc27)|ssSkC0)). % 0.12/0.40 cnf(i_0_109, negated_conjecture, (in(skc15,skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_103, negated_conjecture, (in(skc28,skc29)|ssSkC0)). % 0.12/0.40 cnf(i_0_105, negated_conjecture, (in(skc23,skc24)|ssSkC0)). % 0.12/0.40 cnf(i_0_104, negated_conjecture, (in(skc22,skc25)|ssSkC0)). % 0.12/0.40 cnf(i_0_113, negated_conjecture, (X1=X2|ssSkC0|~in(X2,X3)|~in(X1,X3)|~in(X4,X5)|~barrel(X4,X6)|~down(X4,X7)|~man(X2)|~man(X1)|~furniture(X3)|~hollywood(X5)|~dirty(X6)|~white(X6)|~car(X6)|~chevy(X6)|~way(X7)|~lonely(X7)|~young(X2)|~young(X1)|~fellow(X2)|~fellow(X1)|~seat(X3)|~front(X3)|~street(X7)|~old(X6)|~event(X4)|~city(X5))). % 0.12/0.40 cnf(i_0_114, negated_conjecture, (X1=X2|~in(X2,X3)|~in(X1,X4)|~in(X5,X6)|~barrel(X5,X7)|~down(X5,X8)|~man(X2)|~man(X1)|~furniture(X3)|~furniture(X4)|~hollywood(X6)|~dirty(X7)|~white(X7)|~car(X7)|~chevy(X7)|~way(X8)|~lonely(X8)|~ssSkC0|~young(X2)|~young(X1)|~fellow(X2)|~fellow(X1)|~seat(X3)|~seat(X4)|~front(X3)|~front(X4)|~street(X8)|~old(X7)|~event(X5)|~city(X6))). % 0.12/0.40 cnf(i_0_6816, plain, (X9=X9)). % 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.40 # Begin printing tableau % 0.12/0.40 # Found 10 steps % 0.12/0.40 cnf(i_0_6816, plain, (skc29=skc29), inference(start_rule)). % 0.12/0.40 cnf(i_0_6992, plain, (skc29=skc29), inference(extension_rule, [i_0_6820])). % 0.12/0.40 cnf(i_0_7139, plain, (~city(skc29)), inference(closure_rule, [i_0_58])). % 0.12/0.40 cnf(i_0_7137, plain, (city(skc29)), inference(extension_rule, [i_0_113])). % 0.12/0.40 cnf(i_0_7237, plain, (~young(skc22)), inference(closure_rule, [i_0_65])). % 0.12/0.40 cnf(i_0_7238, plain, (~young(skc22)), inference(closure_rule, [i_0_65])). % 0.12/0.40 cnf(i_0_7241, plain, (~seat(skc24)), inference(closure_rule, [i_0_63])). % 0.12/0.40 cnf(i_0_7243, plain, (~street(skc26)), inference(closure_rule, [i_0_61])). % 0.12/0.40 cnf(i_0_7244, plain, (~old(skc27)), inference(closure_rule, [i_0_60])). % 0.12/0.40 cnf(i_0_7245, plain, (~event(skc28)), inference(closure_rule, [i_0_59])). % 0.12/0.40 # End printing tableau % 0.12/0.40 # SZS output end % 0.12/0.40 # Branches closed with saturation will be marked with an "s" % 0.12/0.40 es. There is an equivalent clause to each of these in the clausification! % 0.12/0.40 # Begin printing tableau % 0.12/0.40 # Found 10 steps % 0.12/0.40 cnf(i_0_7094, plain, (skc29=skc29), inference(start_rule)). % 0.12/0.40 cnf(i_0_7270, plain, (skc29=skc29), inference(extension_rule, [i_0_7098])). % 0.12/0.40 cnf(i_0_7417, plain, (~city(skc29)), inference(closure_rule, [i_0_58])). % 0.12/0.40 cnf(i_0_7415, plain, (city(skc29)), inference(extension_rule, [i_0_113])). % 0.12/0.40 cnf(i_0_7515, plain, (~young(skc22)), inference(closure_rule, [i_0_65])). % 0.12/0.40 cnf(i_0_7516, plain, (~young(skc22)), inference(closure_rule, [i_0_65])). % 0.12/0.40 cnf(i_0_7519, plain, (~seat(skc24)), inference(closure_rule, [i_0_63])). % 0.12/0.40 cnf(i_0_7521, plain, (~street(skc26)), inference(closure_rule, [i_0_61])). % 0.12/0.40 cnf(i_0_7522, plain, (~old(skc27)), inference(closure_rule, [i_0_60])). % 0.12/0.40 cnf(i_0_7523, plain, (~event(skc28)), inference(closure_rule, [i_0_59])). % 0.12/0.40 # End printing tableau % 0.12/0.40 # SZS output end % 0.12/0.40 # Branches closed with saturation will be marked with an "s" % 0.12/0.40 # Creating equality axioms % 0.12/0.40 # Ran out of tableaux, making start rules for all clauses % 0.12/0.40 # 32604 Satisfiable branch % 0.12/0.40 # Creating equality axioms % 0.12/0.40 # Ran out of tableaux, making start rules for all clauses % 0.12/0.40 # 32606 Satisfiable branch % 0.12/0.40 # Satisfiable branch found. % 0.12/0.40 # There were 1 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 0 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 0 successful branch saturations after the branch. % 0.12/0.40 # Creating equality axioms % 0.12/0.40 # Ran out of tableaux, making start rules for all clauses % 0.12/0.40 # 32607 Satisfiable branch % 0.12/0.40 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # Begin clausification derivation % 0.12/0.40 % 0.12/0.40 # End clausification derivation % 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.40 cnf(i_0_58, negated_conjecture, (city(skc29))). % 0.12/0.40 cnf(i_0_66, negated_conjecture, (city(skc21))). % 0.12/0.40 cnf(i_0_59, negated_conjecture, (event(skc28))). % 0.12/0.40 cnf(i_0_67, negated_conjecture, (event(skc20))). % 0.12/0.40 cnf(i_0_60, negated_conjecture, (old(skc27))). % 0.12/0.40 cnf(i_0_68, negated_conjecture, (old(skc19))). % 0.12/0.40 cnf(i_0_61, negated_conjecture, (street(skc26))). % 0.12/0.40 cnf(i_0_69, negated_conjecture, (street(skc18))). % 0.12/0.40 cnf(i_0_62, negated_conjecture, (front(skc25))). % 0.12/0.40 cnf(i_0_63, negated_conjecture, (seat(skc24))). % 0.12/0.40 cnf(i_0_70, negated_conjecture, (seat(skc17))). % 0.12/0.40 cnf(i_0_64, negated_conjecture, (fellow(skc23))). % 0.12/0.40 cnf(i_0_72, negated_conjecture, (fellow(skc15))). % 0.12/0.40 cnf(i_0_65, negated_conjecture, (young(skc22))). % 0.12/0.40 cnf(i_0_71, negated_conjecture, (young(skc16))). % 0.12/0.40 cnf(i_0_112, negated_conjecture, (skc16!=skc15|~ssSkC0)). % 0.12/0.40 cnf(i_0_111, negated_conjecture, (ssSkC0|skc22!=skc23)). % 0.12/0.40 cnf(i_0_84, negated_conjecture, (ssSkC0|front(skc24))). % 0.12/0.40 cnf(i_0_99, negated_conjecture, (front(skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_97, negated_conjecture, (fellow(skc16)|~ssSkC0)). % 0.12/0.40 cnf(i_0_95, negated_conjecture, (young(skc15)|~ssSkC0)). % 0.12/0.40 cnf(i_0_88, negated_conjecture, (lonely(skc18)|~ssSkC0)). % 0.12/0.40 cnf(i_0_80, negated_conjecture, (ssSkC0|seat(skc25))). % 0.12/0.40 cnf(i_0_89, negated_conjecture, (way(skc18)|~ssSkC0)). % 0.12/0.40 cnf(i_0_90, negated_conjecture, (chevy(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_91, negated_conjecture, (car(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_92, negated_conjecture, (white(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_82, negated_conjecture, (ssSkC0|fellow(skc22))). % 0.12/0.40 cnf(i_0_86, negated_conjecture, (ssSkC0|young(skc23))). % 0.12/0.40 cnf(i_0_93, negated_conjecture, (dirty(skc19)|~ssSkC0)). % 0.12/0.40 cnf(i_0_94, negated_conjecture, (hollywood(skc21)|~ssSkC0)). % 0.12/0.40 cnf(i_0_100, negated_conjecture, (furniture(skc17)|~ssSkC0)). % 0.12/0.40 cnf(i_0_98, negated_conjecture, (man(skc16)|~ssSkC0)). % 0.12/0.40 cnf(i_0_73, negated_conjecture, (lonely(skc26)|ssSkC0)). % 0.18/0.40 cnf(i_0_96, negated_conjecture, (man(skc15)|~ssSkC0)). % 0.18/0.40 cnf(i_0_74, negated_conjecture, (way(skc26)|ssSkC0)). % 0.18/0.40 cnf(i_0_75, negated_conjecture, (chevy(skc27)|ssSkC0)). % 0.18/0.40 cnf(i_0_76, negated_conjecture, (car(skc27)|ssSkC0)). % 0.18/0.40 cnf(i_0_77, negated_conjecture, (white(skc27)|ssSkC0)). % 0.18/0.40 cnf(i_0_78, negated_conjecture, (dirty(skc27)|ssSkC0)). % 0.18/0.40 cnf(i_0_79, negated_conjecture, (hollywood(skc29)|ssSkC0)). % 0.18/0.40 cnf(i_0_81, negated_conjecture, (furniture(skc25)|ssSkC0)). % 0.18/0.40 cnf(i_0_85, negated_conjecture, (furniture(skc24)|ssSkC0)). % 0.18/0.40 cnf(i_0_87, negated_conjecture, (man(skc23)|ssSkC0)). % 0.18/0.40 cnf(i_0_83, negated_conjecture, (man(skc22)|ssSkC0)). % 0.18/0.40 cnf(i_0_106, negated_conjecture, (down(skc20,skc18)|~ssSkC0)). % 0.18/0.40 cnf(i_0_107, negated_conjecture, (barrel(skc20,skc19)|~ssSkC0)). % 0.18/0.40 cnf(i_0_108, negated_conjecture, (in(skc20,skc21)|~ssSkC0)). % 0.18/0.40 cnf(i_0_110, negated_conjecture, (in(skc16,skc17)|~ssSkC0)). % 0.18/0.40 cnf(i_0_101, negated_conjecture, (down(skc28,skc26)|ssSkC0)). % 0.18/0.40 cnf(i_0_102, negated_conjecture, (barrel(skc28,skc27)|ssSkC0)). % 0.18/0.40 cnf(i_0_109, negated_conjecture, (in(skc15,skc17)|~ssSkC0)). % 0.18/0.40 cnf(i_0_103, negated_conjecture, (in(skc28,skc29)|ssSkC0)). % 0.18/0.40 cnf(i_0_105, negated_conjecture, (in(skc23,skc24)|ssSkC0)). % 0.18/0.40 cnf(i_0_104, negated_conjecture, (in(skc22,skc25)|ssSkC0)). % 0.18/0.40 cnf(i_0_113, negated_conjecture, (X1=X2|ssSkC0|~in(X2,X3)|~in(X1,X3)|~in(X4,X5)|~barrel(X4,X6)|~down(X4,X7)|~man(X2)|~man(X1)|~furniture(X3)|~hollywood(X5)|~dirty(X6)|~white(X6)|~car(X6)|~chevy(X6)|~way(X7)|~lonely(X7)|~young(X2)|~young(X1)|~fellow(X2)|~fellow(X1)|~seat(X3)|~front(X3)|~street(X7)|~old(X6)|~event(X4)|~city(X5))). % 0.18/0.40 cnf(i_0_114, negated_conjecture, (X1=X2|~in(X2,X3)|~in(X1,X4)|~in(X5,X6)|~barrel(X5,X7)|~down(X5,X8)|~man(X2)|~man(X1)|~furniture(X3)|~furniture(X4)|~hollywood(X6)|~dirty(X7)|~white(X7)|~car(X7)|~chevy(X7)|~way(X8)|~lonely(X8)|~ssSkC0|~young(X2)|~young(X1)|~fellow(X2)|~fellow(X1)|~seat(X3)|~seat(X4)|~front(X3)|~front(X4)|~street(X8)|~old(X7)|~event(X5)|~city(X6))). % 0.18/0.40 cnf(i_0_8023, plain, (X9=X9)). % 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.40 # Begin printing tableau % 0.18/0.40 # Found 11 steps % 0.18/0.40 cnf(i_0_8023, plain, (skc29=skc29), inference(start_rule)). % 0.18/0.40 cnf(i_0_8199, plain, (skc29=skc29), inference(extension_rule, [i_0_8027])). % 0.18/0.40 cnf(i_0_8346, plain, (~city(skc29)), inference(closure_rule, [i_0_58])). % 0.18/0.40 cnf(i_0_8344, plain, (city(skc29)), inference(extension_rule, [i_0_114])). % 0.18/0.40 cnf(i_0_8445, plain, (~young(skc22)), inference(closure_rule, [i_0_65])). % 0.18/0.40 cnf(i_0_8446, plain, (~young(skc22)), inference(closure_rule, [i_0_65])). % 0.18/0.40 cnf(i_0_8449, plain, (~seat(skc24)), inference(closure_rule, [i_0_63])). % 0.18/0.40 cnf(i_0_8450, plain, (~seat(skc24)), inference(closure_rule, [i_0_63])). % 0.18/0.40 cnf(i_0_8453, plain, (~street(skc26)), inference(closure_rule, [i_0_61])). % 0.18/0.40 cnf(i_0_8454, plain, (~old(skc27)), inference(closure_rule, [i_0_60])). % 0.18/0.40 cnf(i_0_8455, plain, (~event(skc28)), inference(closure_rule, [i_0_59])). % 0.18/0.40 # End printing tableau % 0.18/0.40 # SZS output end % 0.18/0.40 # Branches closed with saturation will be marked with an "s" % 0.18/0.40 # Satisfiable branch found. % 0.18/0.40 # There were 1 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 0 total successful branch saturations. % 0.18/0.40 # There were 0 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 0 successful branch saturations after the branch. % 0.18/0.40 # Child (32608) has found a proof. % 0.18/0.40 % 0.18/0.40 # Proof search is over... % 0.18/0.40 # Freeing feature tree %------------------------------------------------------------------------------