%------------------------------------------------------------------------------ % 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 : n029.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 : Unsatisfiable 0.20s 0.42s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : NLP009-1 : TPTP v8.1.0. Released v2.4.0. % 0.07/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 : n029.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 07:31:54 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 54 Number of unprocessed: 53 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # 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 # 53 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 53 conjectures. % 0.13/0.38 # There are 53 start rule candidates: % 0.13/0.38 # Found 14 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 53 start rule tableaux created. % 0.13/0.38 # 39 extension rule candidate clauses % 0.13/0.38 # 14 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.42 # There were 19 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 2 free duplicated saturations. % 0.20/0.42 # There were 19 total successful branch saturations. % 0.20/0.42 # There were 10 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 7 successful branch saturations after the branch. % 0.20/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_55, negated_conjecture, (hollywood(skc27))). % 0.20/0.42 cnf(i_0_62, negated_conjecture, (hollywood(skc20))). % 0.20/0.42 cnf(i_0_56, negated_conjecture, (event(skc26))). % 0.20/0.42 cnf(i_0_63, negated_conjecture, (event(skc19))). % 0.20/0.42 cnf(i_0_57, negated_conjecture, (street(skc25))). % 0.20/0.42 cnf(i_0_58, negated_conjecture, (old(skc24))). % 0.20/0.42 cnf(i_0_59, negated_conjecture, (seat(skc23))). % 0.20/0.42 cnf(i_0_66, negated_conjecture, (seat(skc16))). % 0.20/0.42 cnf(i_0_60, negated_conjecture, (young(skc22))). % 0.20/0.42 cnf(i_0_67, negated_conjecture, (young(skc15))). % 0.20/0.42 cnf(i_0_61, negated_conjecture, (fellow(skc21))). % 0.20/0.42 cnf(i_0_68, negated_conjecture, (fellow(skc14))). % 0.20/0.42 cnf(i_0_64, negated_conjecture, (chevy(skc18))). % 0.20/0.42 cnf(i_0_65, negated_conjecture, (lonely(skc17))). % 0.20/0.42 cnf(i_0_106, negated_conjecture, (skc14!=skc15|~ssSkC0)). % 0.20/0.42 cnf(i_0_105, negated_conjecture, (ssSkC0|skc21!=skc22)). % 0.20/0.42 cnf(i_0_76, negated_conjecture, (ssSkC0|young(skc21))). % 0.20/0.42 cnf(i_0_78, negated_conjecture, (ssSkC0|fellow(skc22))). % 0.20/0.42 cnf(i_0_82, negated_conjecture, (street(skc17)|~ssSkC0)). % 0.20/0.42 cnf(i_0_84, negated_conjecture, (old(skc18)|~ssSkC0)). % 0.20/0.42 cnf(i_0_89, negated_conjecture, (young(skc14)|~ssSkC0)). % 0.20/0.42 cnf(i_0_91, negated_conjecture, (fellow(skc15)|~ssSkC0)). % 0.20/0.42 cnf(i_0_69, negated_conjecture, (ssSkC0|chevy(skc24))). % 0.20/0.42 cnf(i_0_87, negated_conjecture, (car(skc18)|~ssSkC0)). % 0.20/0.42 cnf(i_0_86, negated_conjecture, (white(skc18)|~ssSkC0)). % 0.20/0.42 cnf(i_0_85, negated_conjecture, (dirty(skc18)|~ssSkC0)). % 0.20/0.42 cnf(i_0_83, negated_conjecture, (way(skc17)|~ssSkC0)). % 0.20/0.42 cnf(i_0_73, negated_conjecture, (ssSkC0|lonely(skc25))). % 0.20/0.42 cnf(i_0_70, negated_conjecture, (car(skc24)|ssSkC0)). % 0.20/0.42 cnf(i_0_88, negated_conjecture, (city(skc20)|~ssSkC0)). % 0.20/0.42 cnf(i_0_92, negated_conjecture, (man(skc15)|~ssSkC0)). % 0.20/0.42 cnf(i_0_90, negated_conjecture, (man(skc14)|~ssSkC0)). % 0.20/0.42 cnf(i_0_93, negated_conjecture, (front(skc16)|~ssSkC0)). % 0.20/0.42 cnf(i_0_71, negated_conjecture, (white(skc24)|ssSkC0)). % 0.20/0.42 cnf(i_0_94, negated_conjecture, (furniture(skc16)|~ssSkC0)). % 0.20/0.42 cnf(i_0_72, negated_conjecture, (dirty(skc24)|ssSkC0)). % 0.20/0.42 cnf(i_0_74, negated_conjecture, (way(skc25)|ssSkC0)). % 0.20/0.42 cnf(i_0_75, negated_conjecture, (city(skc27)|ssSkC0)). % 0.20/0.42 cnf(i_0_79, negated_conjecture, (man(skc22)|ssSkC0)). % 0.20/0.42 cnf(i_0_77, negated_conjecture, (man(skc21)|ssSkC0)). % 0.20/0.42 cnf(i_0_80, negated_conjecture, (front(skc23)|ssSkC0)). % 0.20/0.42 cnf(i_0_81, negated_conjecture, (furniture(skc23)|ssSkC0)). % 0.20/0.42 cnf(i_0_100, negated_conjecture, (barrel(skc19,skc18)|~ssSkC0)). % 0.20/0.42 cnf(i_0_101, negated_conjecture, (down(skc19,skc17)|~ssSkC0)). % 0.20/0.42 cnf(i_0_95, negated_conjecture, (barrel(skc26,skc24)|ssSkC0)). % 0.20/0.42 cnf(i_0_102, negated_conjecture, (in(skc19,skc20)|~ssSkC0)). % 0.20/0.42 cnf(i_0_104, negated_conjecture, (in(skc15,skc16)|~ssSkC0)). % 0.20/0.42 cnf(i_0_103, negated_conjecture, (in(skc14,skc16)|~ssSkC0)). % 0.20/0.42 cnf(i_0_96, negated_conjecture, (down(skc26,skc25)|ssSkC0)). % 0.20/0.42 cnf(i_0_97, negated_conjecture, (in(skc26,skc27)|ssSkC0)). % 0.20/0.42 cnf(i_0_99, negated_conjecture, (in(skc22,skc23)|ssSkC0)). % 0.20/0.42 cnf(i_0_98, negated_conjecture, (in(skc21,skc23)|ssSkC0)). % 0.20/0.42 cnf(i_0_107, negated_conjecture, (X1=X2|~in(X2,X3)|~in(X1,X3)|~in(X4,X5)|~down(X4,X6)|~barrel(X4,X7)|~furniture(X3)|~front(X3)|~man(X2)|~man(X1)|~city(X5)|~way(X6)|~dirty(X7)|~white(X7)|~car(X7)|~lonely(X6)|~chevy(X7)|~fellow(X2)|~fellow(X1)|~young(X2)|~young(X1)|~seat(X3)|~old(X7)|~street(X6)|~event(X4)|~hollywood(X5))). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 29 steps % 0.20/0.42 cnf(i_0_97, negated_conjecture, (in(skc26,skc27)|ssSkC0), inference(start_rule)). % 0.20/0.42 cnf(i_0_140, plain, (ssSkC0), inference(extension_rule, [i_0_103])). % 0.20/0.42 cnf(i_0_973, plain, (in(skc14,skc16)), inference(extension_rule, [i_0_107])). % 0.20/0.42 cnf(i_0_1051, plain, (~in(skc14,skc16)), inference(closure_rule, [i_0_973])). % 0.20/0.42 cnf(i_0_1052, plain, (~in(skc14,skc16)), inference(closure_rule, [i_0_973])). % 0.20/0.42 cnf(i_0_1064, plain, (~lonely(skc17)), inference(closure_rule, [i_0_65])). % 0.20/0.42 cnf(i_0_1065, plain, (~chevy(skc18)), inference(closure_rule, [i_0_64])). % 0.20/0.42 cnf(i_0_1066, plain, (~fellow(skc14)), inference(closure_rule, [i_0_68])). % 0.20/0.42 cnf(i_0_1067, plain, (~fellow(skc14)), inference(closure_rule, [i_0_68])). % 0.20/0.42 cnf(i_0_1070, plain, (~seat(skc16)), inference(closure_rule, [i_0_66])). % 0.20/0.42 cnf(i_0_139, plain, (in(skc26,skc27)), inference(etableau_closure_rule, [i_0_139, ...])). % 0.20/0.42 cnf(i_0_1049, plain, (skc14=skc14), inference(etableau_closure_rule, [i_0_1049, ...])). % 0.20/0.42 cnf(i_0_1053, plain, (~down(skc14,skc17)), inference(etableau_closure_rule, [i_0_1053, ...])). % 0.20/0.42 cnf(i_0_1054, plain, (~barrel(skc14,skc18)), inference(etableau_closure_rule, [i_0_1054, ...])). % 0.20/0.42 cnf(i_0_1055, plain, (~furniture(skc16)), inference(etableau_closure_rule, [i_0_1055, ...])). % 0.20/0.42 cnf(i_0_1056, plain, (~front(skc16)), inference(etableau_closure_rule, [i_0_1056, ...])). % 0.20/0.42 cnf(i_0_1057, plain, (~man(skc14)), inference(etableau_closure_rule, [i_0_1057, ...])). % 0.20/0.42 cnf(i_0_1058, plain, (~man(skc14)), inference(etableau_closure_rule, [i_0_1058, ...])). % 0.20/0.42 cnf(i_0_1059, plain, (~city(skc16)), inference(etableau_closure_rule, [i_0_1059, ...])). % 0.20/0.42 cnf(i_0_1060, plain, (~way(skc17)), inference(etableau_closure_rule, [i_0_1060, ...])). % 0.20/0.42 cnf(i_0_1061, plain, (~dirty(skc18)), inference(etableau_closure_rule, [i_0_1061, ...])). % 0.20/0.42 cnf(i_0_1062, plain, (~white(skc18)), inference(etableau_closure_rule, [i_0_1062, ...])). % 0.20/0.42 cnf(i_0_1063, plain, (~car(skc18)), inference(etableau_closure_rule, [i_0_1063, ...])). % 0.20/0.42 cnf(i_0_1068, plain, (~young(skc14)), inference(etableau_closure_rule, [i_0_1068, ...])). % 0.20/0.42 cnf(i_0_1069, plain, (~young(skc14)), inference(etableau_closure_rule, [i_0_1069, ...])). % 0.20/0.42 cnf(i_0_1071, plain, (~old(skc18)), inference(etableau_closure_rule, [i_0_1071, ...])). % 0.20/0.42 cnf(i_0_1072, plain, (~street(skc17)), inference(etableau_closure_rule, [i_0_1072, ...])). % 0.20/0.42 cnf(i_0_1073, plain, (~event(skc14)), inference(etableau_closure_rule, [i_0_1073, ...])). % 0.20/0.42 cnf(i_0_1074, plain, (~hollywood(skc16)), inference(etableau_closure_rule, [i_0_1074, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # Child (12049) has found a proof. % 0.20/0.43 % 0.20/0.43 # Proof search is over... % 0.20/0.43 # Freeing feature tree %------------------------------------------------------------------------------