%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP009+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 : n007.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:31 EDT 2022 % Result : Theorem 0.19s 0.41s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NLP009+1 : TPTP v8.1.0. Released v2.4.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n007.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Fri Jul 1 00:24:09 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: 59 Number of unprocessed: 59 % 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 # 59 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 0 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 59 extension rule candidate clauses % 0.12/0.37 # 0 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Returning from population with 29 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 29 tableaux to operate on % 0.19/0.41 # There were 22 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 3 free duplicated saturations. % 0.19/0.41 # There were 22 total successful branch saturations. % 0.19/0.41 # There were 16 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 3 successful branch saturations after the branch. % 0.19/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0)). % 0.19/0.41 cnf(i_0_13, plain, (epred1_0|esk6_0!=esk5_0)). % 0.19/0.41 cnf(i_0_42, plain, (epred2_0|esk15_0!=esk14_0)). % 0.19/0.41 cnf(i_0_6, plain, (esk8_0=esk5_0|epred1_0)). % 0.19/0.41 cnf(i_0_4, plain, (esk9_0=esk6_0|epred1_0)). % 0.19/0.41 cnf(i_0_35, plain, (esk17_0=esk14_0|epred2_0)). % 0.19/0.41 cnf(i_0_33, plain, (esk18_0=esk15_0|epred2_0)). % 0.19/0.41 cnf(i_0_30, plain, (epred1_0|hollywood(esk1_0))). % 0.19/0.41 cnf(i_0_29, plain, (epred1_0|city(esk1_0))). % 0.19/0.41 cnf(i_0_28, plain, (epred1_0|event(esk2_0))). % 0.19/0.41 cnf(i_0_27, plain, (epred1_0|street(esk3_0))). % 0.19/0.41 cnf(i_0_26, plain, (epred1_0|way(esk3_0))). % 0.19/0.41 cnf(i_0_25, plain, (epred1_0|lonely(esk3_0))). % 0.19/0.41 cnf(i_0_24, plain, (epred1_0|chevy(esk4_0))). % 0.19/0.41 cnf(i_0_23, plain, (epred1_0|car(esk4_0))). % 0.19/0.41 cnf(i_0_22, plain, (epred1_0|white(esk4_0))). % 0.19/0.41 cnf(i_0_21, plain, (epred1_0|dirty(esk4_0))). % 0.19/0.41 cnf(i_0_20, plain, (epred1_0|old(esk4_0))). % 0.19/0.41 cnf(i_0_16, plain, (epred1_0|seat(esk7_0))). % 0.19/0.41 cnf(i_0_15, plain, (epred1_0|furniture(esk7_0))). % 0.19/0.41 cnf(i_0_14, plain, (epred1_0|front(esk7_0))). % 0.19/0.41 cnf(i_0_12, plain, (epred1_0|fellow(esk5_0))). % 0.19/0.41 cnf(i_0_9, plain, (epred1_0|fellow(esk6_0))). % 0.19/0.41 cnf(i_0_11, plain, (epred1_0|man(esk5_0))). % 0.19/0.41 cnf(i_0_8, plain, (epred1_0|man(esk6_0))). % 0.19/0.41 cnf(i_0_10, plain, (epred1_0|young(esk5_0))). % 0.19/0.41 cnf(i_0_7, plain, (epred1_0|young(esk6_0))). % 0.19/0.41 cnf(i_0_59, plain, (epred2_0|hollywood(esk10_0))). % 0.19/0.41 cnf(i_0_58, plain, (epred2_0|city(esk10_0))). % 0.19/0.41 cnf(i_0_57, plain, (epred2_0|event(esk11_0))). % 0.19/0.41 cnf(i_0_51, plain, (epred2_0|street(esk13_0))). % 0.19/0.41 cnf(i_0_50, plain, (epred2_0|way(esk13_0))). % 0.19/0.41 cnf(i_0_49, plain, (epred2_0|lonely(esk13_0))). % 0.19/0.41 cnf(i_0_56, plain, (epred2_0|chevy(esk12_0))). % 0.19/0.41 cnf(i_0_55, plain, (epred2_0|car(esk12_0))). % 0.19/0.41 cnf(i_0_54, plain, (epred2_0|white(esk12_0))). % 0.19/0.41 cnf(i_0_53, plain, (epred2_0|dirty(esk12_0))). % 0.19/0.41 cnf(i_0_52, plain, (epred2_0|old(esk12_0))). % 0.19/0.41 cnf(i_0_45, plain, (epred2_0|seat(esk16_0))). % 0.19/0.41 cnf(i_0_44, plain, (epred2_0|furniture(esk16_0))). % 0.19/0.41 cnf(i_0_43, plain, (epred2_0|front(esk16_0))). % 0.19/0.41 cnf(i_0_41, plain, (epred2_0|fellow(esk14_0))). % 0.19/0.41 cnf(i_0_38, plain, (epred2_0|fellow(esk15_0))). % 0.19/0.41 cnf(i_0_40, plain, (epred2_0|man(esk14_0))). % 0.19/0.41 cnf(i_0_37, plain, (epred2_0|man(esk15_0))). % 0.19/0.41 cnf(i_0_39, plain, (epred2_0|young(esk14_0))). % 0.19/0.41 cnf(i_0_36, plain, (epred2_0|young(esk15_0))). % 0.19/0.41 cnf(i_0_19, plain, (epred1_0|barrel(esk2_0,esk4_0))). % 0.19/0.41 cnf(i_0_18, plain, (epred1_0|down(esk2_0,esk3_0))). % 0.19/0.41 cnf(i_0_17, plain, (epred1_0|in(esk2_0,esk1_0))). % 0.19/0.41 cnf(i_0_5, plain, (epred1_0|in(esk8_0,esk7_0))). % 0.19/0.41 cnf(i_0_3, plain, (epred1_0|in(esk9_0,esk7_0))). % 0.19/0.41 cnf(i_0_48, plain, (epred2_0|barrel(esk11_0,esk12_0))). % 0.19/0.41 cnf(i_0_47, plain, (epred2_0|down(esk11_0,esk13_0))). % 0.19/0.41 cnf(i_0_46, plain, (epred2_0|in(esk11_0,esk10_0))). % 0.19/0.41 cnf(i_0_34, plain, (epred2_0|in(esk17_0,esk16_0))). % 0.19/0.41 cnf(i_0_32, plain, (epred2_0|in(esk18_0,esk16_0))). % 0.19/0.41 cnf(i_0_2, plain, (X1=X2|epred1_0|~young(X2)|~young(X1)|~man(X2)|~man(X1)|~fellow(X2)|~fellow(X1)|~front(X3)|~furniture(X3)|~seat(X3)|~in(X2,X3)|~in(X1,X3)|~in(X4,X5)|~down(X4,X6)|~barrel(X4,X7)|~old(X7)|~dirty(X7)|~white(X7)|~car(X7)|~chevy(X7)|~lonely(X6)|~way(X6)|~street(X6)|~event(X4)|~city(X5)|~hollywood(X5))). % 0.19/0.41 cnf(i_0_31, plain, (X1=X2|epred2_0|~young(X2)|~young(X1)|~man(X2)|~man(X1)|~fellow(X2)|~fellow(X1)|~front(X3)|~furniture(X3)|~seat(X3)|~in(X2,X3)|~in(X1,X3)|~in(X4,X5)|~down(X4,X6)|~barrel(X4,X7)|~old(X7)|~dirty(X7)|~white(X7)|~car(X7)|~chevy(X7)|~lonely(X6)|~way(X6)|~street(X6)|~event(X4)|~city(X5)|~hollywood(X5))). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 34 steps % 0.19/0.41 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0), inference(start_rule)). % 0.19/0.41 cnf(i_0_64, plain, (~epred2_0), inference(extension_rule, [i_0_39])). % 0.19/0.41 cnf(i_0_155, plain, (young(esk14_0)), inference(extension_rule, [i_0_2])). % 0.19/0.41 cnf(i_0_349, plain, (~young(esk14_0)), inference(closure_rule, [i_0_155])). % 0.19/0.41 cnf(i_0_65, plain, (~epred1_0), inference(etableau_closure_rule, [i_0_65, ...])). % 0.19/0.41 cnf(i_0_346, plain, (esk14_0=esk14_0), inference(etableau_closure_rule, [i_0_346, ...])). % 0.19/0.41 cnf(i_0_347, plain, (epred1_0), inference(etableau_closure_rule, [i_0_347, ...])). % 0.19/0.41 cnf(i_0_350, plain, (~man(esk14_0)), inference(etableau_closure_rule, [i_0_350, ...])). % 0.19/0.41 cnf(i_0_351, plain, (~man(esk14_0)), inference(etableau_closure_rule, [i_0_351, ...])). % 0.19/0.41 cnf(i_0_352, plain, (~fellow(esk14_0)), inference(etableau_closure_rule, [i_0_352, ...])). % 0.19/0.41 cnf(i_0_353, plain, (~fellow(esk14_0)), inference(etableau_closure_rule, [i_0_353, ...])). % 0.19/0.41 cnf(i_0_354, plain, (~front(esk16_0)), inference(extension_rule, [i_0_43])). % 0.19/0.41 cnf(i_0_499, plain, (epred2_0), inference(closure_rule, [i_0_64])). % 0.19/0.41 cnf(i_0_355, plain, (~furniture(esk16_0)), inference(etableau_closure_rule, [i_0_355, ...])). % 0.19/0.41 cnf(i_0_356, plain, (~seat(esk16_0)), inference(etableau_closure_rule, [i_0_356, ...])). % 0.19/0.41 cnf(i_0_357, plain, (~in(esk14_0,esk16_0)), inference(etableau_closure_rule, [i_0_357, ...])). % 0.19/0.41 cnf(i_0_358, plain, (~in(esk14_0,esk16_0)), inference(etableau_closure_rule, [i_0_358, ...])). % 0.19/0.41 cnf(i_0_359, plain, (~in(esk11_0,esk10_0)), inference(extension_rule, [i_0_46])). % 0.19/0.41 cnf(i_0_605, plain, (epred2_0), inference(closure_rule, [i_0_64])). % 0.19/0.41 cnf(i_0_370, plain, (~event(esk11_0)), inference(etableau_closure_rule, [i_0_370, ...])). % 0.19/0.41 cnf(i_0_371, plain, (~city(esk10_0)), inference(etableau_closure_rule, [i_0_371, ...])). % 0.19/0.41 cnf(i_0_372, plain, (~hollywood(esk10_0)), inference(etableau_closure_rule, [i_0_372, ...])). % 0.19/0.41 cnf(i_0_360, plain, (~down(esk11_0,esk13_0)), inference(extension_rule, [i_0_47])). % 0.19/0.41 cnf(i_0_709, plain, (epred2_0), inference(closure_rule, [i_0_64])). % 0.19/0.41 cnf(i_0_367, plain, (~lonely(esk13_0)), inference(etableau_closure_rule, [i_0_367, ...])). % 0.19/0.41 cnf(i_0_368, plain, (~way(esk13_0)), inference(etableau_closure_rule, [i_0_368, ...])). % 0.19/0.41 cnf(i_0_369, plain, (~street(esk13_0)), inference(etableau_closure_rule, [i_0_369, ...])). % 0.19/0.41 cnf(i_0_361, plain, (~barrel(esk11_0,esk12_0)), inference(extension_rule, [i_0_48])). % 0.19/0.41 cnf(i_0_811, plain, (epred2_0), inference(closure_rule, [i_0_64])). % 0.19/0.41 cnf(i_0_362, plain, (~old(esk12_0)), inference(etableau_closure_rule, [i_0_362, ...])). % 0.19/0.41 cnf(i_0_363, plain, (~dirty(esk12_0)), inference(etableau_closure_rule, [i_0_363, ...])). % 0.19/0.41 cnf(i_0_364, plain, (~white(esk12_0)), inference(etableau_closure_rule, [i_0_364, ...])). % 0.19/0.41 cnf(i_0_365, plain, (~car(esk12_0)), inference(etableau_closure_rule, [i_0_365, ...])). % 0.19/0.41 cnf(i_0_366, plain, (~chevy(esk12_0)), inference(etableau_closure_rule, [i_0_366, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # Child (1137) has found a proof. % 0.19/0.42 % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------