%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP007-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 : n021.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:29 EDT 2022 % Result : Unsatisfiable 0.20s 0.43s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NLP007-1 : TPTP v8.1.0. Released v2.4.0. % 0.00/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n021.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jul 1 01:48:28 EDT 2022 % 0.13/0.33 % CPUTime : % 0.20/0.36 # No SInE strategy applied % 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.36 # % 0.20/0.36 # Presaturation interreduction done % 0.20/0.36 # Number of axioms: 60 Number of unprocessed: 59 % 0.20/0.36 # Tableaux proof search. % 0.20/0.36 # APR header successfully linked. % 0.20/0.36 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 59 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 59 conjectures. % 0.20/0.37 # There are 59 start rule candidates: % 0.20/0.37 # Found 16 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 59 start rule tableaux created. % 0.20/0.37 # 43 extension rule candidate clauses % 0.20/0.37 # 16 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.43 # There were 21 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 4 free duplicated saturations. % 0.20/0.43 # There were 21 total successful branch saturations. % 0.20/0.43 # There were 10 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 7 successful branch saturations after the branch. % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_61, negated_conjecture, (city(skc31))). % 0.20/0.43 cnf(i_0_69, negated_conjecture, (city(skc23))). % 0.20/0.43 cnf(i_0_62, negated_conjecture, (event(skc30))). % 0.20/0.43 cnf(i_0_70, negated_conjecture, (event(skc22))). % 0.20/0.43 cnf(i_0_63, negated_conjecture, (old(skc29))). % 0.20/0.43 cnf(i_0_71, negated_conjecture, (old(skc21))). % 0.20/0.43 cnf(i_0_64, negated_conjecture, (street(skc28))). % 0.20/0.43 cnf(i_0_72, negated_conjecture, (street(skc20))). % 0.20/0.43 cnf(i_0_65, negated_conjecture, (seat(skc27))). % 0.20/0.43 cnf(i_0_74, negated_conjecture, (seat(skc18))). % 0.20/0.43 cnf(i_0_66, negated_conjecture, (front(skc26))). % 0.20/0.43 cnf(i_0_73, negated_conjecture, (front(skc19))). % 0.20/0.43 cnf(i_0_67, negated_conjecture, (fellow(skc25))). % 0.20/0.43 cnf(i_0_75, negated_conjecture, (fellow(skc17))). % 0.20/0.43 cnf(i_0_68, negated_conjecture, (young(skc24))). % 0.20/0.43 cnf(i_0_76, negated_conjecture, (young(skc16))). % 0.20/0.43 cnf(i_0_118, negated_conjecture, (skc16!=skc17|~ssSkC0)). % 0.20/0.43 cnf(i_0_117, negated_conjecture, (ssSkC0|skc24!=skc25)). % 0.20/0.43 cnf(i_0_99, negated_conjecture, (seat(skc19)|~ssSkC0)). % 0.20/0.43 cnf(i_0_103, negated_conjecture, (front(skc18)|~ssSkC0)). % 0.20/0.43 cnf(i_0_101, negated_conjecture, (fellow(skc16)|~ssSkC0)). % 0.20/0.43 cnf(i_0_105, negated_conjecture, (young(skc17)|~ssSkC0)). % 0.20/0.43 cnf(i_0_90, negated_conjecture, (ssSkC0|seat(skc26))). % 0.20/0.43 cnf(i_0_92, negated_conjecture, (lonely(skc20)|~ssSkC0)). % 0.20/0.43 cnf(i_0_93, negated_conjecture, (way(skc20)|~ssSkC0)). % 0.20/0.43 cnf(i_0_94, negated_conjecture, (chevy(skc21)|~ssSkC0)). % 0.20/0.43 cnf(i_0_95, negated_conjecture, (car(skc21)|~ssSkC0)). % 0.20/0.43 cnf(i_0_86, negated_conjecture, (ssSkC0|front(skc27))). % 0.20/0.43 cnf(i_0_84, negated_conjecture, (ssSkC0|fellow(skc24))). % 0.20/0.43 cnf(i_0_96, negated_conjecture, (white(skc21)|~ssSkC0)). % 0.20/0.43 cnf(i_0_97, negated_conjecture, (dirty(skc21)|~ssSkC0)). % 0.20/0.43 cnf(i_0_98, negated_conjecture, (hollywood(skc23)|~ssSkC0)). % 0.20/0.43 cnf(i_0_106, negated_conjecture, (man(skc17)|~ssSkC0)). % 0.20/0.43 cnf(i_0_88, negated_conjecture, (ssSkC0|young(skc25))). % 0.20/0.43 cnf(i_0_102, negated_conjecture, (man(skc16)|~ssSkC0)). % 0.20/0.43 cnf(i_0_100, negated_conjecture, (furniture(skc19)|~ssSkC0)). % 0.20/0.43 cnf(i_0_104, negated_conjecture, (furniture(skc18)|~ssSkC0)). % 0.20/0.43 cnf(i_0_77, negated_conjecture, (lonely(skc28)|ssSkC0)). % 0.20/0.43 cnf(i_0_78, negated_conjecture, (way(skc28)|ssSkC0)). % 0.20/0.43 cnf(i_0_79, negated_conjecture, (chevy(skc29)|ssSkC0)). % 0.20/0.43 cnf(i_0_80, negated_conjecture, (car(skc29)|ssSkC0)). % 0.20/0.43 cnf(i_0_81, negated_conjecture, (white(skc29)|ssSkC0)). % 0.20/0.43 cnf(i_0_82, negated_conjecture, (dirty(skc29)|ssSkC0)). % 0.20/0.43 cnf(i_0_83, negated_conjecture, (hollywood(skc31)|ssSkC0)). % 0.20/0.43 cnf(i_0_89, negated_conjecture, (man(skc25)|ssSkC0)). % 0.20/0.43 cnf(i_0_85, negated_conjecture, (man(skc24)|ssSkC0)). % 0.20/0.43 cnf(i_0_87, negated_conjecture, (furniture(skc27)|ssSkC0)). % 0.20/0.43 cnf(i_0_91, negated_conjecture, (furniture(skc26)|ssSkC0)). % 0.20/0.43 cnf(i_0_112, negated_conjecture, (down(skc22,skc20)|~ssSkC0)). % 0.20/0.43 cnf(i_0_107, negated_conjecture, (down(skc30,skc28)|ssSkC0)). % 0.20/0.43 cnf(i_0_108, negated_conjecture, (barrel(skc30,skc29)|ssSkC0)). % 0.20/0.43 cnf(i_0_113, negated_conjecture, (barrel(skc22,skc21)|~ssSkC0)). % 0.20/0.43 cnf(i_0_114, negated_conjecture, (in(skc22,skc23)|~ssSkC0)). % 0.20/0.43 cnf(i_0_116, negated_conjecture, (in(skc17,skc18)|~ssSkC0)). % 0.20/0.43 cnf(i_0_115, negated_conjecture, (in(skc16,skc19)|~ssSkC0)). % 0.20/0.43 cnf(i_0_109, negated_conjecture, (in(skc30,skc31)|ssSkC0)). % 0.20/0.43 cnf(i_0_111, negated_conjecture, (in(skc25,skc26)|ssSkC0)). % 0.20/0.43 cnf(i_0_110, negated_conjecture, (in(skc24,skc27)|ssSkC0)). % 0.20/0.43 cnf(i_0_119, negated_conjecture, (X1=X2|~in(X2,X3)|~in(X1,X4)|~in(X5,X6)|~barrel(X5,X7)|~down(X5,X8)|~furniture(X3)|~furniture(X4)|~man(X2)|~man(X1)|~hollywood(X6)|~dirty(X7)|~white(X7)|~car(X7)|~chevy(X7)|~way(X8)|~lonely(X8)|~young(X2)|~young(X1)|~fellow(X2)|~fellow(X1)|~front(X3)|~front(X4)|~seat(X3)|~seat(X4)|~street(X8)|~old(X7)|~event(X5)|~city(X6))). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 32 steps % 0.20/0.43 cnf(i_0_109, negated_conjecture, (in(skc30,skc31)|ssSkC0), inference(start_rule)). % 0.20/0.43 cnf(i_0_155, plain, (ssSkC0), inference(extension_rule, [i_0_115])). % 0.20/0.43 cnf(i_0_1076, plain, (in(skc16,skc19)), inference(extension_rule, [i_0_119])). % 0.20/0.43 cnf(i_0_1162, plain, (~in(skc16,skc19)), inference(closure_rule, [i_0_1076])). % 0.20/0.43 cnf(i_0_1163, plain, (~in(skc16,skc19)), inference(closure_rule, [i_0_1076])). % 0.20/0.43 cnf(i_0_1177, plain, (~young(skc16)), inference(closure_rule, [i_0_76])). % 0.20/0.43 cnf(i_0_1178, plain, (~young(skc16)), inference(closure_rule, [i_0_76])). % 0.20/0.43 cnf(i_0_1181, plain, (~front(skc19)), inference(closure_rule, [i_0_73])). % 0.20/0.43 cnf(i_0_1182, plain, (~front(skc19)), inference(closure_rule, [i_0_73])). % 0.20/0.43 cnf(i_0_1185, plain, (~street(skc20)), inference(closure_rule, [i_0_72])). % 0.20/0.43 cnf(i_0_1186, plain, (~old(skc21)), inference(closure_rule, [i_0_71])). % 0.20/0.43 cnf(i_0_154, plain, (in(skc30,skc31)), inference(etableau_closure_rule, [i_0_154, ...])). % 0.20/0.43 cnf(i_0_1160, plain, (skc16=skc16), inference(etableau_closure_rule, [i_0_1160, ...])). % 0.20/0.43 cnf(i_0_1164, plain, (~barrel(skc16,skc21)), inference(etableau_closure_rule, [i_0_1164, ...])). % 0.20/0.43 cnf(i_0_1165, plain, (~down(skc16,skc20)), inference(etableau_closure_rule, [i_0_1165, ...])). % 0.20/0.43 cnf(i_0_1166, plain, (~furniture(skc19)), inference(etableau_closure_rule, [i_0_1166, ...])). % 0.20/0.43 cnf(i_0_1167, plain, (~furniture(skc19)), inference(etableau_closure_rule, [i_0_1167, ...])). % 0.20/0.43 cnf(i_0_1168, plain, (~man(skc16)), inference(etableau_closure_rule, [i_0_1168, ...])). % 0.20/0.43 cnf(i_0_1169, plain, (~man(skc16)), inference(etableau_closure_rule, [i_0_1169, ...])). % 0.20/0.43 cnf(i_0_1170, plain, (~hollywood(skc19)), inference(etableau_closure_rule, [i_0_1170, ...])). % 0.20/0.43 cnf(i_0_1171, plain, (~dirty(skc21)), inference(etableau_closure_rule, [i_0_1171, ...])). % 0.20/0.43 cnf(i_0_1172, plain, (~white(skc21)), inference(etableau_closure_rule, [i_0_1172, ...])). % 0.20/0.43 cnf(i_0_1173, plain, (~car(skc21)), inference(etableau_closure_rule, [i_0_1173, ...])). % 0.20/0.43 cnf(i_0_1174, plain, (~chevy(skc21)), inference(etableau_closure_rule, [i_0_1174, ...])). % 0.20/0.43 cnf(i_0_1175, plain, (~way(skc20)), inference(etableau_closure_rule, [i_0_1175, ...])). % 0.20/0.43 cnf(i_0_1176, plain, (~lonely(skc20)), inference(etableau_closure_rule, [i_0_1176, ...])). % 0.20/0.43 cnf(i_0_1179, plain, (~fellow(skc16)), inference(etableau_closure_rule, [i_0_1179, ...])). % 0.20/0.43 cnf(i_0_1180, plain, (~fellow(skc16)), inference(etableau_closure_rule, [i_0_1180, ...])). % 0.20/0.43 cnf(i_0_1183, plain, (~seat(skc19)), inference(etableau_closure_rule, [i_0_1183, ...])). % 0.20/0.43 cnf(i_0_1184, plain, (~seat(skc19)), inference(etableau_closure_rule, [i_0_1184, ...])). % 0.20/0.43 cnf(i_0_1187, plain, (~event(skc16)), inference(etableau_closure_rule, [i_0_1187, ...])). % 0.20/0.43 cnf(i_0_1188, plain, (~city(skc19)), inference(etableau_closure_rule, [i_0_1188, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # Child (10953) has found a proof. % 0.20/0.43 % 0.20/0.43 # Proof search is over... % 0.20/0.43 # Freeing feature tree %------------------------------------------------------------------------------