%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP001-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 : n020.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:21 EDT 2022 % Result : Unsatisfiable 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NLP001-1 : TPTP v8.1.0. Released v2.4.0. % 0.11/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 : n020.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 12:37:45 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___208_C18_F1_SE_CS_SP_PS_S4b % 0.12/0.36 # and selection function SelectCQIPrecW. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 30 Number of unprocessed: 29 % 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 # 29 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 29 conjectures. % 0.12/0.36 # There are 29 start rule candidates: % 0.12/0.36 # Found 8 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 29 start rule tableaux created. % 0.12/0.36 # 21 extension rule candidate clauses % 0.12/0.36 # 8 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There were 10 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 10 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 10 successful branch saturations after the branch. % 0.12/0.38 # There were 10 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 10 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 10 successful branch saturations after the branch. % 0.12/0.38 # There were 10 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 10 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 10 successful branch saturations after the branch. % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_31, negated_conjecture, (hollywood(skc15))). % 0.12/0.38 cnf(i_0_35, negated_conjecture, (hollywood(skc11))). % 0.12/0.38 cnf(i_0_32, negated_conjecture, (event(skc14))). % 0.12/0.38 cnf(i_0_36, negated_conjecture, (event(skc10))). % 0.12/0.38 cnf(i_0_33, negated_conjecture, (street(skc13))). % 0.12/0.38 cnf(i_0_34, negated_conjecture, (old(skc12))). % 0.12/0.38 cnf(i_0_37, negated_conjecture, (chevy(skc9))). % 0.12/0.38 cnf(i_0_38, negated_conjecture, (lonely(skc8))). % 0.12/0.38 cnf(i_0_46, negated_conjecture, (street(skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_48, negated_conjecture, (old(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_51, negated_conjecture, (car(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_39, negated_conjecture, (ssSkC0|chevy(skc12))). % 0.12/0.38 cnf(i_0_50, negated_conjecture, (white(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_49, negated_conjecture, (dirty(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_47, negated_conjecture, (way(skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_52, negated_conjecture, (city(skc11)|~ssSkC0)). % 0.12/0.38 cnf(i_0_43, negated_conjecture, (ssSkC0|lonely(skc13))). % 0.12/0.38 cnf(i_0_40, negated_conjecture, (car(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_41, negated_conjecture, (white(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_42, negated_conjecture, (dirty(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_44, negated_conjecture, (way(skc13)|ssSkC0)). % 0.12/0.38 cnf(i_0_45, negated_conjecture, (city(skc15)|ssSkC0)). % 0.12/0.38 cnf(i_0_53, negated_conjecture, (barrel(skc14,skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_56, negated_conjecture, (barrel(skc10,skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_57, negated_conjecture, (down(skc10,skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_58, negated_conjecture, (in(skc10,skc11)|~ssSkC0)). % 0.12/0.38 cnf(i_0_54, negated_conjecture, (down(skc14,skc13)|ssSkC0)). % 0.12/0.38 cnf(i_0_55, negated_conjecture, (in(skc14,skc15)|ssSkC0)). % 0.12/0.38 cnf(i_0_60, negated_conjecture, (~in(X1,X2)|~down(X1,X3)|~barrel(X1,X4)|~city(X2)|~way(X3)|~dirty(X4)|~white(X4)|~car(X4)|~lonely(X3)|~chevy(X4)|~old(X4)|~street(X3)|~event(X1)|~hollywood(X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 17 steps % 0.12/0.38 cnf(i_0_57, negated_conjecture, (down(skc10,skc8)|~ssSkC0), inference(start_rule)). % 0.12/0.38 cnf(i_0_81, plain, (down(skc10,skc8)), inference(extension_rule, [i_0_60])). % 0.12/0.38 cnf(i_0_131, plain, (~lonely(skc8)), inference(closure_rule, [i_0_38])). % 0.12/0.38 cnf(i_0_132, plain, (~chevy(skc9)), inference(closure_rule, [i_0_37])). % 0.12/0.38 cnf(i_0_135, plain, (~event(skc10)), inference(closure_rule, [i_0_36])). % 0.12/0.38 cnf(i_0_136, plain, (~hollywood(skc11)), inference(closure_rule, [i_0_35])). % 0.12/0.38 cnf(i_0_123, plain, (~in(skc10,skc11)), inference(extension_rule, [i_0_58])). % 0.12/0.38 cnf(i_0_82, plain, (~ssSkC0), inference(etableau_closure_rule, [i_0_82, ...])). % 0.12/0.38 cnf(i_0_125, plain, (~barrel(skc10,skc9)), inference(etableau_closure_rule, [i_0_125, ...])). % 0.12/0.38 cnf(i_0_126, plain, (~city(skc11)), inference(etableau_closure_rule, [i_0_126, ...])). % 0.12/0.38 cnf(i_0_127, plain, (~way(skc8)), inference(etableau_closure_rule, [i_0_127, ...])). % 0.12/0.38 cnf(i_0_128, plain, (~dirty(skc9)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.12/0.38 cnf(i_0_129, plain, (~white(skc9)), inference(etableau_closure_rule, [i_0_129, ...])). % 0.12/0.38 cnf(i_0_130, plain, (~car(skc9)), inference(etableau_closure_rule, [i_0_130, ...])). % 0.12/0.38 cnf(i_0_133, plain, (~old(skc9)), inference(etableau_closure_rule, [i_0_133, ...])). % 0.12/0.38 cnf(i_0_134, plain, (~street(skc8)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.12/0.38 cnf(i_0_142, plain, (~ssSkC0), inference(etableau_closure_rule, [i_0_142, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_31, negated_conjecture, (hollywood(skc15))). % 0.12/0.38 cnf(i_0_35, negated_conjecture, (hollywood(skc11))). % 0.12/0.38 cnf(i_0_32, negated_conjecture, (event(skc14))). % 0.12/0.38 cnf(i_0_36, negated_conjecture, (event(skc10))). % 0.12/0.38 cnf(i_0_33, negated_conjecture, (street(skc13))). % 0.12/0.38 cnf(i_0_34, negated_conjecture, (old(skc12))). % 0.12/0.38 cnf(i_0_37, negated_conjecture, (chevy(skc9))). % 0.12/0.38 cnf(i_0_38, negated_conjecture, (lonely(skc8))). % 0.12/0.38 cnf(i_0_46, negated_conjecture, (street(skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_48, negated_conjecture, (old(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_51, negated_conjecture, (car(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_39, negated_conjecture, (ssSkC0|chevy(skc12))). % 0.12/0.38 cnf(i_0_50, negated_conjecture, (white(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_49, negated_conjecture, (dirty(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_47, negated_conjecture, (way(skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_52, negated_conjecture, (city(skc11)|~ssSkC0)). % 0.12/0.38 cnf(i_0_43, negated_conjecture, (ssSkC0|lonely(skc13))). % 0.12/0.38 cnf(i_0_40, negated_conjecture, (car(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_41, negated_conjecture, (white(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_42, negated_conjecture, (dirty(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_44, negated_conjecture, (way(skc13)|ssSkC0)). % 0.12/0.38 cnf(i_0_45, negated_conjecture, (city(skc15)|ssSkC0)). % 0.12/0.38 cnf(i_0_53, negated_conjecture, (barrel(skc14,skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_56, negated_conjecture, (barrel(skc10,skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_57, negated_conjecture, (down(skc10,skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_58, negated_conjecture, (in(skc10,skc11)|~ssSkC0)). % 0.12/0.38 cnf(i_0_54, negated_conjecture, (down(skc14,skc13)|ssSkC0)). % 0.12/0.38 cnf(i_0_55, negated_conjecture, (in(skc14,skc15)|ssSkC0)). % 0.12/0.38 cnf(i_0_60, negated_conjecture, (~in(X1,X2)|~down(X1,X3)|~barrel(X1,X4)|~city(X2)|~way(X3)|~dirty(X4)|~white(X4)|~car(X4)|~lonely(X3)|~chevy(X4)|~old(X4)|~street(X3)|~event(X1)|~hollywood(X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 17 steps % 0.12/0.38 cnf(i_0_58, negated_conjecture, (in(skc10,skc11)|~ssSkC0), inference(start_rule)). % 0.12/0.38 cnf(i_0_79, plain, (in(skc10,skc11)), inference(extension_rule, [i_0_60])). % 0.12/0.38 cnf(i_0_131, plain, (~lonely(skc8)), inference(closure_rule, [i_0_38])). % 0.12/0.38 cnf(i_0_132, plain, (~chevy(skc9)), inference(closure_rule, [i_0_37])). % 0.12/0.38 cnf(i_0_135, plain, (~event(skc10)), inference(closure_rule, [i_0_36])). % 0.12/0.38 cnf(i_0_136, plain, (~hollywood(skc11)), inference(closure_rule, [i_0_35])). % 0.12/0.38 cnf(i_0_124, plain, (~down(skc10,skc8)), inference(extension_rule, [i_0_57])). % 0.12/0.38 cnf(i_0_80, plain, (~ssSkC0), inference(etableau_closure_rule, [i_0_80, ...])). % 0.12/0.38 cnf(i_0_125, plain, (~barrel(skc10,skc9)), inference(etableau_closure_rule, [i_0_125, ...])). % 0.12/0.38 cnf(i_0_126, plain, (~city(skc11)), inference(etableau_closure_rule, [i_0_126, ...])). % 0.12/0.38 cnf(i_0_127, plain, (~way(skc8)), inference(etableau_closure_rule, [i_0_127, ...])). % 0.12/0.38 cnf(i_0_128, plain, (~dirty(skc9)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.12/0.38 cnf(i_0_129, plain, (~white(skc9)), inference(etableau_closure_rule, [i_0_129, ...])). % 0.12/0.38 cnf(i_0_130, plain, (~car(skc9)), inference(etableau_closure_rule, [i_0_130, ...])). % 0.12/0.38 cnf(i_0_133, plain, (~old(skc9)), inference(etableau_closure_rule, [i_0_133, ...])). % 0.12/0.38 cnf(i_0_134, plain, (~street(skc8)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.12/0.38 cnf(i_0_144, plain, (~ssSkC0), inference(etableau_closure_rule, [i_0_144, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_31, negated_conjecture, (hollywood(skc15))). % 0.12/0.38 cnf(i_0_35, negated_conjecture, (hollywood(skc11))). % 0.12/0.38 cnf(i_0_32, negated_conjecture, (event(skc14))). % 0.12/0.38 cnf(i_0_36, negated_conjecture, (event(skc10))). % 0.12/0.38 cnf(i_0_33, negated_conjecture, (street(skc13))). % 0.12/0.38 cnf(i_0_34, negated_conjecture, (old(skc12))). % 0.12/0.38 cnf(i_0_37, negated_conjecture, (chevy(skc9))). % 0.12/0.38 cnf(i_0_38, negated_conjecture, (lonely(skc8))). % 0.12/0.38 cnf(i_0_46, negated_conjecture, (street(skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_48, negated_conjecture, (old(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_51, negated_conjecture, (car(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_39, negated_conjecture, (ssSkC0|chevy(skc12))). % 0.12/0.38 cnf(i_0_50, negated_conjecture, (white(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_49, negated_conjecture, (dirty(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_47, negated_conjecture, (way(skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_52, negated_conjecture, (city(skc11)|~ssSkC0)). % 0.12/0.38 cnf(i_0_43, negated_conjecture, (ssSkC0|lonely(skc13))). % 0.12/0.38 cnf(i_0_40, negated_conjecture, (car(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_41, negated_conjecture, (white(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_42, negated_conjecture, (dirty(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_44, negated_conjecture, (way(skc13)|ssSkC0)). % 0.12/0.38 cnf(i_0_45, negated_conjecture, (city(skc15)|ssSkC0)). % 0.12/0.38 cnf(i_0_53, negated_conjecture, (barrel(skc14,skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_56, negated_conjecture, (barrel(skc10,skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_57, negated_conjecture, (down(skc10,skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_58, negated_conjecture, (in(skc10,skc11)|~ssSkC0)). % 0.12/0.38 cnf(i_0_54, negated_conjecture, (down(skc14,skc13)|ssSkC0)). % 0.12/0.38 cnf(i_0_55, negated_conjecture, (in(skc14,skc15)|ssSkC0)). % 0.12/0.38 cnf(i_0_60, negated_conjecture, (~in(X1,X2)|~down(X1,X3)|~barrel(X1,X4)|~city(X2)|~way(X3)|~dirty(X4)|~white(X4)|~car(X4)|~lonely(X3)|~chevy(X4)|~old(X4)|~street(X3)|~event(X1)|~hollywood(X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 17 steps % 0.12/0.38 cnf(i_0_56, negated_conjecture, (barrel(skc10,skc9)|~ssSkC0), inference(start_rule)). % 0.12/0.38 cnf(i_0_83, plain, (barrel(skc10,skc9)), inference(extension_rule, [i_0_60])). % 0.12/0.38 cnf(i_0_131, plain, (~lonely(skc8)), inference(closure_rule, [i_0_38])). % 0.12/0.38 cnf(i_0_132, plain, (~chevy(skc9)), inference(closure_rule, [i_0_37])). % 0.12/0.38 cnf(i_0_135, plain, (~event(skc10)), inference(closure_rule, [i_0_36])). % 0.12/0.38 cnf(i_0_136, plain, (~hollywood(skc11)), inference(closure_rule, [i_0_35])). % 0.12/0.38 cnf(i_0_123, plain, (~in(skc10,skc11)), inference(extension_rule, [i_0_58])). % 0.12/0.38 cnf(i_0_84, plain, (~ssSkC0), inference(etableau_closure_rule, [i_0_84, ...])). % 0.12/0.38 cnf(i_0_124, plain, (~down(skc10,skc8)), inference(etableau_closure_rule, [i_0_124, ...])). % 0.12/0.38 cnf(i_0_126, plain, (~city(skc11)), inference(etableau_closure_rule, [i_0_126, ...])). % 0.12/0.38 cnf(i_0_127, plain, (~way(skc8)), inference(etableau_closure_rule, [i_0_127, ...])). % 0.12/0.38 cnf(i_0_128, plain, (~dirty(skc9)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.12/0.38 cnf(i_0_129, plain, (~white(skc9)), inference(etableau_closure_rule, [i_0_129, ...])). % 0.12/0.38 cnf(i_0_130, plain, (~car(skc9)), inference(etableau_closure_rule, [i_0_130, ...])). % 0.12/0.38 cnf(i_0_133, plain, (~old(skc9)), inference(etableau_closure_rule, [i_0_133, ...])). % 0.12/0.38 cnf(i_0_134, plain, (~street(skc8)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.12/0.38 cnf(i_0_142, plain, (~ssSkC0), inference(etableau_closure_rule, [i_0_142, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 10 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 10 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 10 successful branch saturations after the branch. % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_31, negated_conjecture, (hollywood(skc15))). % 0.12/0.38 cnf(i_0_35, negated_conjecture, (hollywood(skc11))). % 0.12/0.38 cnf(i_0_32, negated_conjecture, (event(skc14))). % 0.12/0.38 cnf(i_0_36, negated_conjecture, (event(skc10))). % 0.12/0.38 cnf(i_0_33, negated_conjecture, (street(skc13))). % 0.12/0.38 cnf(i_0_34, negated_conjecture, (old(skc12))). % 0.12/0.38 cnf(i_0_37, negated_conjecture, (chevy(skc9))). % 0.12/0.38 cnf(i_0_38, negated_conjecture, (lonely(skc8))). % 0.12/0.38 cnf(i_0_46, negated_conjecture, (street(skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_48, negated_conjecture, (old(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_51, negated_conjecture, (car(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_39, negated_conjecture, (ssSkC0|chevy(skc12))). % 0.12/0.38 cnf(i_0_50, negated_conjecture, (white(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_49, negated_conjecture, (dirty(skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_47, negated_conjecture, (way(skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_52, negated_conjecture, (city(skc11)|~ssSkC0)). % 0.12/0.38 cnf(i_0_43, negated_conjecture, (ssSkC0|lonely(skc13))). % 0.12/0.38 cnf(i_0_40, negated_conjecture, (car(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_41, negated_conjecture, (white(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_42, negated_conjecture, (dirty(skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_44, negated_conjecture, (way(skc13)|ssSkC0)). % 0.12/0.38 cnf(i_0_45, negated_conjecture, (city(skc15)|ssSkC0)). % 0.12/0.38 cnf(i_0_53, negated_conjecture, (barrel(skc14,skc12)|ssSkC0)). % 0.12/0.38 cnf(i_0_56, negated_conjecture, (barrel(skc10,skc9)|~ssSkC0)). % 0.12/0.38 cnf(i_0_57, negated_conjecture, (down(skc10,skc8)|~ssSkC0)). % 0.12/0.38 cnf(i_0_58, negated_conjecture, (in(skc10,skc11)|~ssSkC0)). % 0.12/0.38 cnf(i_0_54, negated_conjecture, (down(skc14,skc13)|ssSkC0)). % 0.12/0.38 cnf(i_0_55, negated_conjecture, (in(skc14,skc15)|ssSkC0)). % 0.12/0.38 cnf(i_0_60, negated_conjecture, (~in(X1,X2)|~down(X1,X3)|~barrel(X1,X4)|~city(X2)|~way(X3)|~dirty(X4)|~white(X4)|~car(X4)|~lonely(X3)|~chevy(X4)|~old(X4)|~street(X3)|~event(X1)|~hollywood(X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 17 steps % 0.12/0.38 cnf(i_0_54, negated_conjecture, (down(skc14,skc13)|ssSkC0), inference(start_rule)). % 0.12/0.38 cnf(i_0_77, plain, (down(skc14,skc13)), inference(extension_rule, [i_0_60])). % 0.12/0.38 cnf(i_0_132, plain, (~chevy(skc9)), inference(closure_rule, [i_0_37])). % 0.12/0.38 cnf(i_0_134, plain, (~street(skc13)), inference(closure_rule, [i_0_33])). % 0.12/0.38 cnf(i_0_135, plain, (~event(skc14)), inference(closure_rule, [i_0_32])). % 0.12/0.38 cnf(i_0_123, plain, (~in(skc14,skc15)), inference(extension_rule, [i_0_55])). % 0.12/0.38 cnf(i_0_136, plain, (~hollywood(skc15)), inference(closure_rule, [i_0_31])). % 0.12/0.38 cnf(i_0_78, plain, (ssSkC0), inference(etableau_closure_rule, [i_0_78, ...])). % 0.12/0.38 cnf(i_0_125, plain, (~barrel(skc14,skc9)), inference(etableau_closure_rule, [i_0_125, ...])). % 0.12/0.38 cnf(i_0_126, plain, (~city(skc15)), inference(etableau_closure_rule, [i_0_126, ...])). % 0.12/0.38 cnf(i_0_127, plain, (~way(skc13)), inference(etableau_closure_rule, [i_0_127, ...])). % 0.12/0.38 cnf(i_0_128, plain, (~dirty(skc9)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.12/0.38 cnf(i_0_129, plain, (~white(skc9)), inference(etableau_closure_rule, [i_0_129, ...])). % 0.12/0.38 cnf(i_0_130, plain, (~car(skc9)), inference(etableau_closure_rule, [i_0_130, ...])). % 0.12/0.38 cnf(i_0_131, plain, (~lonely(skc13)), inference(etableau_closure_rule, [i_0_131, ...])). % 0.12/0.38 cnf(i_0_133, plain, (~old(skc9)), inference(etableau_closure_rule, [i_0_133, ...])). % 0.12/0.38 cnf(i_0_192, plain, (ssSkC0), inference(etableau_closure_rule, [i_0_192, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (19221) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------